Martin Milanic

234 papers A* 3A 1B 22C 15Misc 4Journal 186Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Computing Tree Decompositions with Small Independence Number. ACM Trans. Algorithms Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
2026	J	`jnl`	Conformality of minimal transversals of maximal cliques. Discret. Math. Endre Boros, Vladimir Gurvich, Martin Milanic, Dmitry Tikhanovsky, Yushi Uno
2026	J	`jnl`	Induced minor models. I. Structural properties and algorithmic consequences. J. Comput. Syst. Sci. Nicolas Bousquet, Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon
2026	J	`jnl`	Linear colorings of graphs. Eur. J. Comb. Claire Hilaire, Matjaz Krnc, Martin Milanic, Jean-Florent Raymond
2026	J	`jnl`	Minimal toughness in subclasses of weakly chordal graphs. CoRR Jochen Pascal Gollin, Martin Milanic, Laura Ogrin
2026	J	`jnl`	Tree decompositions whose trees are subgraphs: An application of Simon's factorization. CoRR Romain Bourneuf, Gwenaël Joret, Piotr Micek, Martin Milanic, Michal Pilipczuk
2025	J	`jnl`	Avoidability Beyond Paths. Electron. J. Comb. Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
2025	J	`jnl`	Awesome graph parameters. CoRR Kenny Storgel, Clément Dallard, Vadim V. Lozin, Martin Milanic, Viktor Zamaraev
2025	J	`jnl`	Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem. J. Graph Theory Endre Boros, Vladimir Gurvich, Martin Milanic, Yushi Uno
2025	J	`jnl`	Dominated balanced separators in wheel-induced-minor-free graphs. CoRR Maria Chudnovsky, Jochen Pascal Gollin, Matjaz Krnc, Martin Milanic
2025	J	`jnl`	Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth. SIAM J. Discret. Math. Tara Abrishami, Marcin Brianski, Jadwiga Czyzewska, Rose McCarty, Martin Milanic, Pawel Rzazewski, Bartosz Walczak
2025	B	`conf`	Excluding an Induced Wheel Minor in Graphs Without Large Induced Stars. WG Mujin Choi, Claire Hilaire, Martin Milanic, Sebastian Wiederrecht
2025	J	`jnl`	Excluding an induced wheel minor in graphs without large induced stars. CoRR Mujin Choi, Claire Hilaire, Martin Milanic, Sebastian Wiederrecht
2025	J	`jnl`	Graph Classes Closed under Self-intersection. CoRR Konrad K. Dabrowski, Vadim V. Lozin, Martin Milanic, Andrea Munaro, Daniël Paulusma, Viktor Zamaraev
2025	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers WG Daniel Král, Martin Milanic
2025	J	`jnl`	Induced matching treewidth and tree-independence number, revisited. CoRR Noga Alon, Martin Milanic, Pawel Rzazewski
2025	J	`jnl`	Layered tree-independence number and clique-based separators. CoRR Clément Dallard, Martin Milanic, Andrea Munaro, Shizhou Yang
2025	J	`jnl`	Linear colorings of graphs. CoRR Claire Hilaire, Matjaz Krnc, Martin Milanic, Jean-Florent Raymond
2025	J	`jnl`	Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph. Discret. Optim. Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
2025	J	`jnl`	On balanceable and simply balanceable regular graphs. Eur. J. Comb. Milad Ahanjideh, Martin Milanic, Mary Servatius
2025	J	`jnl`	On constrained intersection representations of graphs and digraphs. CoRR Ferdinando Cicalese, Clément Dallard, Martin Milanic
2025	C	`conf`	On {k}-Roman graphs. LAGOS Kenny Storgel, Nina Chiarelli, Lara Fernández, Jochen Pascal Gollin, Claire Hilaire, Valeria Leoni, Martin Milanic
2025	J	`jnl`	Path Eccentricity and Forbidden Induced Subgraphs. CoRR Sylwia Cichacz, Claire Hilaire, Tomás Masarík, Jana Masaríková, Martin Milanic
2025	J	`jnl`	Perfect phylogenies via the Minimum Uncovering Branching Problem: Efficiently Solvable Cases. IEEE Trans. Comput. Biol. Bioinform. Narmina Baghirova, Esther Galby, Martin Milanic
2025	J	`jnl`	Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases. CoRR Narmina Baghirova, Esther Galby, Martin Milanic
2025	J	`jnl`	Sandwich Monotonicity and the Recognition of Weighted Graph Classes. CoRR Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler
2025	J	`jnl`	Tree independence number V. Walls and claws. CoRR Maria Chudnovsky, Julien Codsi, Daniel Lokshtanov, Martin Milanic, Varun Sivashankar
2025	J	`jnl`	Treewidth is NP-Complete on Cubic Graphs. Electron. J. Comb. Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2025	J	`jnl`	Young domination on Hamming rectangles. CoRR Janko Gravner, Matjaz Krnc, Martin Milanic, Jean-Florent Raymond
2024	J	`jnl`	A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor. CoRR Martin Milanic, Nevena Pivac
2024	J	`jnl`	Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. CoRR Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
2024	J	`jnl`	Bisimplicial separators. J. Graph Theory Martin Milanic, Irena Penev, Nevena Pivac, Kristina Vuskovic
2024	A*	`conf`	Computing Tree Decompositions with Small Independence Number. ICALP Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
2024	C	`conf`	Detecting K IWOCA Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon
2024	J	`jnl`	Detecting K CoRR Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon
2024	J	`jnl`	Graphs with at most two moplexes. J. Graph Theory Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
2024	J	`jnl`	Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue. ACM Trans. Algorithms Daniel Dadush, Martin Milanic, Tami Tamir
2024	J	`jnl`	On Minimal Transversals of Maximal Cliques in Graphs. CoRR Endre Boros, Vladimir Gurvich, Martin Milanic, Dmitry Tikhanovsky, Yushi Uno
2024	J	`jnl`	On balanceable and simply balanceable regular graphs. CoRR Milad Ahanjideh, Martin Milanic, Mary Servatius
2024	—	`conf`	The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. SWAT Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler
2024	J	`jnl`	The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. CoRR Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler
2024	A	`conf`	Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set. ESA Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel
2024	J	`jnl`	Tree decompositions meet induced matchings: beyond Max Weight Independent Set. CoRR Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel
2024	J	`jnl`	Treewidth versus clique number. II. Tree-independence number. J. Comb. Theory B Clément Dallard, Martin Milanic, Kenny Storgel
2024	J	`jnl`	Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. J. Comb. Theory B Clément Dallard, Martin Milanic, Kenny Storgel
2024	J	`jnl`	Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star. CoRR Clément Dallard, Matjaz Krnc, O-joung Kwon, Martin Milanic, Andrea Munaro, Kenny Storgel, Sebastian Wiederrecht
2023	J	`jnl`	Allocation of indivisible items with individual preference graphs. Discret. Appl. Math. Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
2023	J	`jnl`	Bisimplicial separators. CoRR Martin Milanic, Irena Penev, Nevena Pivac, Kristina Vuskovic
2023	J	`jnl`	Computing well-covered vector spaces of graphs using modular decomposition. Comput. Appl. Math. Martin Milanic, Nevena Pivac
2023	J	`jnl`	Dually conformal hypergraphs. CoRR Endre Boros, Vladimir Gurvich, Martin Milanic, Yushi Uno
2023	J	`jnl`	Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints. CoRR Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer
2023	J	`jnl`	Fair Allocation of Indivisible Items with Conflict Graphs. Algorithmica Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
2023	J	`jnl`	Fair allocation algorithms for indivisible items under structured conflict constraints. Comput. Appl. Math. Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Joachim Schauer
2023	J	`jnl`	Functionality of box intersection graphs. CoRR Clément Dallard, Vadim V. Lozin, Martin Milanic, Kenny Storgel, Viktor Zamaraev
2023	J	`jnl`	Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. CoRR Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy
2023	B	`conf`	Treewidth Is NP-Complete on Cubic Graphs. IPEC Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2023	J	`jnl`	Treewidth is NP-Complete on Cubic Graphs (and related results). CoRR Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2023	B	`conf`	Upper Clique Transversals in Graphs. WG Martin Milanic, Yushi Uno
2023	J	`jnl`	Upper clique transversals in graphs. CoRR Martin Milanic, Yushi Uno
2022	J	`jnl`	Allocation of Indivisible Items with Individual Preference Graphs. CoRR Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Ulrich Pferschy, Nevena Pivac
2022	J	`jnl`	Avoidability beyond paths. CoRR Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
2022	J	`jnl`	Avoidable vertices and edges in graphs: Existence, characterization, and applications. Discret. Appl. Math. Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius
2022	J	`jnl`	Complexity and algorithms for constant diameter augmentation problems. Theor. Comput. Sci. Eun Jung Kim, Martin Milanic, Jérôme Monnot, Christophe Picouleau
2022	J	`jnl`	Computing Tree Decompositions with Small Independence Number. CoRR Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
2022	J	`jnl`	Computing Well-Covered Vector Spaces of Graphs using Modular Decomposition. CoRR Martin Milanic, Nevena Pivac
2022	J	`jnl`	Conditions for minimally tough graphs. CoRR Clément Dallard, Blas Fernández, Gyula Y. Katona, Martin Milanic, Kitti Varga
2022	B	`conf`	On Constrained Intersection Representations of Graphs and Digraphs. ISAAC Ferdinando Cicalese, Clément Dallard, Martin Milanic
2022	J	`jnl`	Shifting paths to avoidable ones. J. Graph Theory Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
2022	J	`jnl`	Tree decompositions with bounded independence number: beyond independent sets. CoRR Martin Milanic, Pawel Rzazewski
2022	J	`jnl`	Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. CoRR Clément Dallard, Martin Milanic, Kenny Storgel
2021	—	`conf`	Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. ADT Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanic, Peter Mursic, Nevena Pivac, Ulrich Pferschy
2021	C	`conf`	Graphs with Two Moplexes. LAGOS Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
2021	J	`jnl`	Graphs with at most two moplexes. CoRR Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
2021	J	`jnl`	Polynomially Bounding the Number of Minimal Separators in Graphs: Reductions, Sufficient Conditions, and a Dichotomy Theorem. Electron. J. Comb. Martin Milanic, Nevena Pivac
2021	J	`jnl`	Searching for square-complementary graphs: Complexity of recognition and further nonexistence results. Discret. Math. Ratko Darda, Martin Milanic, Miguel A. Pizaña
2021	J	`jnl`	Strong cliques in diamond-free graphs. Theor. Comput. Sci. Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic
2021	J	`jnl`	Tree decompositions with bounded independence number and their algorithmic applications. CoRR Clément Dallard, Martin Milanic, Kenny Storgel
2021	J	`jnl`	Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure. SIAM J. Discret. Math. Clément Dallard, Martin Milanic, Kenny Storgel
2021	C	`conf`	Vertex Cover at Distance on H-Free Graphs. IWOCA Clément Dallard, Mirza Krbezlija, Martin Milanic
2020	J	`jnl`	Bipartite graphs of small readability. Theor. Comput. Sci. Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma
2020	J	`jnl`	Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. J. Graph Theory Endre Boros, Vladimir Gurvich, Martin Milanic
2020	B	`conf`	Edge Elimination and Weighted Graph Classes. WG Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler
2020	C	`conf`	Fair Packing of Independent Sets. IWOCA Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
2020	J	`jnl`	Fair packing of independent sets. CoRR Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer
2020	J	`jnl`	Mind the independence gap. Discret. Math. Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
2020	J	`jnl`	On the degree sequences of dual graphs on surfaces. CoRR Endre Boros, Vladimir Gurvich, Martin Milanic, Jernej Vicic
2020	J	`jnl`	Shifting paths to avoidable ones. CoRR Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi
2020	B	`conf`	Strong Cliques in Diamond-Free Graphs. WG Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic
2020	B	`conf`	Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure. WG Clément Dallard, Martin Milanic, Kenny Storgel
2020	J	`jnl`	Treewidth versus clique number in graph classes with a forbidden structure. CoRR Clément Dallard, Martin Milanic, Kenny Storgel
2019	C	`conf`	A Characterization of Claw-free CIS Graphs and New Results on the Order of CIS Graphs. LAGOS Liliana Alcón, Marisa Gutierrez, Martin Milanic
2019	B	`conf`	A Polynomial-Time Algorithm for the Independent Set Problem in P_10, C_4, C_6 -Free Graphs. WG Edin Husic, Martin Milanic
2019	J	`jnl`	A dichotomy for weighted efficient dominating sets with bounded degree vertices. Inf. Process. Lett. Andreas Brandstädt, Martin Milanic
2019	B	`conf`	Avoidable Vertices and Edges in Graphs. WADS Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius
2019	J	`jnl`	Avoidable Vertices and Edges in Graphs. CoRR Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius
2019	J	`jnl`	Decomposing 1-Sperner Hypergraphs. Electron. J. Comb. Endre Boros, Vladimir Gurvich, Martin Milanic
2019	J	`jnl`	Detecting strong cliques. Discret. Math. Ademir Hujdurovic, Martin Milanic, Bernard Ries
2019	J	`jnl`	Linear separation of connected dominating sets in graphs. Ars Math. Contemp. Nina Chiarelli, Martin Milanic
2019	J	`jnl`	MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP. Bioinform. Edin Husic, Xinyue Li, Ademir Hujdurovic, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanic, Alexandru I. Tomescu
2019	B	`conf`	Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs. WG Martin Milanic, Nevena Pivac
2019	J	`jnl`	New algorithms for weighted Theor. Comput. Sci. Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, María Inés Lopez Pujato, Martin Milanic
2018	J	`jnl`	1-perfectly orientable K4-minor-free and outerplanar graphs. Discret. Appl. Math. Bostjan Bresar, Tatiana Romina Hartinger, Tim Kos, Martin Milanic
2018	J	`jnl`	A characterization of claw-free CIS graphs and new results on the order of CIS graphs. CoRR Liliana Alcón, Marisa Gutierrez, Martin Milanic
2018	J	`jnl`	A three-person deterministic graphical game without Nash equilibria. Discret. Appl. Math. Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic
2018	Misc	`conf`	Bipartite Graphs of Small Readability. COCOON Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma
2018	J	`jnl`	Bipartite Graphs of Small Readability. CoRR Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma
2018	J	`jnl`	Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. CoRR Endre Boros, Vladimir Gurvich, Martin Milanic
2018	J	`jnl`	Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples. IEEE ACM Trans. Comput. Biol. Bioinform. Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu
2018	J	`jnl`	Detecting strong cliques. CoRR Ademir Hujdurovic, Martin Milanic, Bernard Ries
2018	J	`jnl`	Domination parameters with number : Interrelations and algorithmic consequences. Discret. Appl. Math. Flavia Bonomo, Bostjan Bresar, Luciano N. Grippo, Martin Milanic, Martín Darío Safe
2018	J	`jnl`	Graphs vertex-partitionable into strong cliques. Discret. Math. Ademir Hujdurovic, Martin Milanic, Bernard Ries
2018	C	`conf`	Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs. ISCO Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, María Inés Lopez Pujato, Martin Milanic
2018	J	`jnl`	Mind the Independence Gap. CoRR Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
2018	J	`jnl`	Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity. Theor. Comput. Sci. Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
2018	J	`jnl`	New Algorithms for Weighted k-Domination and Total k-Domination Problems in Proper Interval Graphs. CoRR Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, María Inés Lopez Pujato, Martin Milanic
2018	J	`jnl`	On Almost Well-Covered Graphs of Girth at Least 6. Discret. Math. Theor. Comput. Sci. Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
2018	J	`jnl`	On total domination in the Cartesian product of graphs. Discuss. Math. Graph Theory Bostjan Bresar, Tatiana Romina Hartinger, Tim Kos, Martin Milanic
2018	J	`jnl`	Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem. ACM Trans. Algorithms Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2018	J	`jnl`	Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014. Discret. Appl. Math. Claudia Archetti, Luca Bertazzi, Martin Milanic, David Schindl, Sacha Varone
2018	J	`jnl`	Searching for square-complementary graphs: non-existence results and complexity of recognition. CoRR Ratko Darda, Martin Milanic, Miguel A. Pizaña
2018	J	`jnl`	Stable Sets in {ISK4, wheel}-Free Graphs. Algorithmica Martin Milanic, Irena Penev, Nicolas Trotignon
2018	J	`jnl`	Weighted efficient domination for some classes of H-free and of (H1, H2)-free graphs. Discret. Appl. Math. Andreas Brandstädt, Vassilis Giakoumakis, Martin Milanic
2017	J	`jnl`	1-perfectly orientable graphs and graph products. Discret. Math. Tatiana Romina Hartinger, Martin Milanic
2017	J	`jnl`	Almost Well-Covered Graphs Without Short Cycles. CoRR Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
2017	J	`jnl`	Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs. Discret. Math. Theor. Comput. Sci. Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
2017	J	`jnl`	Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs. J. Graph Theory Martin Milanic, Nicolas Trotignon
2017	B	`conf`	Induced Embeddings into Hamming Graphs. MFCS Martin Milanic, Peter Mursic, Marcelo Mydlarz
2017	J	`jnl`	Minimal dominating sets in lexicographic product graphs. CoRR Didem Gözüpek, Ademir Hujdurovic, Martin Milanic
2017	J	`jnl`	Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity. CoRR Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
2017	J	`jnl`	On equistable, split, CIS, and related classes of graphs. Discret. Appl. Math. Endre Boros, Vladimir Gurvich, Martin Milanic
2017	J	`jnl`	On the complexity of the identifiable subgraph problem, revisited. Discret. Appl. Math. Stefan Kratsch, Martin Milanic
2017	J	`jnl`	On two extensions of equimatchable graphs. Discret. Optim. Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom
2017	J	`jnl`	Partial Characterizations of 1-Perfectly Orientable Graphs. J. Graph Theory Tatiana Romina Hartinger, Martin Milanic
2017	J	`jnl`	Preface: Algorithmic Graph Theory on the Adriatic Coast. Discret. Appl. Math. Bostjan Bresar, Pinar Heggernes, Marcin Jakub Kaminski, Martin Milanic, Daniël Paulusma, Primoz Potocnik, Nicolas Trotignon
2017	B	`conf`	The Minimum Conflict-Free Row Split Problem Revisited. WG Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2017	J	`jnl`	The minimum conflict-free row split problem revisited: a branching formulation and (in)approximability issues. CoRR Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2016	J	`jnl`	1-perfectly orientable K Electron. Notes Discret. Math. Bostjan Bresar, Tim Kos, Tatiana Romina Hartinger, Martin Milanic
2016	J	`jnl`	A three-person chess-like game without Nash equilibria. CoRR Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic
2016	J	`jnl`	A threshold approach to connected domination. CoRR Nina Chiarelli, Martin Milanic
2016	J	`jnl`	Equistarable bipartite graphs. Discret. Math. Endre Boros, Nina Chiarelli, Martin Milanic
2016	J	`jnl`	Graph classes with and without powers of bounded clique-width. Discret. Appl. Math. Flavia Bonomo, Luciano N. Grippo, Martin Milanic, Martín Darío Safe
2016	J	`jnl`	On Three Extensions of Equimatchable Graphs. Electron. Notes Discret. Math. Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom
2016	J	`jnl`	On graphs vertex-partitionable into strong cliques. CoRR Ademir Hujdurovic, Martin Milanic, Bernard Ries
2016	J	`jnl`	On the complexity of the identifiable subgraph problem, revisited. CoRR Stefan Kratsch, Martin Milanic
2016	J	`jnl`	On the readability of overlap digraphs. Discret. Appl. Math. Rayan Chikhi, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova
2016	J	`jnl`	Strong cliques and equistability of EPT graphs. Discret. Appl. Math. Liliana Alcón, Marisa Gutierrez, István Kovács, Martin Milanic, Romeo Rizzi
2016	J	`jnl`	The price of connectivity for cycle transversals. Eur. J. Comb. Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
2015	J	`jnl`	1-Sperner hypergraphs. CoRR Endre Boros, Vladimir Gurvich, Martin Milanic
2015	J	`jnl`	1-perfectly orientable graphs and graph products. CoRR Tatiana Romina Hartinger, Martin Milanic
2015	J	`jnl`	Equistarable bipartite graphs. CoRR Endre Boros, Nina Chiarelli, Martin Milanic
2015	C	`conf`	Finding a Perfect Phylogeny from Mixed Tumor Samples. WABI Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu
2015	J	`jnl`	Finding a perfect phylogeny from mixed tumor samples. CoRR Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu
2015	J	`jnl`	Group irregularity strength of connected graphs. J. Comb. Optim. Marcin Anholcer, Sylwia Cichacz, Martin Milanic
2015	J	`jnl`	On a class of graphs between threshold and total domishold graphs. Discret. Appl. Math. Nina Chiarelli, Martin Milanic
2015	B	`conf`	On the Readability of Overlap Digraphs. CPM Rayan Chikhi, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova
2015	J	`jnl`	On the complexity of the identifiable subgraph problem. Discret. Appl. Math. Marcin Jakub Kaminski, Martin Milanic
2015	J	`jnl`	On the complexity of the vector connectivity problem. Theor. Comput. Sci. Ferdinando Cicalese, Martin Milanic, Romeo Rizzi
2015	J	`jnl`	On the readability of overlap digraphs. CoRR Rayan Chikhi, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova
2015	J	`jnl`	Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs. Inf. Process. Lett. Andreas Brandstädt, Pavel Ficur, Arne Leitert, Martin Milanic
2015	B	`conf`	Recognizing k-equistable Graphs in FPT Time. WG Eun Jung Kim, Martin Milanic, Oliver Schaudt
2015	J	`jnl`	Recognizing k-equistable graphs in FPT time. CoRR Eun Jung Kim, Martin Milanic, Oliver Schaudt
2015	J	`jnl`	Spread of Influence in Weighted Networks under Time and Budget Constraints. CoRR Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro
2015	J	`jnl`	Spread of influence in weighted networks under time and budget constraints. Theor. Comput. Sci. Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro
2015	—	`conf`	The Price of Connectivity for Cycle Transversals. MFCS (2) Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
2015	J	`jnl`	Vertex-transitive CIS graphs. Eur. J. Comb. Edward Dobson, Ademir Hujdurovic, Martin Milanic, Gabriel Verret
2014	J	`jnl`	A characterization of line graphs that are squares of graphs. Discret. Appl. Math. Martin Milanic, Andrea Oversberg, Oliver Schaudt
2014	J	`jnl`	Dominating sequences in graphs. Discret. Math. Bostjan Bresar, Tanja Gologranc, Martin Milanic, Douglas F. Rall, Romeo Rizzi
2014	J	`jnl`	Equistable simplicial, very well-covered, and line graphs. Discret. Appl. Math. Vadim E. Levit, Martin Milanic
2014	J	`jnl`	Equistarable graphs and counterexamples to three conjectures on equistable graphs. CoRR Martin Milanic, Nicolas Trotignon
2014	J	`jnl`	Graphs Without Large Apples and the Maximum Weight Independent Set Problem. Graphs Comb. Vadim V. Lozin, Martin Milanic, Christopher Purcell
2014	J	`jnl`	Graphs of Power-Bounded Clique-Width. CoRR Flavia Bonomo, Luciano N. Grippo, Martin Milanic, Martín Darío Safe
2014	J	`jnl`	Graphs whose complement and square are isomorphic. Discret. Math. Martin Milanic, Anders Sune Pedersen, Daniel Pellicer, Gabriel Verret
2014	Misc	`conf`	How to go Viral: Cheaply and Quickly. FUN Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro
2014	J	`jnl`	How to go Viral: Cheaply and Quickly. CoRR Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro
2014	J	`jnl`	Latency-bounded target set selection in social networks. Theor. Comput. Sci. Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro
2014	Misc	`conf`	Linear Separation of Connected Dominating Sets in Graphs. ISAIM Nina Chiarelli, Martin Milanic
2014	J	`jnl`	On CIS circulants. Discret. Math. Endre Boros, Vladimir Gurvich, Martin Milanic
2014	J	`jnl`	On the complexity of the vector connectivity problem. CoRR Ferdinando Cicalese, Martin Milanic, Romeo Rizzi
2014	J	`jnl`	On the structure of 1-perfectly orientable graphs. CoRR Tatiana Romina Hartinger, Martin Milanic
2014	J	`jnl`	Polynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs. CoRR Andreas Brandstädt, Pavel Ficur, Arne Leitert, Martin Milanic
2014	J	`jnl`	Set graphs. II. Complexity of set graph recognition and similar problems. Theor. Comput. Sci. Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2014	J	`jnl`	Set graphs. IV. Further connections with claw-freeness. Discret. Appl. Math. Martin Milanic, Alexandru I. Tomescu
2014	J	`jnl`	Total domishold graphs: A generalization of threshold graphs, with connections to threshold hypergraphs. Discret. Appl. Math. Nina Chiarelli, Martin Milanic
2014	J	`jnl`	Vector connectivity in graphs. Networks Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic
2014	J	`jnl`	Vertex-transitive CIS graphs. CoRR Edward Dobson, Ademir Hujdurovic, Martin Milanic, Gabriel Verret
2013	J	`jnl`	A note on domination and independence-domination numbers of graphs. Ars Math. Contemp. Martin Milanic
2013	J	`jnl`	Computing square roots of trivially perfect and threshold graphs. Discret. Appl. Math. Martin Milanic, Oliver Schaudt
2013	J	`jnl`	Critical properties of graphs of bounded clique-width. Discret. Math. Vadim V. Lozin, Martin Milanic
2013	J	`jnl`	Hereditary Efficiently Dominatable Graphs. J. Graph Theory Martin Milanic
2013	C	`conf`	Induced Subtrees in Interval Graphs. IWOCA Pinar Heggernes, Pim van 't Hof, Martin Milanic
2013	J	`jnl`	Latency-Bounded Target Set Selection in Social Networks CoRR Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro
2013	C	`conf`	Latency-Bounded Target Set Selection in Social Networks. CiE Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro
2013	J	`jnl`	Linear Separation of Total Dominating Sets in Graphs CoRR Nina Chiarelli, Martin Milanic
2013	B	`conf`	Linear Separation of Total Dominating Sets in Graphs. WG Nina Chiarelli, Martin Milanic
2013	J	`jnl`	New Polynomial Cases of the Weighted Efficient Domination Problem CoRR Andreas Brandstädt, Martin Milanic, Ragnar Nevries
2013	B	`conf`	New Polynomial Cases of the Weighted Efficient Domination Problem. MFCS Andreas Brandstädt, Martin Milanic, Ragnar Nevries
2013	J	`jnl`	On CIS Circulants CoRR Endre Boros, Vladimir Gurvich, Martin Milanic
2013	J	`jnl`	On the approximability and exact algorithms for vector domination and related problems in graphs. Discret. Appl. Math. Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro
2013	J	`jnl`	Resilience and optimization of identifiable bipartite graphs. Discret. Appl. Math. Epameinondas Fritzilas, Martin Milanic, Jérôme Monnot, Yasmín Á. Ríos-Solís
2013	J	`jnl`	Set graphs. I. Hereditarily finite sets and extensional acyclic orientations. Discret. Appl. Math. Martin Milanic, Alexandru I. Tomescu
2013	C	`conf`	Vector Connectivity in Graphs. TAMC Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic
2012	J	`jnl`	Complexity of independent set reconfigurability problems. Theor. Comput. Sci. Marcin Kaminski, Paul Medvedev, Martin Milanic
2012	J	`jnl`	Graphs of separability at most 2. Discret. Appl. Math. Ferdinando Cicalese, Martin Milanic
2012	B	`conf`	On the Recognition of k-Equistable Graphs. WG Vadim E. Levit, Martin Milanic, David Tankus
2012	J	`jnl`	Set graphs. II. Complexity of set graph recognition and similar problems CoRR Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu
2011	C	`conf`	A hereditary view on efficient domination. CTW Martin Milanic
2011	J	`jnl`	Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case. Discret. Appl. Math. Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic
2011	J	`jnl`	Competitive evaluation of threshold functions in the priced information model. Ann. Oper. Res. Ferdinando Cicalese, Martin Milanic
2011	J	`jnl`	Complexity results for equistable graphs and related classes. Ann. Oper. Res. Martin Milanic, James B. Orlin, Gábor Rudolf
2011	J	`jnl`	Equistable graphs, general partition graphs, triangle graphs, and graph products. Discret. Appl. Math. Stefko Miklavic, Martin Milanic
2011	B	`conf`	Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. FCT Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro
2011	J	`jnl`	Shortest paths between shortest paths. Theor. Comput. Sci. Marcin Kaminski, Paul Medvedev, Martin Milanic
2011	J	`jnl`	The plane-width of graphs. J. Graph Theory Marcin Kaminski, Paul Medvedev, Martin Milanic
2010	Misc	`conf`	A Better Bouncer's Algorithm. FUN Ferdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanic, Eberhard Triesch
2010	J	`jnl`	Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case CoRR Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic
2010	C	`conf`	Graphs of Separability at Most Two: Structural Characterizations and Their Consequences. IWOCA Ferdinando Cicalese, Martin Milanic
2010	J	`jnl`	Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs CoRR Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro
2010	J	`jnl`	On the Maximum Independent Set Problem in Subclasses of Planar Graphs. J. Graph Algorithms Appl. Vadim V. Lozin, Martin Milanic
2010	C	`conf`	Shortest Paths between Shortest Paths and Independent Sets. IWOCA Marcin Kaminski, Paul Medvedev, Martin Milanic
2010	J	`jnl`	Shortest paths between shortest paths and independent sets CoRR Marcin Kaminski, Paul Medvedev, Martin Milanic
2010	J	`jnl`	Structural Identifiability in Low-Rank Matrix Factorization. Algorithmica Epameinondas Fritzilas, Martin Milanic, Sven Rahmann, Yasmín Á. Ríos-Solís
2009	J	`jnl`	On the Plane-Width of Graphs. Electron. Notes Discret. Math. Marcin Kaminski, Paul Medvedev, Martin Milanic
2009	J	`jnl`	Recent developments on graphs of bounded clique-width. Discret. Appl. Math. Marcin Kaminski, Vadim V. Lozin, Martin Milanic
2009	J	`jnl`	Simple and Fast Reoptimizations for the Steiner Tree Problem. Algorithmic Oper. Res. Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos
2009	J	`jnl`	The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes. Electron. Notes Discret. Math. Martin Milanic, Jérôme Monnot
2008	J	`jnl`	A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discrete Algorithms Vadim V. Lozin, Martin Milanic
2008	B	`conf`	Computing with Priced Information: When the Value Makes the Price. ISAAC Ferdinando Cicalese, Martin Milanic
2008	J	`jnl`	On finding augmenting graphs. Discret. Appl. Math. Vadim V. Lozin, Martin Milanic
2008	B	`conf`	The Maximum Independent Set Problem in Planar Graphs. MFCS Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy S. Malyshev, Martin Milanic
2008	J	`jnl`	The Plane-Width of Graphs CoRR Marcin Kaminski, Paul Medvedev, Martin Milanic
2007	A*	`conf`	Maximum independent sets in graphs of low degree. SODA Vadim V. Lozin, Martin Milanic
2007	C	`conf`	On the maximum independent set problem in subclasses of planar and more general graphs. CTW Vadim V. Lozin, Martin Milanic
2007	B	`conf`	Tree-Width and Optimization in Bounded Degree Graphs. WG Vadim V. Lozin, Martin Milanic
2006	A*	`conf`	A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. SODA Vadim V. Lozin, Martin Milanic