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

• 2022
• 
  Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann:
  Minimal Roman Dominating Functions: Extensions and Enumeration. WG 2022: 1-15
• 
  Oswin Aichholzer, Julia Obmann, Pavel Paták, Daniel Perz, Josef Tkadlec, Birgit Vogtenhuber:
  Disjoint Compatibility via Graph Classes. WG 2022: 16-28
• 
  Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman:
  Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract). WG 2022: 29-42
• 
  Jakub Balabán, Petr Hlinený, Jan Jedelský:
  Twin-Width and Transductions of Proper k-Mixed-Thin Graphs. WG 2022: 43-55
• 
  Valentin Bartier, Nicolas Bousquet, Jihad Hanna, Amer E. Mouawad, Sebastian Siebertz:
  Token Sliding on Graphs of Girth Five. WG 2022: 56-69
• 
  Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle:
  Recognition of Linear and Star Variants of Leaf Powers is in P. WG 2022: 70-83
• 
  Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen:
  Problems Hard for Treewidth but Easy for Stable Gonality. WG 2022: 84-97
• 
  Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna:
  Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. WG 2022: 98-113
• 
  Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma:
  An Algorithmic Framework for Locally Constrained Homomorphisms. WG 2022: 114-128
• 
  Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri, Raji R. Pillai:
  s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs. WG 2022: 129-143
• 
  Vera Chekan, Torsten Ueckerdt:
  Polychromatic Colorings of Unions of Geometric Hypergraphs. WG 2022: 144-157
• 
  David Dekker, Bart M. P. Jansen:
  Kernelization for Feedback Vertex Set via Elimination Distance to a Forest. WG 2022: 158-172
• 
  Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon:
  Finding k-Secluded Trees Faster. WG 2022: 173-186
• 
  Gabriel L. Duarte, Uéverton S. Souza:
  On the Minimum Cycle Cover Problem on Graphs with Bounded Co-degeneracy. WG 2022: 187-200
• 
  Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
  On the Lossy Kernelization for Connected Treedepth Deletion Set. WG 2022: 201-214
• 
  Andreas Emil Feldmann, Tung Anh Vu:
  Generalized k-Center: Distinguishing Doubling and Highway Dimension. WG 2022: 215-229
• 
  Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman:
  Extending Partial Representations of Circular-Arc Graphs. WG 2022: 230-243
• 
  Mathew C. Francis, Atrayee Majumder, Rogers Mathew:
  Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates. WG 2022: 244-256
• 
  Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
  Parameterized Complexity of Weighted Multicut in Trees. WG 2022: 257-270
• 
  Ina Goeßmann, Jonathan Klawitter, Boris Klemz, Felix Klesen, Stephen G. Kobourov, Myroslav Kryven, Alexander Wolff, Johannes Zink:
  The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. WG 2022: 271-286
• 
  Hugo Jacob, Marcin Pilipczuk:
  Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs. WG 2022: 287-299
• 
  Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii:
  On Anti-stochastic Properties of Unlabeled Graphs. WG 2022: 300-312
• 
  Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski:
  Computing List Homomorphisms in Geometric Intersection Graphs. WG 2022: 313-327
• 
  Fabian Klute, Marc J. van Kreveld:
  On Fully Diverse Sets of Geometric Objects and Graphs. WG 2022: 328-341
• 
  Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa:
  Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings. WG 2022: 342-355
• 
  R. Krithika, Roohani Sharma, Prafullkumar Tale:
  The Complexity of Contracting Bipartite Graphs into Small Cycles. WG 2022: 356-369
• 
  Hélène Langlois, Frédéric Meunier, Romeo Rizzi, Stéphane Vialette:
  Algorithmic Aspects of Small Quasi-Kernels. WG 2022: 370-382
• 
  Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini:
  Parameterized Complexity of Graph Planarity with Restricted Cyclic Orders. WG 2022: 383-397
• 
  Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
  Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. WG 2022: 398-411
• 
  Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
  Classifying Subset Feedback Vertex Set for H-Free Graphs. WG 2022: 412-424

skipping 3 more matches