Martin Milanic

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 133

Top Venues

Publications

Clément Dallard, Martin Milanic, Kenny Storgel
Treewidth versus clique number. II. Tree-independence number. J. Comb. Theory, Ser. B 164 (2024)
Endre Boros, Vladimir Gurvich, Martin Milanic, Dmitry Tikhanovsky, Yushi Uno
On Minimal Transversals of Maximal Cliques in Graphs. CoRR (2024)
Daniel Dadush, Martin Milanic, Tami Tamir
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue. ACM Trans. Algorithms 20 (3) (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 (2024)
Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon
as an induced minor. CoRR (2024)
Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
Computing Tree Decompositions with Small Independence Number. ICALP (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 (2024)
Milad Ahanjideh, Martin Milanic, Mary Servatius
On balanceable and simply balanceable regular graphs. CoRR (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. SWAT (2024)
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 (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 (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 (2024)
Martin Milanic, Nevena Pivac
A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor. CoRR (2024)
Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon
as an Induced Minor. IWOCA (2024)
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer
Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints. CoRR (2023)
Martin Milanic, Yushi Uno
Upper Clique Transversals in Graphs. WG (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)
Martin Milanic, Irena Penev, Nevena Pivac, Kristina Vuskovic
Bisimplicial separators. CoRR (2023)
Martin Milanic, Nevena Pivac
Computing well-covered vector spaces of graphs using modular decomposition. Comput. Appl. Math. 42 (8) (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 (2023)
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica 85 (5) (2023)
Endre Boros, Vladimir Gurvich, Martin Milanic, Yushi Uno
Dually conformal hypergraphs. CoRR (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 (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) (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 (2023)
Martin Milanic, Yushi Uno
Upper clique transversals in graphs. CoRR (2023)
Clément Dallard, Vadim V. Lozin, Martin Milanic, Kenny Storgel, Viktor Zamaraev
Functionality of box intersection graphs. CoRR (2023)
Martin Milanic, Nevena Pivac
Computing Well-Covered Vector Spaces of Graphs using Modular Decomposition. CoRR (2022)
Martin Milanic, Pawel Rzazewski
Tree decompositions with bounded independence number: beyond independent sets. CoRR (2022)
Eun Jung Kim, Martin Milanic, Jérôme Monnot, Christophe Picouleau
Complexity and algorithms for constant diameter augmentation problems. Theor. Comput. Sci. 904 (2022)
Ferdinando Cicalese, Clément Dallard, Martin Milanic
On Constrained Intersection Representations of Graphs and Digraphs. ISAAC (2022)
Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
Shifting paths to avoidable ones. J. Graph Theory 100 (1) (2022)
Clément Dallard, Blas Fernández, Gyula Y. Katona, Martin Milanic, Kitti Varga
Conditions for minimally tough graphs. CoRR (2022)
Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
Avoidability beyond paths. CoRR (2022)
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. CoRR (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 (2022)
Clément Dallard, Martin Milanic, Kenny Storgel
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. CoRR (2022)
Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
Computing Tree Decompositions with Small Independence Number. CoRR (2022)
Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
Graphs with at most two moplexes. CoRR (2021)
Clément Dallard, Mirza Krbezlija, Martin Milanic
Vertex Cover at Distance on H-Free Graphs. IWOCA (2021)
Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic
Strong cliques in diamond-free graphs. Theor. Comput. Sci. 858 (2021)
Clément Dallard, Martin Milanic, Kenny Storgel
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure. SIAM J. Discret. Math. 35 (4) (2021)
Clément Dallard, Martin Milanic, Kenny Storgel
Tree decompositions with bounded independence number and their algorithmic applications. CoRR (2021)
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Nevena Pivac, Ulrich Pferschy
Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT (2021)
Martin Milanic, Nevena Pivac
Polynomially Bounding the Number of Minimal Separators in Graphs: Reductions, Sufficient Conditions, and a Dichotomy Theorem. Electron. J. Comb. 28 (1) (2021)
Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
Graphs with Two Moplexes. LAGOS (2021)
Ratko Darda, Martin Milanic, Miguel A. Pizaña
Searching for square-complementary graphs: Complexity of recognition and further nonexistence results. Discret. Math. 344 (6) (2021)
Clément Dallard, Martin Milanic, Kenny Storgel
Treewidth versus clique number in graph classes with a forbidden structure. CoRR (2020)
Endre Boros, Vladimir Gurvich, Martin Milanic, Jernej Vicic
On the degree sequences of dual graphs on surfaces. CoRR (2020)
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
Fair Packing of Independent Sets. IWOCA (2020)
Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
Mind the independence gap. Discret. Math. 343 (9) (2020)
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler
Edge Elimination and Weighted Graph Classes. WG (2020)
Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
Shifting paths to avoidable ones. CoRR (2020)
Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic
Strong Cliques in Diamond-Free Graphs. WG (2020)
Endre Boros, Vladimir Gurvich, Martin Milanic
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. J. Graph Theory 94 (3) (2020)
Clément Dallard, Martin Milanic, Kenny Storgel
Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure. WG (2020)
Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
Fair packing of independent sets. CoRR (2020)
Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma
Bipartite graphs of small readability. Theor. Comput. Sci. 806 (2020)
Edin Husic, Martin Milanic
A Polynomial-Time Algorithm for the Independent Set Problem in P_10, C_4, C_6 -Free Graphs. WG (2019)
Ademir Hujdurovic, Martin Milanic, Bernard Ries
Detecting strong cliques. Discret. Math. 342 (9) (2019)
Nina Chiarelli, Martin Milanic
Linear separation of connected dominating sets in graphs. Ars Math. Contemp. 16 (2) (2019)
Endre Boros, Vladimir Gurvich, Martin Milanic
Decomposing 1-Sperner Hypergraphs. Electron. J. Comb. 26 (3) (2019)
Andreas Brandstädt, Martin Milanic
A dichotomy for weighted efficient dominating sets with bounded degree vertices. Inf. Process. Lett. 142 (2019)
Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius
Avoidable Vertices and Edges in Graphs. CoRR (2019)
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic
-domination problems in proper interval graphs. Theor. Comput. Sci. 795 (2019)
Liliana Alcón, Marisa Gutierrez, Martin Milanic
A Characterization of Claw-free CIS Graphs and New Results on the Order of CIS Graphs. LAGOS (2019)
Edin Husic, Xinyue Li, Ademir Hujdurovic, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanic, Alexandru I. Tomescu
MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP. Bioinform. 35 (5) (2019)
Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius
Avoidable Vertices and Edges in Graphs. WADS (2019)
Martin Milanic, Nevena Pivac
Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs. WG (2019)
Bostjan Bresar, Tatiana Romina Hartinger, Tim Kos, Martin Milanic
On total domination in the Cartesian product of graphs. Discuss. Math. Graph Theory 38 (4) (2018)
Ratko Darda, Martin Milanic, Miguel A. Pizaña
Searching for square-complementary graphs: non-existence results and complexity of recognition. CoRR (2018)
Ademir Hujdurovic, Martin Milanic, Bernard Ries
Detecting strong cliques. CoRR (2018)
Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
Mind the Independence Gap. CoRR (2018)
Bostjan Bresar, Tatiana Romina Hartinger, Tim Kos, Martin Milanic
1-perfectly orientable K4-minor-free and outerplanar graphs. Discret. Appl. Math. 248 (2018)
Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu
Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples. IEEE ACM Trans. Comput. Biol. Bioinform. 15 (1) (2018)
Martin Milanic, Irena Penev, Nicolas Trotignon
Stable Sets in {ISK4, wheel}-Free Graphs. Algorithmica 80 (2) (2018)
Claudia Archetti, Luca Bertazzi, Martin Milanic, David Schindl, Sacha Varone
Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014. Discret. Appl. Math. 234 (2018)
Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity. Theor. Comput. Sci. 705 (2018)
Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem. ACM Trans. Algorithms 14 (2) (2018)
Andreas Brandstädt, Vassilis Giakoumakis, Martin Milanic
Weighted efficient domination for some classes of H-free and of (H1, H2)-free graphs. Discret. Appl. Math. 250 (2018)
Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic
A three-person deterministic graphical game without Nash equilibria. Discret. Appl. Math. 243 (2018)
Liliana Alcón, Marisa Gutierrez, Martin Milanic
A characterization of claw-free CIS graphs and new results on the order of CIS graphs. CoRR (2018)
Endre Boros, Vladimir Gurvich, Martin Milanic
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. CoRR (2018)
Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
On Almost Well-Covered Graphs of Girth at Least 6. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma
Bipartite Graphs of Small Readability. COCOON (2018)
Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma
Bipartite Graphs of Small Readability. CoRR (2018)
Ademir Hujdurovic, Martin Milanic, Bernard Ries
Graphs vertex-partitionable into strong cliques. Discret. Math. 341 (5) (2018)
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic
New Algorithms for Weighted k-Domination and Total k-Domination Problems in Proper Interval Graphs. CoRR (2018)
Flavia Bonomo, Bostjan Bresar, Luciano N. Grippo, Martin Milanic, Martín Darío Safe
Domination parameters with number : Interrelations and algorithmic consequences. Discret. Appl. Math. 235 (2018)
Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic
Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs. ISCO (2018)
Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity. CoRR (2017)
Tatiana Romina Hartinger, Martin Milanic
Partial Characterizations of 1-Perfectly Orientable Graphs. J. Graph Theory 85 (2) (2017)
Martin Milanic, Peter Mursic, Marcelo Mydlarz
Induced Embeddings into Hamming Graphs. MFCS (2017)
Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs. Discret. Math. Theor. Comput. Sci. 19 (1) (2017)
Bostjan Bresar, Pinar Heggernes, Marcin Jakub Kaminski, Martin Milanic, Daniël Paulusma, Primoz Potocnik, Nicolas Trotignon
Preface: Algorithmic Graph Theory on the Adriatic Coast. Discret. Appl. Math. 231 (2017)
Tatiana Romina Hartinger, Martin Milanic
1-perfectly orientable graphs and graph products. Discret. Math. 340 (7) (2017)
Stefan Kratsch, Martin Milanic
On the complexity of the identifiable subgraph problem, revisited. Discret. Appl. Math. 226 (2017)
Endre Boros, Vladimir Gurvich, Martin Milanic
On equistable, split, CIS, and related classes of graphs. Discret. Appl. Math. 216 (2017)
Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
Minimal dominating sets in lexicographic product graphs. CoRR (2017)
Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
The minimum conflict-free row split problem revisited: a branching formulation and (in)approximability issues. CoRR (2017)

Martin Milanic.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Martin Milanic