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

• 2003
• 
  Amotz Bar-Noy, Juan A. Garay, Amir Herzberg:
  Sharing Video on Demand. Discret. Appl. Math. 129(1): 3-30 (2003)
• 
  Lali Barrière:
  Symmetry properties of chordal rings of degree 3. Discret. Appl. Math. 129(2-3): 211-232 (2003)
• 
  András A. Benczúr:
  Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems. Discret. Appl. Math. 129(2-3): 233-262 (2003)
• 
  Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes:
  Deadlock Prevention by Acyclic Orientations. Discret. Appl. Math. 129(1): 31-47 (2003)
• 
  Maurizio A. Bonuccelli, Alberto Marchetti-Spaccamela:
  Foreword. Discret. Appl. Math. 129(1): 1 (2003)
• 
  Martina Bosíková:
  Minimum 3-geodetically connected graphs. Discret. Appl. Math. 129(2-3): 263-283 (2003)
• 
  Christos Bouras, Vaggelis Kapoulas, Grammati E. Pantziou, Paul G. Spirakis:
  Competitive Video on Demand Schedulers for Popular Movies. Discret. Appl. Math. 129(1): 49-61 (2003)
• 
  Andreas Brandstädt, Feodor F. Dragan:
  On linear and circular structure of (claw, net)-free graphs. Discret. Appl. Math. 129(2-3): 285-303 (2003)
• 
  Andreas Brandstädt, Raffaele Mosca:
  On variations of P₄-sparse graphs. Discret. Appl. Math. 129(2-3): 521-532 (2003)
• 
  Peter Dankelmann, Ortrud Oellermann:
  Bounds on the average connectivity of a graph. Discret. Appl. Math. 129(2-3): 305-318 (2003)
• 
  Italo J. Dejter, Oriol Serra:
  Efficient dominating sets in Cayley graphs. Discret. Appl. Math. 129(2-3): 319-328 (2003)
• 
  Guoli Ding, Peter P. Chen:
  Generating r-regular graphs. Discret. Appl. Math. 129(2-3): 329-343 (2003)
• 
  Shane Dye, Leen Stougie, Asgeir Tomasgard:
  Approximation Algorithms and Relaxations for a Service Provision Problem on a Telecommunication Network. Discret. Appl. Math. 129(1): 63-81 (2003)
• 
  András Faragó, Áron Szentesi, Balázs Szviatovszki:
  Inverse Optimization in High-speed Networks. Discret. Appl. Math. 129(1): 83-98 (2003)
• 
  Fedor V. Fomin, Petr A. Golovach:
  Interval degree and bandwidth of a graph. Discret. Appl. Math. 129(2-3): 345-359 (2003)
• 
  Krzysztof Giaro, Robert Janczewski, Michal Malafiejski:
  The complexity of the T-coloring problem for graphs with small degree. Discret. Appl. Math. 129(2-3): 361-369 (2003)
• 
  Krzysztof Giaro, Robert Janczewski, Michal Malafiejski:
  A polynomial algorithm for finding T-span of generalized cacti. Discret. Appl. Math. 129(2-3): 371-382 (2003)
• 
  Olivier Goldschmidt, Alexandre Laugier, Eli V. Olinick:
  SONET/SDH Ring Assignment with Capacity Constraints. Discret. Appl. Math. 129(1): 99-128 (2003)
• 
  Xiaofeng Guo, Fuji Zhang:
  Planar k-cycle resonant graphs with k=1, 2. Discret. Appl. Math. 129(2-3): 383-397 (2003)
• 
  Gregory Z. Gutin, Alek Vainshtein, Anders Yeo:
  Domination analysis of combinatorial optimization problems. Discret. Appl. Math. 129(2-3): 513-520 (2003)
• 
  Gregory Z. Gutin, Anders Yeo:
  Upper bounds on ATSP neighborhood size. Discret. Appl. Math. 129(2-3): 533-538 (2003)
• 
  Harri Haanpää, Patric R. J. Östergård:
  Classification of whist tournaments with up to 12 players. Discret. Appl. Math. 129(2-3): 399-407 (2003)
• 
  Janelle J. Harms, Chenjiang Hu:
  Physical Network Design to Facilitate Capacity Reallocation. Discret. Appl. Math. 129(1): 129-153 (2003)
• 
  Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn:
  Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori. Discret. Appl. Math. 129(2-3): 409-419 (2003)
• 
  Hua-Min Huang, Frank K. Hwang, Jian-Feng Ma:
  Using transforming matrices to generate DNA clone grids. Discret. Appl. Math. 129(2-3): 421-431 (2003)
• 
  Yoshiyuki Karuno, Hiroshi Nagamochi:
  2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. Discret. Appl. Math. 129(2-3): 433-447 (2003)
• 
  Sandi Klavzar, Aleksander Vesel:
  Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers. Discret. Appl. Math. 129(2-3): 449-460 (2003)
• 
  Stavros G. Kolliopoulos:
  Approximating covering integer programs with multiplicity constraints. Discret. Appl. Math. 129(2-3): 461-473 (2003)
• 
  Carlo Mannino, Antonio Sassano:
  An Enumerative Algorithm for the Frequency Assignment Problem. Discret. Appl. Math. 129(1): 155-169 (2003)
• 
  Weizhen Mao, David M. Nicol:
  On k-ary n-cubes: Theory and Applications. Discret. Appl. Math. 129(1): 171-193 (2003)

skipping 6 more matches