Coauthors

Liliana Alcón, Vladimir Alekseev, Marcin Anholcer, Flavia Bonomo, Endre Boros, Andreas Brandstädt, Boštjan Brešar, Nina Chiarelli, Rayan Chikhi, Ferdinando Cicalese, Sylwia Cichacz, Gennaro Cordasco, Ildefonso Martinez De la Fuente, Zakir Deniz, Ted Dobson, Tınaz Ekim, Bruno Escoffier, Pavel Fičur, Epameinondas Fritzilas, Travis Gagie, Luisa Gargano, Tanja Gologranc, Luciano N. Grippo, Didem Gözüpek, Vladimir Gurvich, Marisa Gutierrez, Tatiana Romina Hartinger, Pinar Heggernes, Pim van 't Hof, Ademir Hujdurović, Edin Husić, Matthew Johnson, Urša Kačar, Marcin Kamiński, EunJung Kim, Tim Kos, István Kovács, Stefan Kratsch, Eduardo S. Laber, Leire Legarreta, Arne Leitert, Vadim E. Levit, Vadim V. Lozin, Anthony J. Macula, Iker Malaina, Dmitriy S. Malyshev, Luis Martínez, Paul Medvedev, Štefko Miklavič, Jérôme Monnot, Peter Muršič, Marcelo Mydlarz, Ragnar Nevries, Jim Orlin, Vladimir Oudalov, Andrea Oversberg, Vangelis Paschos, Daniel Paulusma, Anders Sune Pedersen, Daniel Pellicer, Irena Penev, Joseph G. Peters, Tomaž Pisanski, Christopher Purcell, Sven Rahmann, Doug Rall, Sofya Raskhodnikova, Yasmin A. Ríos Solís, Bernard Ries, Romeo Rizzi, Gábor Rudolf, Martin D. Safe, Oliver Schaudt, Mordechai Shalom, Dragan Stevanović, David Tankus, Alexandru I. Tomescu, Eberhard Triesch, Nicolas Trotignon, Gabriel Verret, Jernej Vičič, Arjana Žitnik.



Publications

Preprints
Journal publications
Refereed conference publications
Book chapter
Miscellaneous (research reports, manuscripts)



