• 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

• 2024
• 
  Thomas Erlebach, Nils Morawietz, Jakob T. Spooner, Petra Wolf:
  A cop and robber game on edge-periodic temporal graphs. J. Comput. Syst. Sci. 144: 103534 (2024)
• 
  Arnaud Casteigts, Nils Morawietz, Petra Wolf:
  Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs. MFCS 2024: 36:1-36:17
• 
  Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
  On the Complexity of Community-Aware Network Sparsification. MFCS 2024: 60:1-60:18
• 
  Thomas Erlebach, Nils Morawietz, Petra Wolf:
  Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization. SAND 2024: 12:1-12:16
• 
  Emanuel Herrendorf, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
  On the Complexity of Community-aware Network Sparsification. CoRR abs/2402.15494 (2024)
• 
  Arnaud Casteigts, Nils Morawietz, Petra Wolf:
  Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs. CoRR abs/2406.19514 (2024)
• 2023
• 
  Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
  Exact Algorithms for Group Closeness Centrality. ACDA 2023: 1-12
• 
  Christian Komusiewicz, Simone Linz, Nils Morawietz, Jannik Schestag:
  On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem. CPM 2023: 18:1-18:18
• 
  Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
  Parameterized Local Search for Max c-Cut. IJCAI 2023: 5586-5594
• 
  Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller:
  Graph Clustering Problems Under the Lens of Parameterized Local Search. IPEC 2023: 20:1-20:19
• 
  Jana Holznigenkemper, Christian Komusiewicz, Nils Morawietz, Bernhard Seeger:
  On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric. MFCS 2023: 54:1-54:15
• 
  Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf:
  Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs. SOFSEM 2023: 283-297
• 
  Alexander Bille, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
  A Graph-Theoretic Formulation of Exploratory Blockmodeling. SEA 2023: 14:1-14:20
• 
  Bodo Manthey, Nils Morawietz, Jesse van Rhijn, Frank Sommer:
  Complexity of Local Search for Euclidean Clustering Problems. CoRR abs/2312.14916 (2023)
• 2022
• 
  Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
  Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. Theory Comput. Syst. 66(5): 1019-1045 (2022)
• 
  Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
  Colored cut games. Theor. Comput. Sci. 936: 13-32 (2022)
• 
  Christian Komusiewicz, Nils Morawietz:
  Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial. IPEC 2022: 20:1-20:18
• 
  Christian Komusiewicz, Nils Morawietz:
  Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard. MFCS 2022: 66:1-66:14
• 
  Emmanuel Arrighi, Niels Grüttemeier, Nils Morawietz, Frank Sommer, Petra Wolf:
  Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge Periodic Temporal Graphs. CoRR abs/2203.07401 (2022)
• 
  Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
  Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. CoRR abs/2204.02902 (2022)
• 2021
• 
  Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
  Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. AAAI 2021: 12328-12335
• 
  Christian Komusiewicz, Nils Morawietz:
  Can Local Optimality Be Used for Efficient Data Reduction? CIAC 2021: 354-366
• 
  Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
  On the Parameterized Complexity of Polytree Learning. IJCAI 2021: 4221-4227
• 
  Nils Morawietz, Petra Wolf:
  A Timecop's Chase Around the Table. MFCS 2021: 77:1-77:18
• 
  Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
  Preventing Small (s,t)Cuts by Protecting Edges. WG 2021: 143-155
• 
  Nils Morawietz, Petra Wolf:
  A Timecop's Chase Around the Table. CoRR abs/2104.08616 (2021)
• 
  Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
  On the Parameterized Complexity of Polytree Learning. CoRR abs/2105.09675 (2021)
• 
  Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
  Preventing Small (s, t)-Cuts by Protecting Edges. CoRR abs/2107.04482 (2021)
• 2020
• 
  Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
  String Factorizations Under Various Collision Constraints. CPM 2020: 17:1-17:14
• 
  Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
  Colored Cut Games. FSTTCS 2020: 30:1-30:17

skipping 4 more matches