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

• 2024
• 
  Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
  On Critical Node Problems with Vulnerable Vertices. J. Graph Algorithms Appl. 28(1): 1-26 (2024)
• 
  Jens Otto, Niels Grüttemeier, Felix Specht:
  Security Decisions for Cyber-Physical Systems based on Solving Critical Node Problems with Vulnerable Nodes. CoRR abs/2406.10287 (2024)
• 2023
• 
  Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
  Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. Discret. Math. Theor. Comput. Sci. 25 (2023)
• 
  Jaroslav Garvardt, Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
  Parameterized Local Search for Max c-Cut. IJCAI 2023: 5586-5594
• 
  Niels Grüttemeier, Andreas Bunte, Stefan Windmann:
  Optimization of a High Storage System with two Cranes per Aisle. INDIN 2023: 1-6
• 
  Niels Grüttemeier, Kaja Balzereit, Nehal Soni, Andreas Bunte:
  Efficient Production Scheduling by Exploiting Repetitive Product Configurations. INDIN 2023: 1-6
• 
  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
• 2022
• 
  Niels Grüttemeier:
  Parameterized Algorithmics for Graph-Based Data Analysis. University of Marburg, Germany, 2022
• 
  Niels Grüttemeier, Christian Komusiewicz:
  Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. J. Artif. Intell. Res. 74: 1225-1267 (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)
• 
  Jannik Schestag, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
  On Critical Node Problems with Vulnerable Vertices. IWOCA 2022: 494-508
• 
  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)
• 
  Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz, Frank Sommer:
  Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs. CoRR abs/2211.01701 (2022)
• 2021
• 
  Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer:
  Destroying Bicolored P₃s by Deleting Few Edges. Discret. Math. Theor. Comput. Sci. 23(1) (2021)
• 
  Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge:
  Your rugby mates don't need to know your colleagues: Triadic closure with edge colors. J. Comput. Syst. Sci. 120: 75-96 (2021)
• 
  Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
  Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings. AAAI 2021: 12328-12335
• 
  Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
  On the Parameterized Complexity of Polytree Learning. IJCAI 2021: 4221-4227
• 
  Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
  Preventing Small (s,t)Cuts by Protecting Edges. WG 2021: 143-155
• 
  Nils Jakob Eckstein, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
  Destroying Multicolored Paths and Cycles in Edge-Colored Graphs. CoRR abs/2104.03138 (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:
  On the Relation of Strong Triadic Closure and Cluster Deletion. Algorithmica 82(4): 853-880 (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
• 
  Niels Grüttemeier, Christian Komusiewicz:
  Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis. IJCAI 2020: 4245-4251
• 
  Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
  Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs. SOFSEM 2020: 248-259
• 
  Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz:
  Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs. SWAT 2020: 26:1-26:17

skipping 8 more matches