Matúš Mihalák

Cited by

	All	Since 2016
Citations	1413	649
h-index	20	13
i10-index	38	23

160

120

200520062007200820092010201120122013201420152016201720182019202020216 8 28 30 40 57 98 89 151 113 127 123 130 129 122 130 10

Co-authors

Thomas ErlebachProfessor of Computer Science, School of Informatics, University of LeicesterVerified email at mcs.le.ac.uk
Yann DisserAssistant Professor, TU DarmstadtVerified email at mathematik.tu-darmstadt.de
Jérémie ChalopinLIS, CNRS & Aix-Marseille UniversitéVerified email at lis-lab.fr
Shantanu DasAix-Marseille University, FranceVerified email at lif.univ-mrs.fr
Rastislav ŠrámekGoogle ZurichVerified email at google.com
Marc NunkesserSoftware Engineer at Google ZurichVerified email at google.com
Subhash SuriProfessor of Computer Science, University of California, Santa BarbaraVerified email at cs.ucsb.edu
Riko JacobITU CopenhagenVerified email at itu.dk
Andreas BärtschiLos Alamos National LaboratoryVerified email at lanl.gov
Davide BilòAssociate Professor in C.S., Dipartimento di Scienze Umanistiche e Sociali, Università di SassariVerified email at uniss.it
Akaki MamageishviliETH ZurichVerified email at ethz.ch
Jan Christoph SchlegelUniversity of LondonVerified email at alumni.ethz.ch
Joachim M. BuhmannETH ZurichVerified email at inf.ethz.ch
Daniel Wolleb-GrafETH ZurichVerified email at ethz.ch
Beat GfellerGoogleVerified email at google.com
Subir Kumar GhoshRamakrishna Mission Vivekananda Educational and Research InstituteVerified email at rkmvu.ac.in
Paolo PennaETH ZurichVerified email at inf.ethz.ch
Guido ProiettiProfessor of Computer Science, University of L'AquilaVerified email at univaq.it
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Petr GolovachUniversity of BergenVerified email at ii.uib.no

Matúš Mihalák

Assistant Professor, Department of Data Science and Knowledge Engineering, Maastricht University

Verified email at maastrichtuniversity.nl - Homepage

Algorithms Combinatorial Optimization Algorithmic Graph Theory Algorithmic Game Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Network discovery and verification Z Beerliova, E Felix, T Erlebach, A Hall, M Hoffmann, M Mihal'ak, LS Ram IEEE Journal on selected areas in communications 24 (12), 2168-2181, 2006	197	2006
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs C Ambühl, T Erlebach, M Mihalák, M Nunkesser Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2006	151	2006
Shunting for dummies: An introductory algorithmic survey M Gatto, J Maue, M Mihalák, P Widmayer Robust and Online Large-Scale Optimization, 310-337, 2009	57	2009
A (4+ ε)-approximation for the minimum-weight dominating set problem in unit disk graphs T Erlebach, M Mihalák International Workshop on Approximation and Online Algorithms, 135-146, 2009	52	2009
Computing minimum spanning trees with uncertainty T Erlebach, M Hoffmann, D Krizanc, M Mihal'Ák, R Raman arXiv preprint arXiv:0802.2855, 2008	49	2008
An Algorithmic View on OVSF Code Assignment T Erlebach, R Jacob, M Mihalák, M Nunkesser, G Szabó, P Widmayer Technical Report, 2003	44*	2003
An algorithmic view on OVSF code assignment T Erlebach, R Jacob, M Mihalak, M Nunkesser, G Szabo, P Widmayer Algorithmica 47 (3), 269-298, 2007	42	2007
On the complexity of the metric tsp under stability considerations M Mihalák, M Schöngens, R Šrámek, P Widmayer International Conference on Current Trends in Theory and Practice of …, 2011	38	2011
The price of anarchy in network creation games is (mostly) constant M Mihalák, JC Schlegel International Symposium on Algorithmic Game Theory, 276-287, 2010	36	2010
Network discovery and verification Z Beerliova, F Eberhard, T Erlebach, A Hall, M Hoffmann, M Mihalák, ... Graph-Theoretic Concepts in Computer Science, 127-138, 2005	36	2005
Counting targets with mobile sensors in an unknown environment B Gfeller, M Mihalák, S Suri, E Vicari, P Widmayer International Symposium on Algorithms and Experiments for Sensor Systems …, 2007	34	2007
Tree Nash equilibria in the network creation game A Mamageishvili, M Mihalák, D Müller Internet Mathematics 11 (4-5), 472-486, 2015	31	2015
Rendezvous of mobile agents when tokens fail anytime S Das, M Mihalák, R Šrámek, E Vicari, P Widmayer International Conference On Principles Of Distributed Systems, 463-480, 2008	31	2008
Simple robots in polygonal environments: A hierarchy J Brunner, M Mihalák, S Suri, E Vicari, P Widmayer International Symposium on Algorithms and Experiments for Sensor Systems …, 2008	30	2008
Track Allocation in Freight-Train Classification with Mixed Tracks M Bohlin, H Flier, J Maue, M Mihalák 11th Workshop on Algorithmic Approaches for Transportation Modelling …, 2011	29	2011
An algorithmic view on OVSF code assignment T Erlebach, R Jacob, M Mihalak, M Nunkesser, G Szabo, P Widmayer Algorithmica 47 (3), 269-298, 2007	29	2007
Asymmetric swap-equilibrium: a unifying equilibrium concept for network creation games M Mihalák, JC Schlegel International Symposium on Mathematical Foundations of Computer Science, 693-704, 2012	27	2012
Hump Yard Track Allocation with Temporary Car Storage M Bohlin, H Flier, J Maue, M Mihalák Swedish Institute of Computer Science, 2010	27	2010
Data Delivery by Energy-Constrained Mobile Agents J Chalopin, S Das, M Mihalák, P Penna, P Widmayer	25*
The price of anarchy in network creation games is (mostly) constant M Mihalák, JC Schlegel Theory of Computing Systems 53 (1), 53-72, 2013	24	2013

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors