Matús Mihalák

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Marc Nunkesser

> Home > Persons > Matús Mihalák

Publications

2007
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/ErlebachJMNSW07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/ErlebachJMNSW07
Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
An Algorithmic View on OVSF Code Assignment. Algorithmica 47(3): 269-298 (2007)
2006
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/AmbuhlEMN06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/AmbuhlEMN06
Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser:
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. APPROX-RANDOM 2006: 3-14
2004
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/stacs/ErlebachJMNSW04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/ErlebachJMNSW04
Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
An Algorithmic View on OVSF Code Assignment. STACS 2004: 270-281
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/waoa/ErlebachJMNSW04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/waoa/ErlebachJMNSW04
Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
Joint Base Station Scheduling. WAOA 2004: 225-238

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.