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

• 2015
• 
  Claudia Archetti, Nicola Bianchessi, Alain Hertz, Adrien Colombet, François Gagnon:
  Directed weighted improper coloring for cellular channel allocation. Discret. Appl. Math. 182: 46-60 (2015)
• 
  Jacek Blazewicz, Alain Hertz, Christophe Picouleau, Marino Widmer:
  Foreword. Discret. Appl. Math. 182: 1 (2015)
• 
  Piotr Borowiecki, Dieter Rautenbach:
  New potential functions for greedy independence and coloring. Discret. Appl. Math. 182: 61-72 (2015)
• 
  Márcia R. Cappelle, Felix Joos, Janina Müttel, Dieter Rautenbach:
  Badly-covered graphs. Discret. Appl. Math. 182: 99-103 (2015)
• 
  Jean-François Culus, Marc Demange, Ruxandra Marinescu-Ghemeci, Cerasela Tanasescu:
  About some robustness and complexity properties of G-graphs networks. Discret. Appl. Math. 182: 34-45 (2015)
• 
  Konrad K. Dabrowski, Vadim V. Lozin, Juraj Stacho:
  Stable-iΠ partitions of graphs. Discret. Appl. Math. 182: 104-114 (2015)
• 
  Simone Dantas, Celina M. H. de Figueiredo, Frédéric Maffray, Rafael B. Teixeira:
  The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem. Discret. Appl. Math. 182: 15-24 (2015)
• 
  Simone Dantas, Sylvain Gravier, Telma Pará:
  Solitaire Clobber played on Cartesian product of graphs. Discret. Appl. Math. 182: 84-90 (2015)
• 
  Mateusz Gorczyca, Adam Janiak, Wladyslaw A. Janiak, Marcin Dymanski:
  Makespan optimization in a single-machine scheduling problem with dynamic job ready times - Complexity and algorithms. Discret. Appl. Math. 182: 162-168 (2015)
• 
  Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada, Martin Vatshelle:
  Constructions of k-critical P5-free graphs. Discret. Appl. Math. 182: 91-98 (2015)
• 
  Robert Janczewski, Anna Malafiejska, Michal Malafiejski:
  Interval incidence graph coloring. Discret. Appl. Math. 182: 73-83 (2015)
• 
  Marcin Jakub Kaminski, Martin Milanic:
  On the complexity of the identifiable subgraph problem. Discret. Appl. Math. 182: 25-33 (2015)
• 
  Antonio Jose Lozano, Juan A. Mesa, Frank Plastria:
  Location of weighted anti-ordered median straight lines with Euclidean distances. Discret. Appl. Math. 182: 122-133 (2015)
• 
  Vadim V. Lozin, Raffaele Mosca, Christopher Purcell:
  Independent domination in finitely defined classes of graphs: Polynomial algorithms. Discret. Appl. Math. 182: 2-14 (2015)
• 
  Dmitrii Lozovanu, Stefan Pickl:
  Determining the optimal strategies for discrete control problems on stochastic networks with discounted costs. Discret. Appl. Math. 182: 169-180 (2015)
• 
  Rafal Rózycki, Jan Weglarz:
  Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic. Discret. Appl. Math. 182: 150-161 (2015)
• 
  Dvir Shabtay, George Steiner, Liron Yedidsion:
  A pseudo-polynomial time algorithm for solving the resource dependent assignment problem. Discret. Appl. Math. 182: 115-121 (2015)
• 
  Marta Szachniuk, Maria Cristina De Cola, Giovanni Felici, Dominique de Werra, Jacek Blazewicz:
  Optimal pathway reconstruction on 3D NMR maps. Discret. Appl. Math. 182: 134-149 (2015)