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

• 2025
• 
  Rosa Wolf, Klaus Heeger, André Nichterlein:
  Effective data reduction for strongly stable matching in very sparse graphs. Inf. Process. Lett. 188: 106534 (2025)
• 2024
• 
  Anne-Sophie Himmel, George B. Mertzios, André Nichterlein, Rolf Niedermeier:
  Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems. Commun. ACM 67(4): 70-79 (2024)
• 
  Aleksander Figiel, Darya Melnyk, André Nichterlein, Arash Pourdamghani, Stefan Schmid:
  Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation. SPAA 2024: 447-449
• 
  Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez:
  Destroying Densest Subgraphs Is Hard. SWAT 2024: 6:1-6:17
• 
  Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez:
  Destroying Densest Subgraphs is Hard. CoRR abs/2404.08599 (2024)
• 
  Aleksander Figiel, Darya Melnyk, André Nichterlein, Arash Pourdamghani, Stefan Schmid:
  SpiderDAN: Matching Augmentation in Demand-Aware Networks. CoRR abs/2411.11426 (2024)
• 2023
• 
  Matthias Bentert, André Nichterlein:
  Parameterized Complexity of Diameter. Algorithmica 85(2): 325-351 (2023)
• 
  Matthias Bentert, René van Bevern, Till Fluschnik, André Nichterlein, Rolf Niedermeier:
  Polynomial-time data reduction for weighted problems beyond additive goal functions. Discret. Appl. Math. 328: 117-133 (2023)
• 
  Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
  Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. J. Graph Algorithms Appl. 27(3): 173-194 (2023)
• 
  Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche:
  Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths. SIAM J. Discret. Math. 37(3): 1674-1703 (2023)
• 
  Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche:
  Correlating Theory and Practice in Finding Clubs and Plexes. ESA 2023: 47:1-47:18
• 
  Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller:
  Graph Clustering Problems Under the Lens of Parameterized Local Search. IPEC 2023: 20:1-20:19
• 
  Klaus Heeger, André Nichterlein, Rolf Niedermeier:
  Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. STACS 2023: 35:1-35:19
• 
  Klaus Heeger, André Nichterlein, Rolf Niedermeier:
  Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions. CoRR abs/2301.00797 (2023)
• 2022
• 
  Matthias Bentert, René van Bevern, André Nichterlein, Rolf Niedermeier, Pavel V. Smirnov:
  Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments. INFORMS J. Comput. 34(1): 55-75 (2022)
• 
  Niclas Boehmer, Robert Bredereck, André Nichterlein:
  Combating Collusion Rings Is Hard but Possible. AAAI 2022: 4843-4850
• 
  Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier:
  There and Back Again: On Applying Data Reduction Rules by Undoing Others. ESA 2022: 53:1-53:15
• 
  Hjalmar Schulz, André Nichterlein, Rolf Niedermeier, Christopher Weyand:
  Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time. IPEC 2022: 25:1-25:14
• 
  Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer:
  Covering Many (Or Few) Edges with k Vertices in Sparse Graphs. STACS 2022: 42:1-42:18
• 
  Tomohiro Koana, Christian Komusiewicz, André Nichterlein, Frank Sommer:
  Covering Many (or Few) Edges with k Vertices in Sparse Graphs. CoRR abs/2201.05465 (2022)
• 
  Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier:
  There and Back Again: On Applying Data Reduction Rules by Undoing Others. CoRR abs/2206.14698 (2022)
• 
  Tomohiro Koana, André Nichterlein, Niklas Wünsche:
  Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma. CoRR abs/2211.07001 (2022)
• 
  Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche:
  Correlating Theory and Practice in Finding Clubs and Plexes. CoRR abs/2212.07533 (2022)
• 2021
• 
  Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
  Parameterized Dynamic Cluster Editing. Algorithmica 83(1): 1-44 (2021)
• 
  Tomohiro Koana, André Nichterlein:
  Detecting and enumerating small induced subgraphs in c-closed graphs. Discret. Appl. Math. 302: 198-207 (2021)
• 
  Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche:
  Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ACM J. Exp. Algorithmics 26: 1.3:1-1.3:30 (2021)
• 
  Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
  On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. J. Graph Algorithms Appl. 25(1): 521-547 (2021)
• 
  Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein:
  Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity. Theory Comput. Syst. 65(7): 1141-1142 (2021)
• 
  Aleksander Figiel, Anne-Sophie Himmel, André Nichterlein, Rolf Niedermeier:
  On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering. CIAC 2021: 216-230
• 
  Matthias Bentert, André Nichterlein, Malte Renken, Philipp Zschoche:
  Using a Geometric Lens to Find k Disjoint Shortest Paths. ICALP 2021: 26:1-26:14

skipping 103 more matches