The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Matús Mihalák" ( http://dblp.L3S.de/Authors/Matús_Mihalák )

  Author page on DBLP  Author page in RDF  Community of Matús Mihalák in ASPL-2

Publication years (Num. hits)
2004-2008 (17) 2009-2011 (15) 2012 (1)
Publication types (Num. hits)
article(7) incollection(1) inproceedings(25)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 6 occurrences of 6 keywords

Results
Found 33 publication records. Showing 33 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer How to Guard a Graph? Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Yann Disser, Matús Mihalák, Peter Widmayer A polygon is determined by its angles. Search on Bibsonomy Comput. Geom. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych Maximum Independent Set in 2-Direction Outersegment Graphs. Search on Bibsonomy WG The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Markus Bohlin, Holger Flier, Jens Maue, Matús Mihalák Track Allocation in Freight-Train Classification with Mixed Tracks. Search on Bibsonomy ATMOS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer Telling convex from reflex allows to map a polygon. Search on Bibsonomy STACS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Matús Mihalák, Marcel Schöngens, Rastislav Srámek, Peter Widmayer On the Complexity of the Metric TSP under Stability Considerations. Search on Bibsonomy SOFSEM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer Discovery of network properties with all-shortest-paths queries. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, Anna Zych Vertex Disjoint Paths for Dispatching in Railways. Search on Bibsonomy ATMOS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Yann Disser, Matús Mihalák, Peter Widmayer Reconstructing a Simple Polygon from Its Angles. Search on Bibsonomy SWAT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Matús Mihalák, Jan Christoph Schlegel The Price of Anarchy in Network Creation Games Is (Mostly) Constant. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer How Simple Robots Benefit from Looking Back. Search on Bibsonomy CIAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michael Gatto, Jens Maue, Matús Mihalák, Peter Widmayer Shunting for Dummies: An Introductory Algorithmic Survey. Search on Bibsonomy Robust and Online Large-Scale Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Davide Bilò, Yann Disser, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer Reconstructing Visibility Graphs with Simple Robots. Search on Bibsonomy SIROCCO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Thomas Erlebach, Matús Mihalák A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. Search on Bibsonomy WAOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Anvesh Komuravelli, Matús Mihalák Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision. Search on Bibsonomy SSS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Thomas Erlebach, Michael Hoffmann 0002, Danny Krizanc, Matús Mihalák, Rajeev Raman Computing Minimum Spanning Trees with Uncertainty Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Michael Hoffmann 0002, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman Computing Minimum Spanning Trees with Uncertainty. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Shantanu Das, Matús Mihalák, Rastislav Srámek, Elias Vicari, Peter Widmayer Rendezvous of Mobile Agents When Tokens Fail Anytime. Search on Bibsonomy OPODIS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Faulty Token, Fault Tolerance, Mobile Agents, Asynchronous, Rendezvous, Symmetry-breaking, Anonymous Networks
1Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer Angle Optimization in Target Tracking. Search on Bibsonomy SWAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer Discovery of Network Properties with All-Shortest-Paths Queries. Search on Bibsonomy SIROCCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jan Brunner, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer Simple Robots in Polygonal Environments: A Hierarchy. Search on Bibsonomy ALGOSENSORS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer How to Guard a Graph?. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer An Algorithmic View on OVSF Code Assignment. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Beat Gfeller, Matús Mihalák, Subhash Suri, Elias Vicari, Peter Widmayer Counting Targets with Mobile Sensors in an Unknown Environment. Search on Bibsonomy ALGOSENSORS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Thomas Erlebach, Alexander Hall, Matús Mihalák Approximate Discovery of Random Graphs. Search on Bibsonomy SAGA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák, L. Shankar Ram Network Discovery and Verification. Search on Bibsonomy IEEE Journal on Selected Areas in Communications The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák Network Discovery and Verification with Distance Queries. Search on Bibsonomy CIAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák, L. Shankar Ram Network Discovery and Verification. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák, L. Shankar Ram Network Discovery and Verification. Search on Bibsonomy Algorithms for Optimization with Incomplete Information The full citation details ... 2005 DBLP  BibTeX  RDF
1Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer An Algorithmic View on OVSF Code Assignment. Search on Bibsonomy STACS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer Joint Base Station Scheduling. Search on Bibsonomy WAOA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #33 of 33 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.