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

• 2012
• 
  Christopher Auer, Christian Bachmaier, Franz-Josef Brandenburg, Andreas Gleißner, Kathrin Hanauer:
  The Duals of Upward Planar Graphs on Cylinders. WG 2012: 103-113
• 
  Daniel Berend, Amir Sapir:
  Which Multi-peg Tower of Hanoi Problems Are Exponential? WG 2012: 81-90
• 
  Anne Berry, Annegret Wagler:
  Triangulation and Clique Separator Decomposition of Claw-Free Graphs. WG 2012: 7-21
• 
  Amitava Bhattacharya:
  Alternating Reachability and Integer Sum of Closed Alternating Trails - The 3rd Annual Uri N. Peled Memorial Lecture. WG 2012: 3
• 
  Péter Biró, Matthijs Bomhoff, Petr A. Golovach, Walter Kern, Daniël Paulusma:
  Solutions for the Stable Roommates Problem with Payments. WG 2012: 69-80
• 
  Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels:
  Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs. WG 2012: 22-33
• 
  Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé:
  Parameterized Domination in Circle Graphs. WG 2012: 308-319
• 
  Gilad Braunschvig, Shiri Chechik, David Peleg:
  Fault Tolerant Additive Spanners. WG 2012: 206-214
• 
  Sara Brunetti, Gennaro Cordasco, Luisa Gargano, Elena Lodi, Walter Quattrociocchi:
  Minimum Weight Dynamo and Fast Opinion Spreading - (Extended Abstract). WG 2012: 249-261
• 
  Carmen Cecilia Centeno, Lucia Draque Penso, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá:
  Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity. WG 2012: 262-273
• 
  Steven Chaplick, Vít Jelínek, Jan Kratochvíl, Tomás Vyskocil:
  Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill. WG 2012: 274-285
• 
  Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk:
  On Group Feedback Vertex Set Parameterized by the Size of the Cutset. WG 2012: 194-205
• 
  Leah Epstein, Asaf Levin, Gerhard J. Woeginger:
  The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases. WG 2012: 114-125
• 
  Mathew C. Francis, Daniel Gonçalves, Pascal Ochem:
  The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract). WG 2012: 57-68
• 
  Fanica Gavril:
  Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs. WG 2012: 297-307
• 
  Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani:
  h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area. WG 2012: 91-102
• 
  Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk:
  How to Eliminate a Graph. WG 2012: 320-331
• 
  Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern:
  Student Poster Session. WG 2012: 4-6
• 
  Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger:
  On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties. WG 2012: 332-343
• 
  Danny Hermelin, Julián Mestre, Dror Rawitz:
  Optimization Problems in Dotted Interval Graphs. WG 2012: 46-56
• 
  Tomoya Hibi, Toshihiro Fujito:
  Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications. WG 2012: 215-224
• 
  Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
  On the Minimum Degree Up to Local Complementation: Bounds and Complexity. WG 2012: 138-147
• 
  Konstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Pawel Rzazewski:
  Determining the L(2, 1)-Span in Polynomial Space. WG 2012: 126-137
• 
  Lukasz Kowalik, Marcin Mucha:
  A 9k Kernel for Nonseparating Independent Set in Planar Graphs. WG 2012: 160-171
• 
  Stefan Kratsch, Pascal Schweitzer:
  Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs. WG 2012: 34-45
• 
  Neele Leithäuser, Sven Oliver Krumke, Maximilian Merkert:
  Approximating Infeasible 2VPI-Systems. WG 2012: 225-236
• 
  Vadim E. Levit, Martin Milanic, David Tankus:
  On the Recognition of k-Equistable Graphs. WG 2012: 286-296
• 
  Pranabendu Misra, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
  Parameterized Algorithms for Even Cycle Transversal. WG 2012: 172-183
• 
  Matthias Mnich, Rico Zenklusen:
  Bisections above Tight Lower Bounds. WG 2012: 184-193
• 
  Haiko Müller:
  On the Stable Degree of Graphs. WG 2012: 148-159

skipping 4 more matches