Martin Milanic
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
42
Venues
17
Active years
2006–2026
Best venue rank
A*
Where they publish
Papers
42 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Tree-Independence Number of P₅-Free Graphs with No Large Bicliques. | Vclav Blazej, Jochen Pascal Gollin, Toms Hons, Toms Masark, Martin Milanic, Pawel Rzazewski, Ondrej Such, Alexandra Wesolek |
| 2026 | WG | Graph Classes Closed Under Self-Intersection. | Konrad K. Dabrowski, Vadim V. Lozin, Martin Milanic, Andrea Munaro, Danil Paulusma, Viktor Zamaraev |
| 2025 | LAGOS | On {k}-Roman graphs. | Kenny Storgel, Nina Chiarelli, Lara Fernndez, Jochen Pascal Gollin, Claire Hilaire, Valeria Leoni, Martin Milanic |
| 2025 | WG | Excluding an Induced Wheel Minor in Graphs Without Large Induced Stars. | Mujin Choi, Claire Hilaire, Martin Milanic, Sebastian Wiederrecht |
| 2024 | ESA | Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set. | Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel |
| 2024 | ICALP | Computing Tree Decompositions with Small Independence Number. | Clment Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic |
| 2024 | IWOCA | Detecting K | Clment Dallard, Mal Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon |
| 2023 | WG | Upper Clique Transversals in Graphs. | Martin Milanic, Yushi Uno |
| 2022 | ISAAC | On Constrained Intersection Representations of Graphs and Digraphs. | Ferdinando Cicalese, Clment Dallard, Martin Milanic |
| 2021 | IWOCA | Vertex Cover at Distance on H-Free Graphs. | Clment Dallard, Mirza Krbezlija, Martin Milanic |
| 2021 | LAGOS | Graphs with Two Moplexes. | Clment Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic |
| 2020 | IWOCA | Fair Packing of Independent Sets. | Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer |
| 2020 | WG | Edge Elimination and Weighted Graph Classes. | Jesse Beisegel, Nina Chiarelli, Ekkehard Khler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler |
| 2020 | WG | Strong Cliques in Diamond-Free Graphs. | Nina Chiarelli, Berenice Martnez-Barona, Martin Milanic, Jrme Monnot, Peter Mursic |
| 2020 | WG | Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure. | Clment Dallard, Martin Milanic, Kenny Storgel |
| 2019 | WADS | Avoidable Vertices and Edges in Graphs. | Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius |
| 2019 | WG | A Polynomial-Time Algorithm for the Independent Set Problem in P_10, C_4, C_6 -Free Graphs. | Edin Husic, Martin Milanic |
| 2019 | WG | Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs. | Martin Milanic, Nevena Pivac |
| 2018 | COCOON | Bipartite Graphs of Small Readability. | Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma |
| 2017 | MFCS | Induced Embeddings into Hamming Graphs. | Martin Milanic, Peter Mursic, Marcelo Mydlarz |
| 2017 | WG | The Minimum Conflict-Free Row Split Problem Revisited. | Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu |
| 2015 | CPM | On the Readability of Overlap Digraphs. | Rayan Chikhi, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova |
| 2015 | MFCS | The Price of Connectivity for Cycle Transversals. | Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Danil Paulusma |
| 2015 | WABI | Finding a Perfect Phylogeny from Mixed Tumor Samples. | Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu |
| 2015 | WG | Recognizing k-equistable Graphs in FPT Time. | Eun Jung Kim, Martin Milanic, Oliver Schaudt |
| 2014 | FUN | How to go Viral: Cheaply and Quickly. | Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro |
| 2014 | ISAIM | Linear Separation of Connected Dominating Sets in Graphs. | Nina Chiarelli, Martin Milanic |
| 2013 | CiE | Latency-Bounded Target Set Selection in Social Networks. | Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro |
| 2013 | IWOCA | Induced Subtrees in Interval Graphs. | Pinar Heggernes, Pim van 't Hof, Martin Milanic |
| 2013 | MFCS | New Polynomial Cases of the Weighted Efficient Domination Problem. | Andreas Brandstdt, Martin Milanic, Ragnar Nevries |
| 2013 | TAMC | Vector Connectivity in Graphs. | Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic |
| 2013 | WG | Linear Separation of Total Dominating Sets in Graphs. | Nina Chiarelli, Martin Milanic |
| 2012 | WG | On the Recognition of k-Equistable Graphs. | Vadim E. Levit, Martin Milanic, David Tankus |
| 2011 | FCT | Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. | Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro |
| 2010 | FUN | A Better Bouncer's Algorithm. | Ferdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanic, Eberhard Triesch |
| 2010 | IWOCA | Graphs of Separability at Most Two: Structural Characterizations and Their Consequences. | Ferdinando Cicalese, Martin Milanic |
| 2010 | IWOCA | Shortest Paths between Shortest Paths and Independent Sets. | Marcin Kaminski, Paul Medvedev, Martin Milanic |
| 2008 | ISAAC | Computing with Priced Information: When the Value Makes the Price. | Ferdinando Cicalese, Martin Milanic |
| 2008 | MFCS | The Maximum Independent Set Problem in Planar Graphs. | Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy S. Malyshev, Martin Milanic |
| 2007 | SODA | Maximum independent sets in graphs of low degree. | Vadim V. Lozin, Martin Milanic |
| 2007 | WG | Tree-Width and Optimization in Bounded Degree Graphs. | Vadim V. Lozin, Martin Milanic |
| 2006 | SODA | A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. | Vadim V. Lozin, Martin Milanic |