|
Search the dblp DataBase
Marc Nunkesser:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- Marc Nunkesser, Daniel Sawitzki
Blockmodels. [Citation Graph (0, 0)][DBLP] Network Analysis, 2004, pp:253-292 [Conf]
- 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]
- 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]
- Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser
Sequential Vector Packing. [Citation Graph (0, 0)][DBLP] ESCAPE, 2007, pp:12-23 [Conf]
- 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]
Scheduling Additional Trains on Dense Corridors. [Citation Graph (, )][DBLP]
Multistage Methods for Freight Train Classification. [Citation Graph (, )][DBLP]
An Improved Train Classification Procedure for the Hump Yard Lausanne Triage. [Citation Graph (, )][DBLP]
Efficient Algorithms for the Double Traveling Salesman Problem with Multiple Stacks. [Citation Graph (, )][DBLP]
Performance of a greedy algorithm for edge covering by cliques in interval graphs [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|