The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Matús Mihalák: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser
    Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:3-14 [Conf]
  2. Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák
    Network Discovery and Verification with Distance Queries. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:69-80 [Conf]
  3. Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák, L. Shankar Ram
    Network Discovery and Verification. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  4. Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
    An Algorithmic View on OVSF Code Assignment. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:270-281 [Conf]
  5. Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
    Joint Base Station Scheduling. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:225-238 [Conf]
  6. Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák, L. Shankar Ram
    Network Discovery and Verification. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:127-138 [Conf]
  7. Thomas Erlebach, Alexander Hall, Matús Mihalák
    Approximate Discovery of Random Graphs. [Citation Graph (0, 0)][DBLP]
    SAGA, 2007, pp:82-92 [Conf]
  8. Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
    An Algorithmic View on OVSF Code Assignment. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:3, pp:269-298 [Journal]

  9. Counting Targets with Mobile Sensors in an Unknown Environment. [Citation Graph (, )][DBLP]


  10. Simple Robots in Polygonal Environments: A Hierarchy. [Citation Graph (, )][DBLP]


  11. How Simple Robots Benefit from Looking Back. [Citation Graph (, )][DBLP]


  12. How to Guard a Graph?. [Citation Graph (, )][DBLP]


  13. Rendezvous of Mobile Agents When Tokens Fail Anytime. [Citation Graph (, )][DBLP]


  14. Discovery of Network Properties with All-Shortest-Paths Queries. [Citation Graph (, )][DBLP]


  15. Reconstructing Visibility Graphs with Simple Robots. [Citation Graph (, )][DBLP]


  16. Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision. [Citation Graph (, )][DBLP]


  17. Computing Minimum Spanning Trees with Uncertainty. [Citation Graph (, )][DBLP]


  18. Angle Optimization in Target Tracking. [Citation Graph (, )][DBLP]


  19. Reconstructing a Simple Polygon from Its Angles. [Citation Graph (, )][DBLP]


  20. A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. [Citation Graph (, )][DBLP]


  21. Computing Minimum Spanning Trees with Uncertainty [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002