Preprints

  • T. Ekim, D. Gözüpek, A. Hujdurović, M. Milanič, Almost well-covered graphs without short cycles.

  • A. Hujdurović, E. Husić, M. Milanič, R. Rizzi, A. I. Tomescu, Reconstructing perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem

  • E. Boros, V. Gurvich, M. Milanič, V. Oudalov, J. Vičič. A three-person deterministic graphical game without Nash equilibria.

  • N. Chiarelli, M. Milanič. A threshold approach to connected domination.

  • A. Hujdurović, M. Milanič, B. Ries. Graphs vertex-partitionable into strong cliques.

  • E. Boros, V. Gurvich, M. Milanič. 1-Sperner hypergraphs.

  • Journal publications:
    1. N. Chiarelli, T. R. Hartinger, M. Johnson, M. Milanič, D. Paulusma. Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. Theoretical Computer Science 705 (2018) 75-83. preprint

    2. B. Brešar, T. R. Hartinger, T. Kos, M. Milanič. 1-perfectly orientable K4-minor-free and outerplanar graphs. Discrete Applied Mathematics, to appear. preprint

    3. F. Bonomo, B. Brešar, L. N. Grippo, M. Milanič, M. D. Safe. Domination parameters with number 2: interrelations and algorithmic consequences. Discrete Applied Mathematics, to appear. preprint

    4. Z. Deniz, T. Ekim, T. R. Hartinger, M. Milanič, M. Shalom, On two extensions of equimatchable graphs. Discrete Optimization 26 (2017) 112-130. preprint

    5. D. Gözüpek, A. Hujdurović, M. Milanič, Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs. Discrete Mathematics and Theoretical Computer Science 19, vol. 1 (2017).

    6. S. Kratsch, M. Milanič. On the complexity of the identifiable subgraph problem, revisited. Discrete Applied Mathematics 226 (2017) 78-86. preprint

    7. B. Brešar, T. R. Hartinger, T. Kos, M. Milanič. On total domination in the Cartesian product of graphs. Discussiones Mathematicae Graph Theory, accepted. preprint

    8. M. Milanič, I. Penev, N. Trotignon. Stable sets in {wheel, ISK4}-free graphs. Algorithmica, to appear. preprint supplement

    9. A. Hujdurović, U. Kačar, M. Milanič, B. Ries, A. I. Tomescu. Complexity and algorithms for finding a perfect phylogeny from mixed tumor samples, IEEE Transactions on Computational Biology and Bioinformatics, to appear. preprint.

    10. T. R. Hartinger, M. Milanič. Partial characterizations of 1-perfectly orientable graphs, Journal of Graph Theory 85 (2017) 378-394. preprint

    11. T. R. Hartinger, M. Milanič. 1-perfectly orientable graphs and graph products, Discrete Mathematics 340 (2017) 1727-1737. preprint.

    12. E. Boros, V. Gurvich, M. Milanič. On equistable, split, CIS, and related classes of graphs. Discrete Applied Mathematics 216P1 (2017) 47-66. preprint

    13. M. Milanič, N. Trotignon. Equistarable graphs and counterexamples to three conjectures on equistable graphs, Journal of Graph Theory 84 (2017) 536-551. preprint

    14. T. R. Hartinger, M. Johnson, M. Milanič, D. Paulusma. The price of connectivity for cycle transversals, European Journal of Combinatorics 58 (2016) 203-224.

    15. R. Chikhi, P. Medvedev, M. Milanič, S. Raskhodnikova. On the readability of overlap digraphs, Discrete Applied Mathematics 205 (2016) 35-44.

    16. L. Alcón, M. Gutierrez, I. Kovács, M. Milanič, R. Rizzi. Strong cliques and equistability of EPT graphs. Discrete Applied Mathematics 203 (2016) 13-25.

    17. E. Boros, N. Chiarelli, M. Milanič. Equistarable bipartite graphs. Discrete Mathematics 339 (2016) 1960-1969. preprint

    18. F. Bonomo, L. N. Grippo, M. Milanič, M. D. Safe. Graph classes with and without powers of bounded clique-width. Discrete Applied Mathematics 199 (2016) 3-15. preprint

    19. F. Cicalese, M. Milanič, R. Rizzi. On the complexity of the vector connectivity problem. Theoretical Computer Science 591 (2015) 60-71. preprint

    20. N. Chiarelli, M. Milanič. On a class of graphs between threshold and total domishold graphs, Discrete Applied Mathematics 195 (2015) 43-58.

    21. F. Cicalese, G. Cordasco, L. Gargano, M. Milanič, J.G. Peters, U. Vaccaro. Spread of influence in weighted networks under time and budget constraints, Theoretical Computer Science 586 (2015) 40-58.

    22. A. Brandstädt, P. Fičur, A. Leitert, M. Milanič. Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs, Information Processing Letters 115 (2015) 256-262. preprint

    23. T. Dobson, A. Hujdurović, M. Milanič, G. Verret. Vertex-transitive CIS graphs, European Journal of Combinatorics 44 (2015) 87-98.

    24. M. Kamiński, M. Milanič. On the complexity of the identifiable subgraph problem, Discrete Applied Mathematics 182 (2015) 25-33.

    25. L. Martínez, M. Milanič, L. Legarreta, P. Medvedev, I. Malaina, I. M. De la Fuente. A combinatorial approach to the design of vaccines, Journal of Mathematical Biology 70 (2015) 1327-1358.

    26. M. Anholcer, S. Cichacz, M. Milanič. Group irregularity strength of connected graphs, Journal of Combinatorial Optimization 30 (2015) 1-17.

    27. N. Chiarelli, M. Milanič. Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs, Discrete Applied Mathematics 179 (2014) 1-12.

    28. B. Brešar, T. Gologranc, M. Milanič, D. Rall, R. Rizzi. Dominating sequences in graphs, Discrete Mathematics 336 (2014) 22-36.

    29. E. Boros, P. Heggernes, P. van 't Hof, M. Milanič. Vector connectivity in graphs, Networks 63 (2014) 277-285.

    30. M. Milanič, A. I. Tomescu. Set graphs. IV. Further connections with claw-freeness, Discrete Applied Mathematics 174 (2014) 113-121.

    31. M. Milanič, R. Rizzi, A. I. Tomescu. Set graphs. II. Complexity of set graph recognition and similar problems, Theoretical Computer Science 547 (2014) 70-81.

    32. M. Milanič, O. Schaudt, A. Oversberg. A characterization of line graphs that are squares of graphs, Discrete Applied Mathematics 173 (2014) 83--91.

    33. M. Milanič, A. S. Pedersen, D. Pellicer, G. Verret. Graphs whose complement and square are isomorphic, Discrete Mathematics 327C (2014) 62-75. preprint (extended version)

    34. F. Cicalese, G. Cordasco, L. Gargano, M. Milanič, U. Vaccaro. Latency-bounded target set selection in social networks, Theoretical Computer Science 535 (2014) 1-15.

    35. E. Boros, V. Gurvich, M. Milanič. On CIS circulants, Discrete Mathematics 318 (2014) 78-95. preprint

    36. V. Lozin, M. Milanič, C. Purcell. Graphs without large apples and the maximum weight independent set problem, Graphs and Combinatorics 30 (2014) 395-410.

    37. V. E. Levit, M. Milanič. Equistable simplicial, very well-covered, and line graphs, Discrete Applied Mathematics 165 (2014) 205-212.

    38. M. Milanič, T. Pisanski, A. Žitnik. Dilation coefficient, plane-width, and resolution coefficient of graphs, Monatshefte für Mathematik 170 (2013) 179-193.

    39. M. Milanič. Hereditary efficiently dominatable graphs, Journal of Graph Theory 73 (2013) 400-424.

    40. V. V. Lozin, M. Milanič. Critical properties of graphs of bounded clique-width, Discrete Mathematics 313 (2013) 1035-1044.

    41. M. Milanič, O. Schaudt. Computing square roots of trivially perfect and threshold graphs, Discrete Applied Mathematics 161 (2013) 1538-1545.

    42. F. Cicalese, M. Milanič, U. Vaccaro. On the approximability and exact algorithms for vector domination and related problems in graphs, Discrete Applied Mathematics 161 (2013) 750-767.

    43. M. Milanič. A note on domination and independence-domination numbers in graphs, Ars Mathematica Contemporanea 6 (2013) 89-97.

    44. E. Fritzilas, M. Milanič, J. Monnot, Y. A. Ríos Solís. Resilience and optimization of identifiable bipartite graphs, Discrete Applied Mathematics 161 (2013) 593-603.

    45. M. Milanič, A. I. Tomescu. Set graphs. I. Hereditarily finite sets and extensional acyclic orientations, Discrete Applied Mathematics 161 (2013) 677-690.

    46. D. Stevanović, M. Milanič. Improved inequality between Zagreb indices of trees, MATCH Communications in Mathematical and in Computer Chemistry 168 (2012) 147-156.

    47. M. Kamiński, P. Medvedev, M. Milanič. Complexity of independent set reconfigurability problems, Theoretical Computer Science 439 (2012) 9-15.

    48. F. Cicalese, M. Milanič. Graphs of separability at most 2, Discrete Applied Mathematics 160 (2012) 685-696.

    49. M. Kamiński, P. Medvedev, M. Milanič. Shortest paths between shortest paths, Theoretical Computer Science 412 (2011) 5205-5210.

    50. Š. Miklavič, M. Milanič. Equistable graphs, general partition graphs, triangle graphs, and graph products, Discrete Applied Mathematics 159 (2011) 1148-1159.

    51. F. Cicalese, T. Gagie, E. S. Laber, M. Milanič. Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case, Discrete Applied Mathematics 159 (2011) 1070-1078.

    52. M. Milanič, J. Orlin, G. Rudolf. Complexity results for equistable graphs and related classes, Annals of Operations Research 188 (2011) 359-370.

    53. M. Kamiński, P. Medvedev, M. Milanič. The plane-width of graphs, Journal of Graph Theory 68 (2011) 229-245.

    54. F. Cicalese, M. Milanič. Competitive evaluation of threshold functions in the priced information model, Annals of Operations Research 188 (2011) 111-132.

    55. V. Lozin, M. Milanič. On the maximum independent set problem in subclasses of planar graphs, Journal of Graph Algorithms and Applications 14 (2010) 269-286.

    56. E. Fritzilas, M. Milanič, S. Rahmann, Y. A. Ríos Solís. Structural identifiability in low-rank matrix factorization, Algorithmica 56 (2010) 313-332.

    57. B. Escoffier, M. Milanič, V. Paschos. Simple and fast reoptimizations for the Steiner tree problem, Algorithmic Operations Research 4 (2009) 86-94.

    58. M. Kamiński, V. V. Lozin, M. Milanič. Recent developments on graphs of bounded clique-width, Discrete Applied Mathematics 157 (2009) 2747-2761.

    59. V. V. Lozin, M. Milanič. A polynomial algorithm to find an independent set of maximum weight in a fork-free graph, Journal of Discrete Algorithms 6 (2008) 595-604.

    60. V. V. Lozin, M. Milanič. On finding augmenting graphs, Discrete Applied Mathematics 156 (2008) 2517-2529.

    Refereed conference publications:
    1. M. Milanič, P. Muršič, M. Mydlarz. Induced embeddings into Hamming graphs, To appear in Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), Lecture Notes in Computer Science, Springer.

    2. A. Hujdurović, E. Husić, M. Milanič, R. Rizzi, A. I. Tomescu, The minimum conflict-free row split problem revisited, Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017), Lecture Notes in Computer Science 10520 (2017) 303-315. full version preprint

    3. Z. Deniz, T. Ekim, T. R. Hartinger, M. Milanič, M. Shalom, On three extensions of equimatchable graphs. 14th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW16), Electronic Notes in Discrete Mathematics 55 (2016) 177-180.

    4. B. Brešar, T. Kos, T. R. Hartinger, M. Milanič. 1-perfectly orientable K4-minor-free and outerplanar graphs. Discrete Mathematics Days - JMDA16, Electronic Notes in Discrete Mathematics 54 (2016) 199-204.

    5. E. Kim, M. Milanič, O. Schaudt. Recognizing k-equistable graphs in FPT time, Proceedings of the 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015), Lecture Notes in Computer Science 9224 (2016) 487-498.

    6. A. Hujdurović, U. Kačar, M. Milanič, B. Ries, A. I. Tomescu. Finding a perfect phylogeny from mixed tumor samples, Proceedings of the 15th International Workshop on Algorithms in Bioinformatics (WABI 2015), Lecture Notes in Computer Science 9289 (2015) 80-92. preprint (with all proofs)

    7. T. R. Hartinger, M. Johnson, M. Milanič, D. Paulusma. The price of connectivity for cycle transversals, Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS 2015), Lecture Notes in Computer Science 9235 (2015) 395-406.

    8. R. Chikhi, P. Medvedev, M. Milanič, S. Raskhodnikova. On the readability of overlap digraphs, Proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), Lecture Notes in Computer Science 9133 (2015) 124-137. preprint

    9. F. Cicalese, G. Cordasco, L. Gargano, M. Milanič, J.G. Peters, U. Vaccaro. How to go viral: cheaply and quickly, Proceedings of the 7th International Conference 'FUN with Algorithms' (FUN 2014), Lecture Notes in Computer Science 8496 (2014) 100-112.

    10. N. Chiarelli, M. Milanič. Linear separation of connected dominating sets in graphs, International Symposium on Artificial Intelligence and Mathematics (ISAIM 2014), Fort Lauderdale, FL. January 6-8, 2014.

    11. P. Heggernes, P. van 't Hof, M. Milanič. Induced subtrees in interval graphs, Proceedings of the 24th International Workshop on Combinatorial Algorithms (IWOCA 2013), Lecture Notes in Computer Science 8288 (2013) 230-243.

    12. N. Chiarelli, M. Milanič. Linear separation of total dominating sets in graphs, Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2013), Lecture Notes in Computer Science 8165 (2013) 165-176. full version (preprint)

    13. A. Brandstädt, M. Milanič, R. Nevries. New polynomial cases of the weighted efficient domination problem, Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), Lecture Notes in Computer Science 8087 (2013) 195-206.

    14. F. Cicalese, G. Cordasco, L. Gargano, M. Milanič, U. Vaccaro. Latency-bounded target set selection in social networks, Proceedings of the 9th Conference on Computability in Europe (CiE 2013), The Nature of Computation: Logic, Algorithms, Applications, Lecture Notes in Computer Science 7921 (2013) 65-77.

    15. E. Boros, P. Heggernes, P. van 't Hof, M. Milanič. Vector connectivity in graphs, Proceedings of the 10th annual conference on Theory and Applications of Models of Computation (TAMC 2013), Lecture Notes in Computer Science 7876 (2013) 331-342.

    16. V. E. Levit, M. Milanič, D. Tankus. On the recognition of k-equistable graphs, Proceedings of the 38th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2012), Lecture Notes in Computer Science 7551 (2012) 286-296.

    17. F. Cicalese, M. Milanič, U. Vaccaro. Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs, Proceedings of the 18th International Symposium on Fundamentals of Computation Theory (FCT 2011), Oslo, Norway, August 22-25, 2011. Lecture Notes in Computer Science 6914 (2011) 288-297.

    18. M. Kamiński, P. Medvedev, M. Milanič. Shortest paths between shortest paths and independent sets, Proceedings of the 21st International Workshop on Combinatorial Algorithms (IWOCA 2010), London, UK, July 26-28, 2010. Lecture Notes in Computer Science 6460 (2011) 56-67.

    19. F. Cicalese, M. Milanič. Graphs of separability at most two: structural characterizations and their consequences, Proceedings of the 21st International Workshop on Combinatorial Algorithms (IWOCA 2010), London, UK, July 26-28, 2010. Lecture Notes in Computer Science 6460 (2011) 291-302.

    20. F. Cicalese, T. Gagie, A. Macula, M. Milanič, E. Triesch. A better bouncer's algorithm, Proceedings of the 5th International Conference 'FUN with Algorithms' (FUN 2010), Lecture Notes in Computer Science 6099 (2010) 113-120.

    21. M. Milanič, J. Monnot. The exact weighted independent set problem in perfect graphs and related graph classes, V Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 09), Electronic Notes in Discrete Mathematics 35 (2009) 317-322.

    22. M. Kamiński, M. Milanič, P. Medvedev. On the plane-width of graphs, European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009), Electronic Notes in Discrete Mathematics 34 (2009) 633-637.

    23. F. Cicalese, M. Milanič. Computing with priced information: when the value makes the price, Proceedings of the 19th International Symposium on Algorithms and Computation, 2008, Lecture Notes in Computer Science 5369 (2008) 378-389.

      (Full version with all proofs: Computing with priced information: game trees and the value dependent cost model)

    24. V. E. Alekseev, V. Lozin, D. Malyshev, M. Milanič. The maximum independent set problem in planar graphs, Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, 2008, Lecture Notes in Computer Science 5162 (2008) 96-107.

    25. V. V. Lozin, M. Milanič. Tree-width and optimization in bounded degree graphs, Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 4769 (2007) 45-54.

    26. V. V. Lozin, M. Milanič. Maximum independent sets in graphs of low degree, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, LA, 2007), 874-880, ACM, New York, 2007.

    27. V. V. Lozin, M. Milanič. A polynomial algorithm to find an independent set of maximum weight in a fork-free graph, Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (Miami, FL, 2006), 26-30, ACM, New York, 2006.

    Book chapter:

  • M. Milanič, J. Monnot. The complexity of the exact weighted independent set problem, in: Combinatorial Optimization and Theoretical Computer Science: Interfaces and Perspectives, 30th Anniversary of the LAMSADE. Edited by Vangelis Th. Paschos, Wiley-ISTE, January 2008.


  • Miscellaneous (research reports, manuscripts):

  • M. Milanič, G. Rudolf. Structural results for equistable graphs and related classes, RUTCOR Research Report 25-2009.

  • F. Cicalese, M. Milanič. On parsimony haplotyping, Technical report 2008-04, Technische Fakultät, Universität Bielefeld, 2008.

  • F. Cicalese, M. Milanič. Computing with Priced Information: game trees and the value dependent cost model, Technical report 2008-03, Technische Fakultät, Universität Bielefeld, 2008.

  • V. V. Lozin, M. Milanič. Domination in Graphs of Low Degree, RUTCOR Research Report 27-2006

  • M. Milanič, J. Monnot. On the complexity of the exact weighted independent set problem



  • Back to my homepage.



    Last modified: November 2017

    Flag Counter