|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
|
|
Results
Found 19 publication records. Showing 19 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Christos A. Kapoutsis, Richard Královic, Tobias Mömke |
Size complexity of rotating and sweeping automata.  |
J. Comput. Syst. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen |
Steiner tree reoptimization in graphs with sharpened triangle inequality. |
J. Discrete Algorithms |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych |
Reoptimization of the Shortest Common Superstring Problem. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Mömke, Ola Svensson |
Approximating Graphic TSP by Matchings |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke |
Improved Approximations for Hard Optimization Problems via Problem Instance Classification. |
Rainbow of Computer Science |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Mömke, Ola Svensson |
Approximating Graphic TSP by Matchings. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Mömke |
Structural Properties of Hard Metric TSP Inputs - (Extended Abstract). |
SOFSEM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen |
The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová |
Improved Approximations for TSP with Simple Precedence Constraints. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Rossmanith |
Reoptimization of Steiner trees: Changing the terminal set. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Mömke |
On the power of randomization for job shop scheduling with k-units length tasks. |
ITA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych |
Reoptimization of the Shortest Common Superstring Problem. |
CPM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke |
On the Advice Complexity of Online Problems. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Peter Widmayer, Anna Zych |
Reoptimization of Steiner Trees. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos A. Kapoutsis, Richard Královic, Tobias Mömke |
On the Size Complexity of Rotating and Sweeping Automata. |
Developments in Language Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer |
On the Hardness of Reoptimization. |
SOFSEM |
2008 |
DBLP DOI BibTeX RDF |
reoptimization, approximation algorithms, inapproximability |
| 1 | Juraj Hromkovic, Tobias Mömke, Kathleen Steinhöfel, Peter Widmayer |
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. |
Algorithmic Operations Research |
2007 |
DBLP BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Richard Královic, Tobias Mömke, Kathleen Steinhöfel |
Efficient Algorithms for the Spoonerism Problem. |
FUN |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos A. Kapoutsis, Richard Královic, Tobias Mömke |
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. |
SAGA |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #19 of 19 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")