On the maximum independent set problem in subclasses of planar and more general graphs. - Vadim V. Lozin; Martin Milanic (CTW, 2007)

Maximum independent sets in graphs of low degree. - Vadim V. Lozin; Martin Milanic (SODA, 2007)

Tree-Width and Optimization in Bounded Degree Graphs. - Vadim V. Lozin; Martin Milanic (WG, 2007)

Computing with Priced Information: When the Value Makes the Price. - Ferdinando Cicalese; Martin Milanic (ISAAC, 2008)

The Maximum Independent Set Problem in Planar Graphs. - Vladimir E. Alekseev; Vadim V. Lozin; Dmitriy S. Malyshev; Martin Milanic (MFCS, 2008)

On finding augmenting graphs. - Vadim V. Lozin; Martin Milanic (Discret. Appl. Math., 2008)

A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. - Vadim V. Lozin; Martin Milanic (J. Discrete Algorithms, 2008)

Simple and Fast Reoptimizations for the Steiner Tree Problem. - Bruno Escoffier; Martin Milanic; Vangelis Th. Paschos (Algorithmic Oper. Res., 2009)

Recent developments on graphs of bounded clique-width. - Marcin Kaminski 001; Vadim V. Lozin; Martin Milanic (Discret. Appl. Math., 2009)

The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes. - Martin Milanic; Jérôme Monnot (Electron. Notes Discret. Math., 2009)

A Better Bouncer's Algorithm. - Ferdinando Cicalese; Travis Gagie; Anthony J. Macula; Martin Milanic; Eberhard Triesch (FUN, 2010)

Graphs of Separability at Most Two: Structural Characterizations and Their Consequences. - Ferdinando Cicalese; Martin Milanic (IWOCA, 2010)

Shortest Paths between Shortest Paths and Independent Sets. - Marcin Kaminski 001; Paul Medvedev; Martin Milanic (IWOCA, 2010)

Structural Identifiability in Low-Rank Matrix Factorization. - Epameinondas Fritzilas; Martin Milanic; Sven Rahmann; Yasmín Á. Ríos-Solís (Algorithmica, 2010)

On the Maximum Independent Set Problem in Subclasses of Planar Graphs. - Vadim V. Lozin; Martin Milanic (J. Graph Algorithms Appl., 2010)

A hereditary view on efficient domination. - Martin Milanic (CTW, 2011)

Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. - Ferdinando Cicalese; Martin Milanic; Ugo Vaccaro (FCT, 2011)

Competitive evaluation of threshold functions in the priced information model. - Ferdinando Cicalese; Martin Milanic (Ann. Oper. Res., 2011)

Complexity results for equistable graphs and related classes. - Martin Milanic; James B. Orlin; Gábor Rudolf (Ann. Oper. Res., 2011)

Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case. - Ferdinando Cicalese; Travis Gagie; Eduardo Sany Laber; Martin Milanic (Discret. Appl. Math., 2011)

Equistable graphs, general partition graphs, triangle graphs, and graph products. - Stefko Miklavic; Martin Milanic (Discret. Appl. Math., 2011)

The plane-width of graphs. - Marcin Kaminski 001; Paul Medvedev; Martin Milanic (J. Graph Theory, 2011)

Shortest paths between shortest paths. - Marcin Kaminski 001; Paul Medvedev; Martin Milanic (Theor. Comput. Sci., 2011)

On the Recognition of k-Equistable Graphs. - Vadim E. Levit; Martin Milanic; David Tankus (WG, 2012)

Graphs of separability at most 2. - Ferdinando Cicalese; Martin Milanic (Discret. Appl. Math., 2012)

Complexity of independent set reconfigurability problems. - Marcin Kaminski 001; Paul Medvedev; Martin Milanic (Theor. Comput. Sci., 2012)

Induced Subtrees in Interval Graphs. - Pinar Heggernes; Pim van 't Hof; Martin Milanic (IWOCA, 2013)

New Polynomial Cases of the Weighted Efficient Domination Problem. - Andreas Brandstädt; Martin Milanic; Ragnar Nevries (MFCS, 2013)

Linear Separation of Total Dominating Sets in Graphs. - Nina Chiarelli; Martin Milanic (WG, 2013)

A note on domination and independence-domination numbers of graphs. - Martin Milanic (Ars Math. Contemp., 2013)

On the approximability and exact algorithms for vector domination and related problems in graphs. - Ferdinando Cicalese; Martin Milanic; Ugo Vaccaro (Discret. Appl. Math., 2013)

Resilience and optimization of identifiable bipartite graphs. - Epameinondas Fritzilas; Martin Milanic; Jérôme Monnot; Yasmín Á. Ríos-Solís (Discret. Appl. Math., 2013)

Computing square roots of trivially perfect and threshold graphs. - Martin Milanic; Oliver Schaudt (Discret. Appl. Math., 2013)

Set graphs. I. Hereditarily finite sets and extensional acyclic orientations. - Martin Milanic; Alexandru I. Tomescu (Discret. Appl. Math., 2013)

Critical properties of graphs of bounded clique-width. - Vadim V. Lozin; Martin Milanic (Discret. Math., 2013)

Hereditary Efficiently Dominatable Graphs. - Martin Milanic (J. Graph Theory, 2013)

How to go Viral: Cheaply and Quickly. - Ferdinando Cicalese; Gennaro Cordasco; Luisa Gargano; Martin Milanic; Joseph G. Peters; Ugo Vaccaro (FUN, 2014)

Graphs of Power-Bounded Clique-Width. - Flavia Bonomo; Luciano N. Grippo; Martin Milanic; Martín Darío Safe (CoRR, 2014)

On the structure of 1-perfectly orientable graphs. - Tatiana Romina Hartinger; Martin Milanic (CoRR, 2014)

Total domishold graphs: A generalization of threshold graphs, with connections to threshold hypergraphs. - Nina Chiarelli; Martin Milanic (Discret. Appl. Math., 2014)

Equistable simplicial, very well-covered, and line graphs. - Vadim E. Levit; Martin Milanic (Discret. Appl. Math., 2014)

A characterization of line graphs that are squares of graphs. - Martin Milanic; Andrea Oversberg; Oliver Schaudt (Discret. Appl. Math., 2014)

Set graphs. IV. Further connections with claw-freeness. - Martin Milanic; Alexandru I. Tomescu (Discret. Appl. Math., 2014)

On CIS circulants. - Endre Boros; Vladimir Gurvich; Martin Milanic (Discret. Math., 2014)

Dominating sequences in graphs. - Bostjan Bresar; Tanja Gologranc; Martin Milanic; Douglas F. Rall; Romeo Rizzi (Discret. Math., 2014)

Graphs whose complement and square are isomorphic. - Martin Milanic; Anders Sune Pedersen; Daniel Pellicer; Gabriel Verret (Discret. Math., 2014)

Graphs Without Large Apples and the Maximum Weight Independent Set Problem. - Vadim V. Lozin; Martin Milanic; Christopher Purcell (Graphs Comb., 2014)

Vector connectivity in graphs. - Endre Boros; Pinar Heggernes; Pim van 't Hof; Martin Milanic (Networks, 2014)

Latency-bounded target set selection in social networks. - Ferdinando Cicalese; Gennaro Cordasco; Luisa Gargano; Martin Milanic; Ugo Vaccaro (Theor. Comput. Sci., 2014)

Set graphs. II. Complexity of set graph recognition and similar problems. - Martin Milanic; Romeo Rizzi; Alexandru I. Tomescu (Theor. Comput. Sci., 2014)

Finding a Perfect Phylogeny from Mixed Tumor Samples. - Ademir Hujdurovic; Ursa Kacar; Martin Milanic; Bernard Ries; Alexandru I. Tomescu (WABI, 2015)

Recognizing k-equistable Graphs in FPT Time. - Eun Jung Kim 002; Martin Milanic; Oliver Schaudt (WG, 2015)

1-Sperner hypergraphs. - Endre Boros; Vladimir Gurvich; Martin Milanic (CoRR, 2015)

On a class of graphs between threshold and total domishold graphs. - Nina Chiarelli; Martin Milanic (Discret. Appl. Math., 2015)

On the complexity of the identifiable subgraph problem. - Marcin Jakub Kaminski; Martin Milanic (Discret. Appl. Math., 2015)

Vertex-transitive CIS graphs. - Edward Dobson; Ademir Hujdurovic; Martin Milanic; Gabriel Verret (Eur. J. Comb., 2015)

Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs. - Andreas Brandstädt; Pavel Ficur; Arne Leitert; Martin Milanic (Inf. Process. Lett., 2015)

Group irregularity strength of connected graphs. - Marcin Anholcer; Sylwia Cichacz; Martin Milanic (J. Comb. Optim., 2015)

Spread of influence in weighted networks under time and budget constraints. - Ferdinando Cicalese; Gennaro Cordasco; Luisa Gargano; Martin Milanic; Joseph G. Peters; Ugo Vaccaro (Theor. Comput. Sci., 2015)

On the complexity of the vector connectivity problem. - Ferdinando Cicalese; Martin Milanic; Romeo Rizzi (Theor. Comput. Sci., 2015)

A three-person chess-like game without Nash equilibria. - Endre Boros; Vladimir Gurvich; Martin Milanic; Vladimir Oudalov; Jernej Vicic (CoRR, 2016)

A threshold approach to connected domination. - Nina Chiarelli; Martin Milanic (CoRR, 2016)

Strong cliques and equistability of EPT graphs. - Liliana Alcón; Marisa Gutierrez; István Kovács; Martin Milanic; Romeo Rizzi (Discret. Appl. Math., 2016)

Graph classes with and without powers of bounded clique-width. - Flavia Bonomo; Luciano N. Grippo; Martin Milanic; Martín Darío Safe (Discret. Appl. Math., 2016)

On the readability of overlap digraphs. - Rayan Chikhi; Paul Medvedev; Martin Milanic; Sofya Raskhodnikova (Discret. Appl. Math., 2016)

Equistarable bipartite graphs. - Endre Boros; Nina Chiarelli; Martin Milanic (Discret. Math., 2016)

The price of connectivity for cycle transversals. - Tatiana Romina Hartinger; Matthew Johnson 002; Martin Milanic; Daniël Paulusma (Eur. J. Comb., 2016)

1-perfectly orientable K4-minor-free and outerplanar graphs. - Bostjan Bresar; Tim Kos; Tatiana Romina Hartinger; Martin Milanic (Electron. Notes Discret. Math., 2016)

On Three Extensions of Equimatchable Graphs. - Zakir Deniz; Tínaz Ekim; Tatiana Romina Hartinger; Martin Milanic; Mordechai Shalom (Electron. Notes Discret. Math., 2016)

Induced Embeddings into Hamming Graphs. - Martin Milanic; Peter Mursic; Marcelo Mydlarz (MFCS, 2017)

The Minimum Conflict-Free Row Split Problem Revisited. - Ademir Hujdurovic; Edin Husic; Martin Milanic; Romeo Rizzi; Alexandru I. Tomescu (WG, 2017)

Minimal dominating sets in lexicographic product graphs. - Didem Gözüpek; Ademir Hujdurovic; Martin Milanic (CoRR, 2017)

The minimum conflict-free row split problem revisited: a branching formulation and (in)approximability issues. - Ademir Hujdurovic; Edin Husic; Martin Milanic; Romeo Rizzi; Alexandru I. Tomescu (CoRR, 2017)

Almost Well-Covered Graphs Without Short Cycles. - Tínaz Ekim; Didem Gözüpek; Ademir Hujdurovic; Martin Milanic (CoRR, 2017)

On equistable, split, CIS, and related classes of graphs. - Endre Boros; Vladimir Gurvich; Martin Milanic (Discret. Appl. Math., 2017)

Preface: Algorithmic Graph Theory on the Adriatic Coast. - Bostjan Bresar; Pinar Heggernes; Marcin Jakub Kaminski; Martin Milanic; Daniël Paulusma; Primoz Potocnik; Nicolas Trotignon (Discret. Appl. Math., 2017)

On the complexity of the identifiable subgraph problem, revisited. - Stefan Kratsch; Martin Milanic (Discret. Appl. Math., 2017)

On two extensions of equimatchable graphs. - Zakir Deniz; Tínaz Ekim; Tatiana Romina Hartinger; Martin Milanic; Mordechai Shalom (Discret. Optim., 2017)

1-perfectly orientable graphs and graph products. - Tatiana Romina Hartinger; Martin Milanic (Discret. Math., 2017)

Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs. - Didem Gözüpek; Ademir Hujdurovic; Martin Milanic (Discret. Math. Theor. Comput. Sci., 2017)

Partial Characterizations of 1-Perfectly Orientable Graphs. - Tatiana Romina Hartinger; Martin Milanic (J. Graph Theory, 2017)

Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs. - Martin Milanic; Nicolas Trotignon (J. Graph Theory, 2017)

Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs. - Nina Chiarelli; Tatiana Romina Hartinger; Valeria Alejandra Leoni; María Inés Lopez Pujato; Martin Milanic (ISCO, 2018)

Stable Sets in {ISK4, wheel}-Free Graphs. - Martin Milanic; Irena Penev; Nicolas Trotignon (Algorithmica, 2018)

New Algorithms for Weighted k-Domination and Total k-Domination Problems in Proper Interval Graphs. - Nina Chiarelli; Tatiana Romina Hartinger; Valeria Alejandra Leoni; María Inés Lopez Pujato; Martin Milanic (CoRR, 2018)

Searching for square-complementary graphs: non-existence results and complexity of recognition. - Ratko Darda; Martin Milanic; Miguel A. Pizaña (CoRR, 2018)

Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014. - Claudia Archetti; Luca Bertazzi; Martin Milanic; David Schindl; Sacha Varone (Discret. Appl. Math., 2018)

Domination parameters with number : Interrelations and algorithmic consequences. - Flavia Bonomo; Bostjan Bresar; Luciano N. Grippo; Martin Milanic; Martín Darío Safe (Discret. Appl. Math., 2018)

A three-person deterministic graphical game without Nash equilibria. - Endre Boros; Vladimir Gurvich; Martin Milanic; Vladimir Oudalov; Jernej Vicic (Discret. Appl. Math., 2018)

Weighted efficient domination for some classes of H-free and of (H1, H2)-free graphs. - Andreas Brandstädt; Vassilis Giakoumakis; Martin Milanic (Discret. Appl. Math., 2018)

1-perfectly orientable K4-minor-free and outerplanar graphs. - Bostjan Bresar; Tatiana Romina Hartinger; Tim Kos; Martin Milanic (Discret. Appl. Math., 2018)

Graphs vertex-partitionable into strong cliques. - Ademir Hujdurovic; Martin Milanic; Bernard Ries (Discret. Math., 2018)

On total domination in the Cartesian product of graphs. - Bostjan Bresar; Tatiana Romina Hartinger; Tim Kos; Martin Milanic (Discuss. Math. Graph Theory, 2018)

On Almost Well-Covered Graphs of Girth at Least 6. - Tínaz Ekim; Didem Gözüpek; Ademir Hujdurovic; Martin Milanic (Discret. Math. Theor. Comput. Sci., 2018)

Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem. - Ademir Hujdurovic; Edin Husic; Martin Milanic; Romeo Rizzi; Alexandru I. Tomescu (ACM Trans. Algorithms, 2018)

Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples. - Ademir Hujdurovic; Ursa Kacar; Martin Milanic; Bernard Ries; Alexandru I. Tomescu (IEEE ACM Trans. Comput. Biol. Bioinform., 2018)

Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity. - Nina Chiarelli; Tatiana Romina Hartinger; Matthew Johnson 002; Martin Milanic; Daniël Paulusma (Theor. Comput. Sci., 2018)

Avoidable Vertices and Edges in Graphs. - Jesse Beisegel; Maria Chudnovsky; Vladimir Gurvich; Martin Milanic; Mary Servatius (WADS, 2019)

A Polynomial-Time Algorithm for the Independent Set Problem in P_10, C_4, C_6 -Free Graphs. - Edin Husic; Martin Milanic (WG, 2019)

Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs. - Martin Milanic; Nevena Pivac (WG, 2019)

Linear separation of connected dominating sets in graphs. - Nina Chiarelli; Martin Milanic (Ars Math. Contemp., 2019)

MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP. - Edin Husic; Xinyue Li; Ademir Hujdurovic; Miika Mehine; Romeo Rizzi; Veli Mäkinen; Martin Milanic; Alexandru I. Tomescu (Bioinform., 2019)

Decomposing 1-Sperner Hypergraphs. - Endre Boros; Vladimir Gurvich; Martin Milanic (Electron. J. Comb., 2019)

Detecting strong cliques. - Ademir Hujdurovic; Martin Milanic; Bernard Ries (Discret. Math., 2019)

A Characterization of Claw-free CIS Graphs and New Results on the Order of CIS Graphs. - Liliana Alcón; Marisa Gutierrez; Martin Milanic (LAGOS, 2019)

A dichotomy for weighted efficient dominating sets with bounded degree vertices. - Andreas Brandstädt; Martin Milanic (Inf. Process. Lett., 2019)

New algorithms for weighted k-domination and total k-domination problems in proper interval graphs. - Nina Chiarelli; Tatiana Romina Hartinger; Valeria Alejandra Leoni; María Inés Lopez Pujato; Martin Milanic (Theor. Comput. Sci., 2019)

Fair Packing of Independent Sets. - Nina Chiarelli; Matjaz Krnc; Martin Milanic; Ulrich Pferschy; Nevena Pivac; Joachim Schauer (IWOCA, 2020)

Edge Elimination and Weighted Graph Classes. - Jesse Beisegel; Nina Chiarelli; Ekkehard Köhler; Matjaz Krnc; Martin Milanic; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (WG, 2020)

Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure. - Clément Dallard; Martin Milanic; Kenny Storgel (WG, 2020)

On the degree sequences of dual graphs on surfaces. - Endre Boros; Vladimir Gurvich; Martin Milanic; Jernej Vicic (CoRR, 2020)

Mind the independence gap. - Tínaz Ekim; Didem Gözüpek; Ademir Hujdurovic; Martin Milanic (Discret. Math., 2020)

Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. - Endre Boros; Vladimir Gurvich; Martin Milanic (J. Graph Theory, 2020)

Bipartite graphs of small readability. - Rayan Chikhi; Vladan Jovicic; Stefan Kratsch; Paul Medvedev; Martin Milanic; Sofya Raskhodnikova; Nithin Varma 001 (Theor. Comput. Sci., 2020)

Non realizable degree sequences of dual graphs on surfaces. - Vladimir Gurvich; Endre Boros; Martin Milanic; Jernej Vicic (Zenodo, 2020)

Non realizable degree sequences of dual graphs on surfaces. - Vladimir Gurvich; Endre Boros; Martin Milanic; Jernej Vicic (Zenodo, 2020)

Allocating Indivisible Items with Minimum Dissatisfaction on Preference Graphs. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Nevena Pivac; Ulrich Pferschy (ADT, 2021)

Vertex Cover at Distance on H-Free Graphs. - Clément Dallard; Mirza Krbezlija; Martin Milanic (IWOCA, 2021)

Graphs with Two Moplexes. - Clément Dallard; Robert Ganian; Meike Hatzel; Matjaz Krnc; Martin Milanic (LAGOS, 2021)

Polynomially Bounding the Number of Minimal Separators in Graphs: Reductions, Sufficient Conditions, and a Dichotomy Theorem. - Martin Milanic; Nevena Pivac (Electron. J. Comb., 2021)

Tree decompositions with bounded independence number and their algorithmic applications. - Clément Dallard; Martin Milanic; Kenny Storgel (CoRR, 2021)

Searching for square-complementary graphs: Complexity of recognition and further nonexistence results. - Ratko Darda; Martin Milanic; Miguel A. Pizaña (Discret. Math., 2021)

Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure. - Clément Dallard; Martin Milanic; Kenny Storgel (SIAM J. Discret. Math., 2021)

Strong cliques in diamond-free graphs. - Nina Chiarelli; Berenice Martínez-Barona; Martin Milanic; Jérôme Monnot; Peter Mursic (Theor. Comput. Sci., 2021)

On Constrained Intersection Representations of Graphs and Digraphs. - Ferdinando Cicalese; Clément Dallard; Martin Milanic (ISAAC, 2022)

Tree decompositions with bounded independence number: beyond independent sets. - Martin Milanic; Pawel Rzazewski (CoRR, 2022)

Conditions for minimally tough graphs. - Clément Dallard; Blas Fernández; Gyula Y. Katona; Martin Milanic; Kitti Varga (CoRR, 2022)

Avoidable vertices and edges in graphs: Existence, characterization, and applications. - Jesse Beisegel; Maria Chudnovsky; Vladimir Gurvich; Martin Milanic; Mary Servatius (Discret. Appl. Math., 2022)

Shifting paths to avoidable ones. - Vladimir Gurvich; Matjaz Krnc; Martin Milanic; Mikhail N. Vyalyi (J. Graph Theory, 2022)

Complexity and algorithms for constant diameter augmentation problems. - Eun Jung Kim 002; Martin Milanic; Jérôme Monnot; Christophe Picouleau (Theor. Comput. Sci., 2022)

Computer-assisted verification of confining two-rooted graphs with certain cages. - Vladimir Gurvich; Matjaz Krnc; Martin Milanic; Mikhail N. Vyalyi (Zenodo, 2022)

Treewidth Is NP-Complete on Cubic Graphs. - Hans L. Bodlaender; Édouard Bonnet; Lars Jaffke; Dusan Knop; Paloma T. Lima; Martin Milanic; Sebastian Ordyniak; Sukanya Pandey; Ondrej Suchý 001 (IPEC, 2023)

Upper Clique Transversals in Graphs. - Martin Milanic; Yushi Uno (WG, 2023)

Functionality of box intersection graphs. - Clément Dallard; Vadim V. Lozin; Martin Milanic; Kenny Storgel; Viktor Zamaraev (CoRR, 2023)

Treewidth is NP-Complete on Cubic Graphs (and related results). - Hans L. Bodlaender; Édouard Bonnet; Lars Jaffke; Dusan Knop; Paloma T. Lima; Martin Milanic; Sebastian Ordyniak; Sukanya Pandey; Ondrej Suchý 001 (CoRR, 2023)

Dually conformal hypergraphs. - Endre Boros; Vladimir Gurvich; Martin Milanic; Yushi Uno (CoRR, 2023)

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy (CoRR, 2023)

Fair Allocation of Indivisible Items with Conflict Graphs. - Nina Chiarelli; Matjaz Krnc; Martin Milanic; Ulrich Pferschy; Nevena Pivac; Joachim Schauer (Algorithmica, 2023)

Allocation of indivisible items with individual preference graphs. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy; Nevena Pivac (Discret. Appl. Math., 2023)

Fair allocation algorithms for indivisible items under structured conflict constraints. - Nina Chiarelli; Matjaz Krnc; Martin Milanic; Ulrich Pferschy; Joachim Schauer (Comput. Appl. Math., 2023)

Computing well-covered vector spaces of graphs using modular decomposition. - Martin Milanic; Nevena Pivac (Comput. Appl. Math., 2023)

Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set. - Paloma T. Lima; Martin Milanic; Peter Mursic; Karolina Okrasa; Pawel Rzazewski; Kenny Storgel (ESA, 2024)

Computing Tree Decompositions with Small Independence Number. - Clément Dallard; Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; Martin Milanic (ICALP, 2024)

Detecting K2,3 as an Induced Minor. - Clément Dallard; Maël Dumas; Claire Hilaire; Martin Milanic; Anthony Perez 001; Nicolas Trotignon (IWOCA, 2024)

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. - Jesse Beisegel; Nina Chiarelli; Ekkehard Köhler; Martin Milanic; Peter Mursic; Robert Scheffler 001 (SWAT, 2024)

Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction. - Nina Chiarelli; Clément Dallard; Andreas Darmann; Stefan Lendl; Martin Milanic; Peter Mursic; Ulrich Pferschy (CoRR, 2024)

Detecting K2, 3 as an induced minor. - Clément Dallard; Maël Dumas; Claire Hilaire; Martin Milanic; Anthony Perez 001; Nicolas Trotignon (CoRR, 2024)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star. - Clément Dallard; Matjaz Krnc; O-joung Kwon; Martin Milanic; Andrea Munaro; Kenny Storgel; Sebastian Wiederrecht (CoRR, 2024)

On Minimal Transversals of Maximal Cliques in Graphs. - Endre Boros; Vladimir Gurvich; Martin Milanic; Dmitry Tikhanovsky; Yushi Uno (CoRR, 2024)

A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor. - Martin Milanic; Nevena Pivac (CoRR, 2024)

Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. - Clément Dallard; Martin Milanic; Kenny Storgel (J. Comb. Theory B, 2024)

Graphs with at most two moplexes. - Clément Dallard; Robert Ganian; Meike Hatzel; Matjaz Krnc; Martin Milanic (J. Graph Theory, 2024)

Bisimplicial separators. - Martin Milanic; Irena Penev; Nevena Pivac; Kristina Vuskovic (J. Graph Theory, 2024)

Treewidth versus clique number. II. Tree-independence number. - Clément Dallard; Martin Milanic; Kenny Storgel (J. Comb. Theory B, 2024)

Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue. - Daniel Dadush; Martin Milanic; Tami Tamir (ACM Trans. Algorithms, 2024)

Avoidability Beyond Paths. - Vladimir Gurvich; Matjaz Krnc; Martin Milanic; Mikhail N. Vyalyi (Electron. J. Comb., 2025)

On balanceable and simply balanceable regular graphs. - Milad Ahanjideh; Martin Milanic; Mary Servatius (Eur. J. Comb., 2025)

Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth. - Tara Abrishami; Marcin Brianski; Jadwiga Czyzewska; Rose McCarty; Martin Milanic; Pawel Rzazewski; Bartosz Walczak (SIAM J. Discret. Math., 2025)

Young domination on Hamming rectangles. - Janko Gravner; Matjaz Krnc; Martin Milanic; Jean-Florent Raymond (CoRR, 2025)

Tree independence number V. Walls and claws. - Maria Chudnovsky; Julien Codsi; Daniel Lokshtanov; Martin Milanic; Varun Sivashankar (CoRR, 2025)

Path Eccentricity and Forbidden Induced Subgraphs. - Sylwia Cichacz; Claire Hilaire; Tomás Masarík; Jana Masaríková; Martin Milanic (CoRR, 2025)

Linear colorings of graphs. - Claire Hilaire; Matjaz Krnc; Martin Milanic; Jean-Florent Raymond (CoRR, 2025)

Excluding an induced wheel minor in graphs without large induced stars. - Mujin Choi; Claire Hilaire; Martin Milanic; Sebastian Wiederrecht (CoRR, 2025)

Layered tree-independence number and clique-based separators. - Clément Dallard; Martin Milanic; Andrea Munaro; Shizhou Yang (CoRR, 2025)

Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases. - Narmina Baghirova; Esther Galby; Martin Milanic (CoRR, 2025)

Sandwich Monotonicity and the Recognition of Weighted Graph Classes. - Jesse Beisegel; Nina Chiarelli; Ekkehard Köhler; Matjaz Krnc; Martin Milanic; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (CoRR, 2025)

Conformality of minimal transversals of maximal cliques. - Endre Boros; Vladimir Gurvich; Martin Milanic; Dmitry Tikhanovsky; Yushi Uno (Discret. Math., 2026)