|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 11 occurrences of 8 keywords
|
|
|
|
|
Results
Found 33 publication records. Showing 33 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Marek Cygan, Jian-Feng Hou, Lukasz Kowalik, Borut Luzar, Jian-Liang Wu |
A Planar linear arboricity conjecture.  |
Journal of Graph Theory  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Lukasz Kowalik |
Channel assignment via fast zeta transform. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Kowalik, Marcin Mucha |
35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Kowalik, Marcin Pilipczuk, Karol Suchan |
Towards optimal kernel for connected vertex cover in planar graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Marek Cygan, Lukasz Kowalik |
Channel Assignment via Fast Zeta Transform |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Lukasz Kowalik, Borut Luzar, Riste Skrekovski |
An improved bound on the largest induced forests for triangle-free planar graphs. |
Discrete Mathematics & Theoretical Computer Science |
2010 |
DBLP BibTeX RDF |
|
| 1 | Lukasz Kowalik |
Fast 3-coloring Triangle-Free Planar Graphs. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen |
Improved induced matchings in sparse graphs. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski |
Fast Approximation in Subspaces by Doubling Metric Decomposition. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Kaminski, Lukasz Kowalik |
Approximating the Maximum 3- and 4-Edge-Colorable Subgraph. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Lukasz Kowalik, Borut Luzar |
A Planar Linear Arboricity Conjecture. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Lukasz Kowalik, Mateusz Wykurz |
Exponential-time approximation of weighted set cover. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Kowalik, Marcin Mucha |
Deterministic 7/8-approximation for the metric maximum TSP. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Kowalik |
Improved edge-coloring with three colors. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Lukasz Kowalik, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski |
Fast Approximation in Subspaces by Doubling Metric Decomposition |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen |
Improved Induced Matchings in Sparse Graphs. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Kowalik, Marcin Mucha |
Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Lukasz Kowalik |
New Linear-Time Algorithms for Edge-Coloring Planar Graphs. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Algorithm, Planar graph, Edge-coloring, Linear-time |
| 1 | Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk, Mateusz Wykurz |
Exponential-Time Approximation of Hard Problems |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Lukasz Kowalik, Jean-Sébastien Sereni, Riste Skrekovski |
Total-Coloring of Plane Graphs with Maximum Degree Nine. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Kowalik, Marcin Mucha |
Deterministic 7/8-Approximation for the Metric Maximum TSP. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Kowalik |
Adjacency queries in dynamic sparse graphs. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Lukasz Kowalik, Riste Skrekovski |
A Generalization of Kotzig's Theorem and Its Application. |
SIAM J. Discrete Math. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Kowalik, Marcin Mucha |
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality. |
WADS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski |
A Note on Scheduling Equal-Length Jobs to Maximize Throughput. |
J. Scheduling |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Kowalik, Maciej Kurowski |
Oracles for bounded-length shortest paths in planar graphs. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
Bounded length, shortest path, planar graph, dynamic environment, oracle |
| 1 | Lukasz Kowalik |
Improved Edge-Coloring with Three Colors. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Kowalik |
Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski |
A Note on Scheduling Equal-Length Jobs to Maximize Throughput |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Lukasz Kowalik |
Fast 3-Coloring Triangle-Free Planar Graphs. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Kowalik |
Short Cycles in Planar Graphs. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Kowalik, Maciej Kurowski |
Short path queries in planar graphs in constant time. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
shortest path, queries, planar graph |
| 1 | Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski |
A New 3-Color Criterion for Planar Graphs. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #33 of 33 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")