• 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 38 matches

• 2014
• 
  Eduardo Álvarez-Miranda, Alfredo Candia-Véjar, Emilio Carrizosa, Francisco Pérez-Galarce:
  Vulnerability Assessment of Spatial Networks: Models and Solutions. ISCO 2014: 433-444
• 
  Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari:
  Maximum Throughput Network Routing Subject to Fair Flow Allocation. ISCO 2014: 1-12
• 
  Gabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler:
  Study of Identifying Code Polyhedra for Some Families of Split Graphs. ISCO 2014: 13-25
• 
  Jean-François Baffier, Vorapong Suppakitpaisarn, Hidefumi Hiraishi, Hiroshi Imai:
  Parametric Multiroute Flow and Its Application to Robust Network with k Edge Failures. ISCO 2014: 26-37
• 
  Mourad Baïou, Francisco Barahona:
  The Dominating Set Polytope via Facility Location. ISCO 2014: 38-49
• 
  Sandro Bartolini, Iacopo Casini, Paolo Detti:
  Solving Graph Partitioning Problems Arising in Tagless Cache Management. ISCO 2014: 50-61
• 
  Frank Baumann, Christoph Buchheim, Anna Ilyina:
  Lagrangean Decomposition for Mean-Variance Combinatorial Optimization. ISCO 2014: 62-74
• 
  Marco Bender, Stephan Westphal:
  Maximum Generalized Assignment with Convex Costs. ISCO 2014: 75-86
• 
  Eduardo T. Bogue, Cid C. de Souza, Eduardo C. Xavier, Alexandre S. Freire:
  An Integer Programming Formulation for the Maximum k-Subset Intersection Problem. ISCO 2014: 87-99
• 
  Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
  b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs. ISCO 2014: 100-111
• 
  Mario Brcic, Damir Kalpic, Marija Katic:
  Proactive Reactive Scheduling in Resource Constrained Projects with Flexibility and Quality Robustness Requirements. ISCO 2014: 112-124
• 
  Christoph Buchheim, Long Trieu:
  Active Set Methods with Reoptimization for Convex Quadratic Integer Programming. ISCO 2014: 125-136
• 
  Laurent Bulteau, Anna Paola Carrieri, Riccardo Dondi:
  Fixed-Parameter Algorithms for Scaffold Filling. ISCO 2014: 137-148
• 
  Cassio Polpo de Campos, Georgios Stamoulis, Dennis Weyland:
  The Computational Complexity of Stochastic Optimization. ISCO 2014: 173-185
• 
  Federico Della Croce, Michele Garraffa, Fabio Salassa:
  A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem. ISCO 2014: 186-197
• 
  Federico Della Croce, Christos Koulamas, Vincent T'kindt:
  A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection. ISCO 2014: 198-207
• 
  Alexandre Salles da Cunha, Fernanda Sumika Hojo de Souza:
  Finding Totally Independent Spanning Trees with Linear Integer Programming. ISCO 2014: 149-160
• 
  Benoît Darties, Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König:
  Coupled-Tasks in Presence of Bipartite Compatibilities Graphs. ISCO 2014: 161-172
• 
  Yann Disser, Matús Mihalák, Sandro Montanari, Peter Widmayer:
  Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods. ISCO 2014: 208-220
• 
  Mariana S. Escalante, Graciela L. Nasini:
  Lovász and Schrijver N_+ -Relaxation on Web Graphs. ISCO 2014: 221-229
• 
  Cristina G. Fernandes, Carlos Eduardo Ferreira, Álvaro Junio Pereira Franco, Rafael Crivellari Saliba Schouery:
  The Envy-Free Pricing Problem and Unit-Demand Markets. ISCO 2014: 230-241
• 
  Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Moniz:
  Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol. ISCO 2014: 242-254
• 
  Karlis Freivalds, Jans Glagolevs:
  Graph Compact Orthogonal Layout Algorithm. ISCO 2014: 255-266
• 
  Martin Fürer, Huiwen Yu:
  Approximating the k -Set Packing Problem by Local Improvements. ISCO 2014: 408-420
• 
  Fabio Furini, Martin Philip Kidd, Carlo Alfredo Persiani, Paolo Toth:
  State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting. ISCO 2014: 267-279
• 
  Mhand Hifi, Sagvan Saleh, Lei Wu:
  A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems. ISCO 2014: 396-407
• 
  Ruben Hoeksma, Bodo Manthey, Marc Uetz:
  Decomposition Algorithm for the Single Machine Scheduling Polytope. ISCO 2014: 280-291
• 
  Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
  Subexponential Fixed-Parameter Algorithms for Partial Vector Domination. ISCO 2014: 292-304
• 
  Imed Kacem, Hans Kellerer, Maryam Seifaddini:
  Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. ISCO 2014: 305-314
• 
  Yohanes Kristianto:
  A Multi-period Bi-level Stochastic Programming with Decision Dependent Uncertainty in Supply Chains. ISCO 2014: 315-324

skipping 8 more matches