default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Milanic
Person information
- affiliation: University of Primorska, Koper, Slovenia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j92]Milad Ahanjideh, Martin Milanic, Mary Servatius:
On balanceable and simply balanceable regular graphs. Eur. J. Comb. 124: 104045 (2025)- [e1]Daniel Král
, Martin Milanic:
Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers. Lecture Notes in Computer Science 14760, Springer 2025, ISBN 978-3-031-75408-1 [contents] - 2024
- [j91]Clément Dallard, Martin Milanic, Kenny Storgel:
Treewidth versus clique number. II. Tree-independence number. J. Comb. Theory B 164: 404-442 (2024) - [j90]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) - [j89]Daniel Dadush, Martin Milanic, Tami Tamir:
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue. ACM Trans. Algorithms 20(3): 21 (2024) - [c45]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 - [c44]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 - [c43]Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon:
Detecting K2,3 as an Induced Minor. IWOCA 2024: 151-164 - [c42]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 - [i67]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) - [i66]Clément Dallard, Maël Dumas, Claire Hilaire, Martin Milanic, Anthony Perez, Nicolas Trotignon:
Detecting K2, 3 as an induced minor. CoRR abs/2402.08332 (2024) - [i65]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) - [i64]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) - [i63]Milad Ahanjideh, Martin Milanic, Mary Servatius:
On balanceable and simply balanceable regular graphs. CoRR abs/2403.05418 (2024) - [i62]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) - [i61]Endre Boros, Vladimir Gurvich, Martin Milanic, Dmitry Tikhanovsky, Yushi Uno:
On Minimal Transversals of Maximal Cliques in Graphs. CoRR abs/2405.10789 (2024) - [i60]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
- [j88]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) - [j87]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) - [j86]Martin Milanic, Nevena Pivac:
Computing well-covered vector spaces of graphs using modular decomposition. Comput. Appl. Math. 42(8): 360 (2023) - [j85]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) - [c41]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 - [c40]Martin Milanic, Yushi Uno:
Upper Clique Transversals in Graphs. WG 2023: 432-446 - [i59]Clément Dallard, Vadim V. Lozin, Martin Milanic, Kenny Storgel, Viktor Zamaraev:
Functionality of box intersection graphs. CoRR abs/2301.09493 (2023) - [i58]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) - [i57]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) - [i56]Endre Boros, Vladimir Gurvich, Martin Milanic, Yushi Uno:
Dually conformal hypergraphs. CoRR abs/2309.00098 (2023) - [i55]Martin Milanic, Yushi Uno:
Upper clique transversals in graphs. CoRR abs/2309.14103 (2023) - [i54]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) - [i53]Martin Milanic, Irena Penev, Nevena Pivac, Kristina Vuskovic:
Bisimplicial separators. CoRR abs/2312.10830 (2023) - 2022
- [j84]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) - [j83]Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi:
Shifting paths to avoidable ones. J. Graph Theory 100(1): 69-83 (2022) - [j82]Eun Jung Kim, Martin Milanic, Jérôme Monnot, Christophe Picouleau:
Complexity and algorithms for constant diameter augmentation problems. Theor. Comput. Sci. 904: 15-26 (2022) - [c39]Ferdinando Cicalese, Clément Dallard, Martin Milanic:
On Constrained Intersection Representations of Graphs and Digraphs. ISAAC 2022: 38:1-38:15 - [d3]Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi:
Computer-assisted verification of confining two-rooted graphs with certain cages. Zenodo, 2022
- [i52]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 abs/2202.04465 (2022) - [i51]Clément Dallard, Martin Milanic, Kenny Storgel:
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. CoRR abs/2206.15092 (2022) - [i50]Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic:
Computing Tree Decompositions with Small Independence Number. CoRR abs/2207.09993 (2022) - [i49]Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi:
Avoidability beyond paths. CoRR abs/2208.12803 (2022) - [i48]Martin Milanic, Pawel Rzazewski:
Tree decompositions with bounded independence number: beyond independent sets. CoRR abs/2209.12315 (2022) - [i47]Clément Dallard, Blas Fernández, Gyula Y. Katona, Martin Milanic, Kitti Varga:
Conditions for minimally tough graphs. CoRR abs/2210.00383 (2022) - [i46]Martin Milanic, Nevena Pivac:
Computing Well-Covered Vector Spaces of Graphs using Modular Decomposition. CoRR abs/2212.08599 (2022) - 2021
- [j81]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): 1 (2021) - [j80]Ratko Darda, Martin Milanic, Miguel A. Pizaña:
Searching for square-complementary graphs: Complexity of recognition and further nonexistence results. Discret. Math. 344(6): 112369 (2021) - [j79]Clément Dallard, Martin Milanic, Kenny Storgel:
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure. SIAM J. Discret. Math. 35(4): 2618-2646 (2021) - [j78]Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic:
Strong cliques in diamond-free graphs. Theor. Comput. Sci. 858: 49-63 (2021) - [c38]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: 243-257 - [c37]Clément Dallard, Mirza Krbezlija, Martin Milanic:
Vertex Cover at Distance on H-Free Graphs. IWOCA 2021: 237-251 - [c36]Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic:
Graphs with Two Moplexes. LAGOS 2021: 248-256 - [i45]Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic:
Graphs with at most two moplexes. CoRR abs/2106.10049 (2021) - [i44]Clément Dallard, Martin Milanic, Kenny Storgel:
Tree decompositions with bounded independence number and their algorithmic applications. CoRR abs/2111.04543 (2021) - 2020
- [j77]Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
Mind the independence gap. Discret. Math. 343(9): 111943 (2020) - [j76]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): 364-397 (2020) - [j75]Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma:
Bipartite graphs of small readability. Theor. Comput. Sci. 806: 402-415 (2020) - [c35]Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer:
Fair Packing of Independent Sets. IWOCA 2020: 154-165 - [c34]Clément Dallard, Martin Milanic, Kenny Storgel:
Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure. WG 2020: 92-105 - [c33]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: 134-147 - [c32]Nina Chiarelli, Berenice Martínez-Barona, Martin Milanic, Jérôme Monnot, Peter Mursic:
Strong Cliques in Diamond-Free Graphs. WG 2020: 261-273 - [d2]Vladimir Gurvich, Endre Boros, Martin Milanic, Jernej Vicic:
Non realizable degree sequences of dual graphs on surfaces. Version 1. Zenodo, 2020 [all versions] - [d1]Vladimir Gurvich, Endre Boros, Martin Milanic, Jernej Vicic:
Non realizable degree sequences of dual graphs on surfaces. Version 2. Zenodo, 2020 [all versions] - [i43]Nina Chiarelli, Matjaz Krnc, Martin Milanic, Ulrich Pferschy, Nevena Pivac, Joachim Schauer:
Fair packing of independent sets. CoRR abs/2003.11313 (2020) - [i42]Clément Dallard, Martin Milanic, Kenny Storgel:
Treewidth versus clique number in graph classes with a forbidden structure. CoRR abs/2006.06067 (2020) - [i41]Endre Boros, Vladimir Gurvich, Martin Milanic, Jernej Vicic:
On the degree sequences of dual graphs on surfaces. CoRR abs/2008.00573 (2020) - [i40]Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi:
Shifting paths to avoidable ones. CoRR abs/2008.01128 (2020)
2010 – 2019
- 2019
- [j74]Nina Chiarelli, Martin Milanic:
Linear separation of connected dominating sets in graphs. Ars Math. Contemp. 16(2): 487-525 (2019) - [j73]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): 769-777 (2019) - [j72]Endre Boros, Vladimir Gurvich, Martin Milanic:
Decomposing 1-Sperner Hypergraphs. Electron. J. Comb. 26(3): 3 (2019) - [j71]Ademir Hujdurovic, Martin Milanic, Bernard Ries:
Detecting strong cliques. Discret. Math. 342(9): 2738-2750 (2019) - [j70]Andreas Brandstädt, Martin Milanic:
A dichotomy for weighted efficient dominating sets with bounded degree vertices. Inf. Process. Lett. 142: 30-34 (2019) - [j69]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. Theor. Comput. Sci. 795: 128-141 (2019) - [c31]Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius:
Avoidable Vertices and Edges in Graphs. WADS 2019: 126-139 - [c30]Edin Husic, Martin Milanic:
A Polynomial-Time Algorithm for the Independent Set Problem in P_10, C_4, C_6 -Free Graphs. WG 2019: 271-284 - [c29]Martin Milanic, Nevena Pivac:
Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs. WG 2019: 379-391 - [c28]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: 15-27 - [i39]Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius:
Avoidable Vertices and Edges in Graphs. CoRR abs/1907.12078 (2019) - 2018
- [j68]Martin Milanic, Irena Penev, Nicolas Trotignon:
Stable Sets in {ISK4, wheel}-Free Graphs. Algorithmica 80(2): 415-447 (2018) - [j67]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: 1-2 (2018) - [j66]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: 23-50 (2018) - [j65]Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic:
A three-person deterministic graphical game without Nash equilibria. Discret. Appl. Math. 243: 21-38 (2018) - [j64]Bostjan Bresar, Tatiana Romina Hartinger, Tim Kos, Martin Milanic:
1-perfectly orientable K4-minor-free and outerplanar graphs. Discret. Appl. Math. 248: 33-45 (2018) - [j63]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: 130-144 (2018) - [j62]Ademir Hujdurovic, Martin Milanic, Bernard Ries:
Graphs vertex-partitionable into strong cliques. Discret. Math. 341(5): 1392-1405 (2018) - [j61]Bostjan Bresar, Tatiana Romina Hartinger, Tim Kos, Martin Milanic:
On total domination in the Cartesian product of graphs. Discuss. Math. Graph Theory 38(4): 963-976 (2018) - [j60]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) - [j59]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): 20:1-20:26 (2018) - [j58]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): 96-108 (2018) - [j57]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: 75-83 (2018) - [c27]Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma:
Bipartite Graphs of Small Readability. COCOON 2018: 467-479 - [c26]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: 290-302 - [i38]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 abs/1803.04327 (2018) - [i37]Endre Boros, Vladimir Gurvich, Martin Milanic:
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. CoRR abs/1805.03405 (2018) - [i36]Rayan Chikhi, Vladan Jovicic, Stefan Kratsch, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova, Nithin Varma:
Bipartite Graphs of Small Readability. CoRR abs/1805.04765 (2018) - [i35]Ratko Darda, Martin Milanic, Miguel A. Pizaña:
Searching for square-complementary graphs: non-existence results and complexity of recognition. CoRR abs/1808.01313 (2018) - [i34]Ademir Hujdurovic, Martin Milanic, Bernard Ries:
Detecting strong cliques. CoRR abs/1808.08817 (2018) - [i33]Liliana Alcón, Marisa Gutierrez, Martin Milanic:
A characterization of claw-free CIS graphs and new results on the order of CIS graphs. CoRR abs/1812.05314 (2018) - [i32]Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
Mind the Independence Gap. CoRR abs/1812.05316 (2018) - 2017
- [j56]Endre Boros, Vladimir Gurvich, Martin Milanic:
On equistable, split, CIS, and related classes of graphs. Discret. Appl. Math. 216: 47-66 (2017) - [j55]Stefan Kratsch, Martin Milanic:
On the complexity of the identifiable subgraph problem, revisited. Discret. Appl. Math. 226: 78-86 (2017) - [j54]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: 1-3 (2017) - [j53]Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom:
On two extensions of equimatchable graphs. Discret. Optim. 26: 112-130 (2017) - [j52]Tatiana Romina Hartinger, Martin Milanic:
1-perfectly orientable graphs and graph products. Discret. Math. 340(7): 1727-1737 (2017) - [j51]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) - [j50]Martin Milanic, Nicolas Trotignon:
Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs. J. Graph Theory 84(4): 536-551 (2017) - [j49]Tatiana Romina Hartinger, Martin Milanic:
Partial Characterizations of 1-Perfectly Orientable Graphs. J. Graph Theory 85(2): 378-394 (2017) - [c25]Martin Milanic, Peter Mursic, Marcelo Mydlarz:
Induced Embeddings into Hamming Graphs. MFCS 2017: 28:1-28:15 - [c24]Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
The Minimum Conflict-Free Row Split Problem Revisited. WG 2017: 303-315 - [i31]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 abs/1701.05492 (2017) - [i30]Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
Minimal dominating sets in lexicographic product graphs. CoRR abs/1701.05886 (2017) - [i29]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 abs/1706.08050 (2017) - [i28]Tínaz Ekim, Didem Gözüpek, Ademir Hujdurovic, Martin Milanic:
Almost Well-Covered Graphs Without Short Cycles. CoRR abs/1708.04632 (2017) - 2016
- [j48]Flavia Bonomo, Luciano N. Grippo, Martin Milanic, Martín Darío Safe:
Graph classes with and without powers of bounded clique-width. Discret. Appl. Math. 199: 3-15 (2016) - [j47]Liliana Alcón, Marisa Gutierrez, István Kovács, Martin Milanic, Romeo Rizzi:
Strong cliques and equistability of EPT graphs. Discret. Appl. Math. 203: 13-25 (2016) - [j46]Rayan Chikhi, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova:
On the readability of overlap digraphs. Discret. Appl. Math. 205: 35-44 (2016) - [j45]Endre Boros, Nina Chiarelli, Martin Milanic:
Equistarable bipartite graphs. Discret. Math. 339(7): 1960-1969 (2016) - [j44]Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma:
The price of connectivity for cycle transversals. Eur. J. Comb. 58: 203-224 (2016) - [j43]Bostjan Bresar, Tim Kos, Tatiana Romina Hartinger, Martin Milanic:
1-perfectly orientable K4-minor-free and outerplanar graphs. Electron. Notes Discret. Math. 54: 199-204 (2016) - [j42]Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom:
On Three Extensions of Equimatchable Graphs. Electron. Notes Discret. Math. 55: 177-180 (2016) - [i27]Stefan Kratsch, Martin Milanic:
On the complexity of the identifiable subgraph problem, revisited. CoRR abs/1603.06226 (2016) - [i26]Ademir Hujdurovic, Martin Milanic, Bernard Ries:
On graphs vertex-partitionable into strong cliques. CoRR abs/1609.06961 (2016) - [i25]Nina Chiarelli, Martin Milanic:
A threshold approach to connected domination. CoRR abs/1610.06539 (2016) - [i24]Endre Boros, Vladimir Gurvich, Martin Milanic, Vladimir Oudalov, Jernej Vicic:
A three-person chess-like game without Nash equilibria. CoRR abs/1610.07701 (2016) - 2015
- [j41]Marcin Jakub Kaminski, Martin Milanic:
On the complexity of the identifiable subgraph problem. Discret. Appl. Math. 182: 25-33 (2015) - [j40]Nina Chiarelli, Martin Milanic:
On a class of graphs between threshold and total domishold graphs. Discret. Appl. Math. 195: 43-58 (2015) - [j39]Edward Dobson, Ademir Hujdurovic, Martin Milanic, Gabriel Verret:
Vertex-transitive CIS graphs. Eur. J. Comb. 44: 87-98 (2015) - [j38]Andreas Brandstädt, Pavel Ficur, Arne Leitert, Martin Milanic:
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs. Inf. Process. Lett. 115(2): 256-262 (2015) - [j37]Marcin Anholcer, Sylwia Cichacz, Martin Milanic:
Group irregularity strength of connected graphs. J. Comb. Optim. 30(1): 1-17 (2015) - [j36]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro:
Spread of influence in weighted networks under time and budget constraints. Theor. Comput. Sci. 586: 40-58 (2015) - [j35]Ferdinando Cicalese, Martin Milanic, Romeo Rizzi:
On the complexity of the vector connectivity problem. Theor. Comput. Sci. 591: 60-71 (2015) - [c23]Rayan Chikhi, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova:
On the Readability of Overlap Digraphs. CPM 2015: 124-137 - [c22]Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma:
The Price of Connectivity for Cycle Transversals. MFCS (2) 2015: 395-406 - [c21]Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu:
Finding a Perfect Phylogeny from Mixed Tumor Samples. WABI 2015: 80-92 - [c20]Eun Jung Kim, Martin Milanic, Oliver Schaudt:
Recognizing k-equistable Graphs in FPT Time. WG 2015: 487-498 - [i23]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro:
Spread of Influence in Weighted Networks under Time and Budget Constraints. CoRR abs/1502.05599 (2015) - [i22]Endre Boros, Nina Chiarelli, Martin Milanic:
Equistarable bipartite graphs. CoRR abs/1502.06343 (2015) - [i21]Eun Jung Kim, Martin Milanic, Oliver Schaudt:
Recognizing k-equistable graphs in FPT time. CoRR abs/1503.01098 (2015) - [i20]Rayan Chikhi, Paul Medvedev, Martin Milanic, Sofya Raskhodnikova:
On the readability of overlap digraphs. CoRR abs/1504.04616 (2015) - [i19]Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu:
Finding a perfect phylogeny from mixed tumor samples. CoRR abs/1506.07675 (2015) - [i18]Endre Boros, Vladimir Gurvich, Martin Milanic:
1-Sperner hypergraphs. CoRR abs/1510.02438 (2015) - [i17]Tatiana Romina Hartinger, Martin Milanic:
1-perfectly orientable graphs and graph products. CoRR abs/1511.07314 (2015) - 2014
- [j34]Vadim E. Levit, Martin Milanic:
Equistable simplicial, very well-covered, and line graphs. Discret. Appl. Math. 165: 205-212 (2014) - [j33]Martin Milanic, Andrea Oversberg, Oliver Schaudt:
A characterization of line graphs that are squares of graphs. Discret. Appl. Math. 173: 83-91 (2014) - [j32]Martin Milanic, Alexandru I. Tomescu:
Set graphs. IV. Further connections with claw-freeness. Discret. Appl. Math. 174: 113-121 (2014) - [j31]Nina Chiarelli, Martin Milanic:
Total domishold graphs: A generalization of threshold graphs, with connections to threshold hypergraphs. Discret. Appl. Math. 179: 1-12 (2014) - [j30]Endre Boros, Vladimir Gurvich, Martin Milanic:
On CIS circulants. Discret. Math. 318: 78-95 (2014) - [j29]Martin Milanic, Anders Sune Pedersen, Daniel Pellicer, Gabriel Verret:
Graphs whose complement and square are isomorphic. Discret. Math. 327: 62-75 (2014) - [j28]Bostjan Bresar, Tanja Gologranc, Martin Milanic, Douglas F. Rall, Romeo Rizzi:
Dominating sequences in graphs. Discret. Math. 336: 22-36 (2014) - [j27]Vadim V. Lozin, Martin Milanic, Christopher Purcell:
Graphs Without Large Apples and the Maximum Weight Independent Set Problem. Graphs Comb. 30(2): 395-410 (2014) - [j26]Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic:
Vector connectivity in graphs. Networks 63(4): 277-285 (2014) - [j25]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro:
Latency-bounded target set selection in social networks. Theor. Comput. Sci. 535: 1-15 (2014) - [j24]Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
Set graphs. II. Complexity of set graph recognition and similar problems. Theor. Comput. Sci. 547: 70-81 (2014) - [c19]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro:
How to go Viral: Cheaply and Quickly. FUN 2014: 100-112 - [c18]Nina Chiarelli, Martin Milanic:
Linear Separation of Connected Dominating Sets in Graphs. ISAIM 2014 - [i16]Flavia Bonomo, Luciano N. Grippo, Martin Milanic, Martín Darío Safe:
Graphs of Power-Bounded Clique-Width. CoRR abs/1402.2135 (2014) - [i15]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Joseph G. Peters, Ugo Vaccaro:
How to go Viral: Cheaply and Quickly. CoRR abs/1404.3033 (2014) - [i14]Edward Dobson, Ademir Hujdurovic, Martin Milanic, Gabriel Verret:
Vertex-transitive CIS graphs. CoRR abs/1405.7874 (2014) - [i13]Martin Milanic, Nicolas Trotignon:
Equistarable graphs and counterexamples to three conjectures on equistable graphs. CoRR abs/1407.1670 (2014) - [i12]Andreas Brandstädt, Pavel Ficur, Arne Leitert, Martin Milanic:
Polynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs. CoRR abs/1410.0770 (2014) - [i11]Tatiana Romina Hartinger, Martin Milanic:
On the structure of 1-perfectly orientable graphs. CoRR abs/1411.6663 (2014) - [i10]Ferdinando Cicalese, Martin Milanic, Romeo Rizzi:
On the complexity of the vector connectivity problem. CoRR abs/1412.2559 (2014) - 2013
- [j23]Martin Milanic:
A note on domination and independence-domination numbers of graphs. Ars Math. Contemp. 6(1): 89-97 (2013) - [j22]Epameinondas Fritzilas, Martin Milanic, Jérôme Monnot, Yasmín Á. Ríos-Solís:
Resilience and optimization of identifiable bipartite graphs. Discret. Appl. Math. 161(4-5): 593-603 (2013) - [j21]Martin Milanic, Alexandru I. Tomescu:
Set graphs. I. Hereditarily finite sets and extensional acyclic orientations. Discret. Appl. Math. 161(4-5): 677-690 (2013) - [j20]Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro:
On the approximability and exact algorithms for vector domination and related problems in graphs. Discret. Appl. Math. 161(6): 750-767 (2013) - [j19]Martin Milanic, Oliver Schaudt:
Computing square roots of trivially perfect and threshold graphs. Discret. Appl. Math. 161(10-11): 1538-1545 (2013) - [j18]Vadim V. Lozin, Martin Milanic:
Critical properties of graphs of bounded clique-width. Discret. Math. 313(9): 1035-1044 (2013) - [j17]Martin Milanic:
Hereditary Efficiently Dominatable Graphs. J. Graph Theory 73(4): 400-424 (2013) - [c17]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro:
Latency-Bounded Target Set Selection in Social Networks. CiE 2013: 65-77 - [c16]Pinar Heggernes, Pim van 't Hof, Martin Milanic:
Induced Subtrees in Interval Graphs. IWOCA 2013: 230-243 - [c15]Andreas Brandstädt, Martin Milanic, Ragnar Nevries:
New Polynomial Cases of the Weighted Efficient Domination Problem. MFCS 2013: 195-206 - [c14]Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic:
Vector Connectivity in Graphs. TAMC 2013: 331-342 - [c13]Nina Chiarelli, Martin Milanic:
Linear Separation of Total Dominating Sets in Graphs. WG 2013: 165-176 - [i9]Endre Boros, Vladimir Gurvich, Martin Milanic:
On CIS Circulants. CoRR abs/1302.3498 (2013) - [i8]Nina Chiarelli, Martin Milanic:
Linear Separation of Total Dominating Sets in Graphs. CoRR abs/1303.0944 (2013) - [i7]Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro:
Latency-Bounded Target Set Selection in Social Networks. CoRR abs/1303.6785 (2013) - [i6]Andreas Brandstädt, Martin Milanic, Ragnar Nevries:
New Polynomial Cases of the Weighted Efficient Domination Problem. CoRR abs/1304.6255 (2013) - 2012
- [j16]Ferdinando Cicalese, Martin Milanic:
Graphs of separability at most 2. Discret. Appl. Math. 160(6): 685-696 (2012) - [j15]Marcin Kaminski, Paul Medvedev, Martin Milanic:
Complexity of independent set reconfigurability problems. Theor. Comput. Sci. 439: 9-15 (2012) - [c12]Vadim E. Levit, Martin Milanic, David Tankus:
On the Recognition of k-Equistable Graphs. WG 2012: 286-296 - [i5]Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
Set graphs. II. Complexity of set graph recognition and similar problems. CoRR abs/1207.7184 (2012) - 2011
- [j14]Ferdinando Cicalese, Martin Milanic:
Competitive evaluation of threshold functions in the priced information model. Ann. Oper. Res. 188(1): 111-132 (2011) - [j13]Martin Milanic, James B. Orlin, Gábor Rudolf:
Complexity results for equistable graphs and related classes. Ann. Oper. Res. 188(1): 359-370 (2011) - [j12]Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic:
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case. Discret. Appl. Math. 159(11): 1070-1078 (2011) - [j11]Stefko Miklavic, Martin Milanic:
Equistable graphs, general partition graphs, triangle graphs, and graph products. Discret. Appl. Math. 159(11): 1148-1159 (2011) - [j10]Marcin Kaminski, Paul Medvedev, Martin Milanic:
The plane-width of graphs. J. Graph Theory 68(3): 229-245 (2011) - [j9]Marcin Kaminski, Paul Medvedev, Martin Milanic:
Shortest paths between shortest paths. Theor. Comput. Sci. 412(39): 5205-5210 (2011) - [c11]Martin Milanic:
A hereditary view on efficient domination. CTW 2011: 203-206 - [c10]Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro:
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. FCT 2011: 288-297 - 2010
- [j8]Epameinondas Fritzilas, Martin Milanic, Sven Rahmann, Yasmín Á. Ríos-Solís:
Structural Identifiability in Low-Rank Matrix Factorization. Algorithmica 56(3): 313-332 (2010) - [j7]Vadim V. Lozin, Martin Milanic:
On the Maximum Independent Set Problem in Subclasses of Planar Graphs. J. Graph Algorithms Appl. 14(2): 269-286 (2010) - [c9]Ferdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanic, Eberhard Triesch:
A Better Bouncer's Algorithm. FUN 2010: 113-120 - [c8]Marcin Kaminski, Paul Medvedev, Martin Milanic:
Shortest Paths between Shortest Paths and Independent Sets. IWOCA 2010: 56-67 - [c7]Ferdinando Cicalese, Martin Milanic:
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences. IWOCA 2010: 291-302 - [i4]Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic:
Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case. CoRR abs/1006.4136 (2010) - [i3]Marcin Kaminski, Paul Medvedev, Martin Milanic:
Shortest paths between shortest paths and independent sets. CoRR abs/1008.4563 (2010) - [i2]Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro:
Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs. CoRR abs/1012.1529 (2010)
2000 – 2009
- 2009
- [j6]Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos:
Simple and Fast Reoptimizations for the Steiner Tree Problem. Algorithmic Oper. Res. 4(2): 86-94 (2009) - [j5]Marcin Kaminski, Vadim V. Lozin, Martin Milanic:
Recent developments on graphs of bounded clique-width. Discret. Appl. Math. 157(12): 2747-2761 (2009) - [j4]Marcin Kaminski, Paul Medvedev, Martin Milanic:
On the Plane-Width of Graphs. Electron. Notes Discret. Math. 34: 633-637 (2009) - [j3]Martin Milanic, Jérôme Monnot:
The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes. Electron. Notes Discret. Math. 35: 317-322 (2009) - 2008
- [j2]Vadim V. Lozin, Martin Milanic:
On finding augmenting graphs. Discret. Appl. Math. 156(13): 2517-2529 (2008) - [j1]Vadim V. Lozin, Martin Milanic:
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discrete Algorithms 6(4): 595-604 (2008) - [c6]Ferdinando Cicalese, Martin Milanic:
Computing with Priced Information: When the Value Makes the Price. ISAAC 2008: 378-389 - [c5]Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy S. Malyshev, Martin Milanic:
The Maximum Independent Set Problem in Planar Graphs. MFCS 2008: 96-107 - [i1]Marcin Kaminski, Paul Medvedev, Martin Milanic:
The Plane-Width of Graphs. CoRR abs/0812.4346 (2008) - 2007
- [c4]Vadim V. Lozin, Martin Milanic:
On the maximum independent set problem in subclasses of planar and more general graphs. CTW 2007: 107-110 - [c3]Vadim V. Lozin, Martin Milanic:
Maximum independent sets in graphs of low degree. SODA 2007: 874-880 - [c2]Vadim V. Lozin, Martin Milanic:
Tree-Width and Optimization in Bounded Degree Graphs. WG 2007: 45-54 - 2006
- [c1]Vadim V. Lozin, Martin Milanic:
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. SODA 2006: 26-30
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-30 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
