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

• 2025
• 
  Milad Ahanjideh, Martin Milanic, Mary Servatius:
  On balanceable and simply balanceable regular graphs. Eur. J. Comb. 124: 104045 (2025)
• 2024
• 
  Clément Dallard, Martin Milanic, Kenny Storgel:
  Treewidth versus clique number. II. Tree-independence number. J. Comb. Theory B 164: 404-442 (2024)
• 
  Clément Dallard, Martin Milanic, Kenny Storgel:
  Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. J. Comb. Theory B 167: 338-391 (2024)
• 
  Daniel Dadush, Martin Milanic, Tami Tamir:
  Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue. ACM Trans. Algorithms 20(3): 21 (2024)
• 
  Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel:
  Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set. ESA 2024: 85:1-85:17
• 
  Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic:
  Computing Tree Decompositions with Small Independence Number. ICALP 2024: 51:1-51:18
• 
  Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon:
  Detecting K_2,3 as an Induced Minor. IWOCA 2024: 151-164
• 
  Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler:
  The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. SWAT 2024: 7:1-7:20
• 
  Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy:
  Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. CoRR abs/2402.00921 (2024)
• 
  Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon:
  Detecting K_{2, 3} as an induced minor. CoRR abs/2402.08332 (2024)
• 
  Clément Dallard, Matjaz Krnc, O.-joung Kwon, Martin Milanic, Andrea Munaro, Kenny Storgel, Sebastian Wiederrecht:
  Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star. CoRR abs/2402.11222 (2024)
• 
  Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel:
  Tree decompositions meet induced matchings: beyond Max Weight Independent Set. CoRR abs/2402.15834 (2024)
• 
  Milad Ahanjideh, Martin Milanic, Mary Servatius:
  On balanceable and simply balanceable regular graphs. CoRR abs/2403.05418 (2024)
• 
  Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler:
  The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. CoRR abs/2404.10670 (2024)
• 
  Endre Boros, Vladimir Gurvich, Martin Milanic, Dmitry Tikhanovsky, Yushi Uno:
  On Minimal Transversals of Maximal Cliques in Graphs. CoRR abs/2405.10789 (2024)
• 
  Martin Milanic, Nevena Pivac:
  A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor. CoRR abs/2405.15543 (2024)
• 2023
• 
  Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer:
  Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica 85(5): 1459-1489 (2023)
• 
  Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer:
  Fair allocation algorithms for indivisible items under structured conflict constraints. Comput. Appl. Math. 42(7): 302 (2023)
• 
  Martin Milanic, Nevena Pivac:
  Computing well-covered vector spaces of graphs using modular decomposition. Comput. Appl. Math. 42(8): 360 (2023)
• 
  Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac:
  Allocation of indivisible items with individual preference graphs. Discret. Appl. Math. 334: 45-62 (2023)
• 
  Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý:
  Treewidth Is NP-Complete on Cubic Graphs. IPEC 2023: 7:1-7:13
• 
  Martin Milanic, Yushi Uno:
  Upper Clique Transversals in Graphs. WG 2023: 432-446
• 
  Clément Dallard, Vadim V. Lozin, Martin Milanic, Kenny Storgel, Viktor Zamaraev:
  Functionality of box intersection graphs. CoRR abs/2301.09493 (2023)
• 
  Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý:
  Treewidth is NP-Complete on Cubic Graphs (and related results). CoRR abs/2301.10031 (2023)
• 
  Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer:
  Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints. CoRR abs/2308.09399 (2023)
• 
  Endre Boros, Vladimir Gurvich, Martin Milanic, Yushi Uno:
  Dually conformal hypergraphs. CoRR abs/2309.00098 (2023)
• 
  Martin Milanic, Yushi Uno:
  Upper clique transversals in graphs. CoRR abs/2309.14103 (2023)
• 
  Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy:
  Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. CoRR abs/2312.01804 (2023)
• 
  Martin Milanic, Irena Penev, Nevena Pivac, Kristina Vuskovic:
  Bisimplicial separators. CoRR abs/2312.10830 (2023)
• 2022
• 
  Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius:
  Avoidable vertices and edges in graphs: Existence, characterization, and applications. Discret. Appl. Math. 309: 285-300 (2022)

skipping 180 more matches