• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 20 matches

• 2022
• 
  Mariia Anapolska, Christina Büsing, Tabea Krabs, Tobias Mömke:
  Coworking Scheduling with Network Flows. INOC 2022: 1-6
• 
  Oliver Bachtler, Tim Bergner, Sven O. Krumke:
  Local Certification of Reachability. INOC 2022: 1-5
• 
  Ralf Borndörfer, Stephan Schwartz, William Surau:
  Rooted Maximum Weight Connected Subgraphs with Balancing and Capacity Constraints. INOC 2022: 1-6
• 
  Christina Büsing, Timo Gersing, Sophia Wrede:
  Analysing the Complexity of Facility Location Problems with Capacities, Revenues, and Closest Assignments. INOC 2022: 1-6
• 
  Christina Büsing, Arie M. C. A. Koster:
  Foreword. INOC 2022: 1-4
• 
  Christina Büsing, Arie Koster, Sabrina Schmitz:
  On the complexity of robust transshipment under consistent flow constraints. INOC 2022: 1-6
• 
  Giulia Caselli, Giomaria Columbu, Manuel Iori, Carlo Alberto Magni:
  Mixed Integer Linear Programming for CO2 emissions minimization in a Waste Transfer Facility Location Problem. INOC 2022: 1-6
• 
  Rafael Colares, Amal Benhamiche, Yannick Carlinet, Nancy Perrot:
  A branch-and-cut algorithm for the availability-aware VNF placement problem in virtualized networks. INOC 2022: 1-6
• 
  Julien Khamphousone, André Rossi, Fabián Castaño, Sonia Toubaline:
  A robust variant of the Ring Star Problem. INOC 2022: 1-6
• 
  Timo Kreimeier, Martina Kuchlbauer, Frauke Liers, Michael Stingl, Andrea Walther:
  Towards the Solution of Robust Gas Network Optimization Problems Using the Constrained Active Signature Method. INOC 2022: 1-6
• 
  Youcef Magnouche, Sébastien Martin, Jérémie Leguay, Francesco De Pellegrini, Rachid Elazouzi, Cédric Richier:
  Branch-and-Benders-Cut Algorithm for the Weighted Coflow Completion Time Minimization Problem. INOC 2022: 1-6
• 
  Minh Hieu Nguyen, Viet Hung Nguyen, Thi Quynh Trang Vo, Mourad Baïou:
  Nash fairness solutions for balanced TSP. INOC 2022: 1-6
• 
  Hao Pan, Balabhaskar Balasundaram, Juan Sebastian Borrero:
  A Decomposition Branch-and-Cut Algorithm for the Maximum Cross-Graph k-Club Problem. INOC 2022: 1-6
• 
  Amirreza Pashapour, Dilek Günneç, F. Sibel Salman, Eda Yücel:
  A Capacitated Mobile Facility Location Problem with Mobile Demand: Recurrent Service Provision to En Route Refugees. INOC 2022: 1-6
• 
  Phillippe Samer, Dag Haugland:
  Towards Stronger Lagrangean Bounds for Stable Spanning Trees. INOC 2022: 1-5
• 
  Philine Schiewe, Moritz Stinzendörfer:
  Integrated Line Planning and Vehicle Scheduling for Public Transport. INOC 2022: 1-6
• 
  Pedro Henrique Fernandes da Silva, Hervé Kervin, Juan Pablo Nant, Annegret Wagler:
  A framework for routing and spectrum assignment in optical networks, driven by combinatorial properties. INOC 2022: 1-6
• 
  Artur Tomaszewski, Michal Pióro, Mariusz Mycek:
  Max-Min Optimization of Controller Placements vs. Min-Max Optimization of Attacks on Nodes in Service Networks. INOC 2022: 1-6
• 
  Giorgio Zucchi, Victor H. V. Corrêa, André G. Santos, Manuel Iori, Mutsunori Yagiura:
  A Metaheuristic Algorithm for a Multi-period Orienteering Problem arising in a Car Patrolling Application. INOC 2022: 1-6
• 
  Christina Büsing, Arie M. C. A. Koster:
  Proceedings of the 10th International Network Optimization Conference, INOC 2022, Aachen, Germany, June 7-10, 2022. OpenProceedings.org 2022, ISBN 978-3-89318-090-5 [contents]