Martin Milanič

1.5k total citations
84 papers, 509 citations indexed

About

Martin Milanič is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Martin Milanič has authored 84 papers receiving a total of 509 indexed citations (citations by other indexed papers that have themselves been cited), including 75 papers in Computational Theory and Mathematics, 28 papers in Computer Networks and Communications and 14 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Martin Milanič's work include Advanced Graph Theory Research (68 papers), Complexity and Algorithms in Graphs (46 papers) and Graph Labeling and Dimension Problems (25 papers). Martin Milanič is often cited by papers focused on Advanced Graph Theory Research (68 papers), Complexity and Algorithms in Graphs (46 papers) and Graph Labeling and Dimension Problems (25 papers). Martin Milanič collaborates with scholars based in Slovenia, United States and Germany. Martin Milanič's co-authors include Vadim Lozin, Marcin Kamiński, Paul Medvedev, Ferdinando Cicalese, Ugo Vaccaro, Boštjan Brešar, Luisa Gargano, Gennaro Cordasco, Alexandru I. Tomescu and Oliver Schaudt and has published in prestigious journals such as SHILAP Revista de lepidopterología, Bioinformatics and PLoS ONE.

In The Last Decade

Martin Milanič

65 papers receiving 483 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Martin Milanič Slovenia	12	437	171	108	68	43	84	509
Leizhen Cai Hong Kong	12	474 1.1×	170 1.0×	98 0.9×	55 0.8×	47 1.1×	30	535
Yngve Villanger Norway	17	604 1.4×	233 1.4×	81 0.8×	37 0.5×	44 1.0×	46	675
Igor Razgon Ireland	11	370 0.8×	141 0.8×	48 0.4×	23 0.3×	43 1.0×	24	424
Stephan Kreutzer Germany	15	489 1.1×	139 0.8×	79 0.7×	52 0.8×	28 0.7×	48	588
Iztok Peterin Slovenia	11	359 0.8×	63 0.4×	123 1.1×	134 2.0×	66 1.5×	71	408
Sylvain Gravier France	14	374 0.9×	150 0.9×	109 1.0×	91 1.3×	142 3.3×	65	491
Celina M.H. de Figueiredo Brazil	14	589 1.3×	102 0.6×	201 1.9×	93 1.4×	146 3.4×	134	663
Joe Ryan Australia	11	338 0.8×	67 0.4×	111 1.0×	103 1.5×	145 3.4×	55	440
Robert C. Brigham United States	14	438 1.0×	109 0.6×	81 0.8×	164 2.4×	50 1.2×	40	555
Ioan Todinca France	11	325 0.7×	153 0.9×	36 0.3×	17 0.3×	18 0.4×	39	371

Countries citing papers authored by Martin Milanič

Since Specialization

Citations

This map shows the geographic impact of Martin Milanič's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Martin Milanič with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Martin Milanič more than expected).

Fields of papers citing papers by Martin Milanič

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Martin Milanič. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Martin Milanič. The network helps show where Martin Milanič may publish in the future.

Co-authorship network of co-authors of Martin Milanič

This figure shows the co-authorship network connecting the top 25 collaborators of Martin Milanič. A scholar is included among the top collaborators of Martin Milanič based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Martin Milanič. Martin Milanič is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Dadush, Daniel, Martin Milanič, & Tami Tamir. (2024). Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue. ACM Transactions on Algorithms. 20(3). 1–2.

Milanič, Martin, et al.. (2023). Computing well-covered vector spaces of graphs using modular decomposition. Computational and Applied Mathematics. 42(8).

Bodlaender, Hans L., Édouard Bonnet, Dušan Knop, et al.. (2023). Treewidth Is NP-Complete on Cubic Graphs. IT University Of Copenhagen (IT University of Copenhagen).

Brešar, Boštjan, et al.. (2018). On Total Domination in the Cartesian Product of Graphs. SHILAP Revista de lepidopterología. 2 indexed citations

Brandstädt, Andreas, Vassilis Giakoumakis, & Martin Milanič. (2018). Weighted efficient domination for some classes of H-free and of (H1,H2)-free graphs. Discrete Applied Mathematics. 250. 130–144. 2 indexed citations

Ekim, Tınaz, et al.. (2018). On Almost Well-Covered Graphs of Girth at Least 6. Discrete Mathematics & Theoretical Computer Science. vol. 20 no. 2(Graph Theory).

Bonomo, Flavia, et al.. (2017). Domination parameters with number 2: Interrelations and algorithmic consequences. Discrete Applied Mathematics. 235. 23–50. 15 indexed citations

Milanič, Martin, et al.. (2016). 1-perfectly orientable graphs and graph products. Discrete Mathematics. 340(7). 1727–1737. 3 indexed citations

Bonomo, Flavia, et al.. (2015). Graph classes with and without powers of bounded clique-width. Discrete Applied Mathematics. 199. 3–15. 6 indexed citations

10.

Bonomo, Flavia, et al.. (2014). Graphs of Power-Bounded Clique-Width.. arXiv (Cornell University). 2 indexed citations

11.

Milanič, Martin, et al.. (2014). Graphs whose complement and square are isomorphic. Discrete Mathematics. 327. 62–75. 1 indexed citations

12.

Milanič, Martin, et al.. (2014). A characterization of line graphs that are squares of graphs. Discrete Applied Mathematics. 173. 83–91. 4 indexed citations

13.

Milanič, Martin & Oliver Schaudt. (2013). Computing square roots of trivially perfect and threshold graphs. Discrete Applied Mathematics. 161(10-11). 1538–1545. 9 indexed citations

14.

Fritzilas, Epameinondas, Martin Milanič, Jérôme Monnot, & Yasmin Rios Solis. (2012). Resilience and optimization of identifiable bipartite graphs. Discrete Applied Mathematics. 161(4-5). 593–603.

15.

Kamiński, Marcin, Paul Medvedev, & Martin Milanič. (2011). Shortest paths between shortest paths. Theoretical Computer Science. 412(39). 5205–5210. 22 indexed citations

16.

Miklavič, Štefko & Martin Milanič. (2011). Equistable graphs, general partition graphs, triangle graphs, and graph products. Discrete Applied Mathematics. 159(11). 1148–1159. 7 indexed citations

17.

Milanič, Martin & Alexandru I. Tomescu. (2011). Set graphs. I. Hereditarily finite sets and extensional acyclic orientations. Discrete Applied Mathematics. 161(4-5). 677–690. 10 indexed citations

18.

Milanič, Martin & Gábor Rudolf. (2009). Structural Results for Equistable Graphs and Related Graph Classes.

19.

Lozin, Vadim & Martin Milanič. (2007). Maximum independent sets in graphs of low degree. Symposium on Discrete Algorithms. 874–880. 8 indexed citations

20.

Lozin, Vadim & Martin Milanič. (2006). A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. Symposium on Discrete Algorithms. 26–30. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact