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

• 2016
• 
  Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis:
  Parameterized Power Vertex Cover. WG 2016: 97-108
• 
  Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer:
  Sequence Hypergraphs. WG 2016: 282-294
• 
  Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx:
  Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property. WG 2016: 233-244
• 
  Andreas Brandstädt, Raffaele Mosca:
  Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs. WG 2016: 38-49
• 
  Leizhen Cai, Junjie Ye:
  Finding Two Edge-Disjoint Paths with Length Constraints. WG 2016: 62-73
• 
  Rajesh Chitnis, Lior Kamma, Robert Krauthgamer:
  Tight Bounds for Gomory-Hu-like Cut Counting. WG 2016: 133-144
• 
  Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
  Sequences of Radius k for Complete Bipartite Graphs. WG 2016: 1-12
• 
  Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
  Geodetic Convexity Parameters for Graphs with Few Short Induced Paths. WG 2016: 25-37
• 
  Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed:
  Eccentricity Approximating Trees - Extended Abstract. WG 2016: 145-157
• 
  Kunal Dutta, Arijit Ghosh:
  On Subgraphs of Bounded Degeneracy in Hypergraphs. WG 2016: 295-306
• 
  Bruno Escoffier:
  Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results. WG 2016: 50-61
• 
  Fedor V. Fomin, Torstein J. F. Strømme:
  Vertex Cover Structural Parameterization Revisited. WG 2016: 171-182
• 
  Archontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos:
  Packing and Covering Immersion Models of Planar Subcubic Graphs. WG 2016: 74-84
• 
  Jan Goedgebeur, Oliver Schaudt:
  Exhaustive Generation of k-Critical ℋ-Free Graphs. WG 2016: 109-120
• 
  Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom:
  Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. WG 2016: 195-206
• 
  Linda Kleist:
  Drawing Planar Graphs with Prescribed Face Areas. WG 2016: 158-170
• 
  Sudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman, Prafullkumar Tale:
  Harmonious Coloring: Parameterized Algorithms and Upper Bounds. WG 2016: 245-256
• 
  Frédéric Maffray, Lucas Pastor:
  The Maximum Weight Stable Set Problem in ( P_6 , bull)-Free Graphs. WG 2016: 85-96
• 
  Pedro Montealegre, Ioan Todinca:
  On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators. WG 2016: 183-194
• 
  Martin Pergel, Pawel Rzazewski:
  On Edge Intersection Graphs of Paths with 2 Bends. WG 2016: 207-219
• 
  M. S. Ramanujan:
  A Faster Parameterized Algorithm for Group Feedback Edge Set. WG 2016: 269-281
• 
  Ondrej Suchý:
  On Directed Steiner Trees with Multiple Roots. WG 2016: 257-268
• 
  Mingyu Xiao, Shaowei Kou:
  Almost Induced Matching: Linear Kernels and Parameterized Algorithms. WG 2016: 220-232
• 
  Jie You, Jianxin Wang, Yixin Cao:
  Approximate Association via Dissociation. WG 2016: 13-24
• 
  Emile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart:
  Induced Separation Dimension. WG 2016: 121-132
• 
  Pinar Heggernes:
  Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers. Lecture Notes in Computer Science 9941, 2016, ISBN 978-3-662-53535-6 [contents]