|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
Results
Found 5 publication records. Showing 5 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
52 | Ken-ichi Kawarabayashi, Bruce A. Reed |
A nearly linear time algorithm for the half integral parity disjoint paths packing problem. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Ken-ichi Kawarabayashi, Bruce A. Reed |
A nearly linear time algorithm for the half integral disjoint paths packing. |
SODA |
2008 |
DBLP BibTeX RDF |
|
35 | Ronald Koch, Martin Skutella, Ines Spenke |
Maximum k -Splittable s , t -Flows. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
k-Splittable, s, t-Flow, Polynomial time approximation scheme, Bounded treewidth |
28 | Ronald Koch, Martin Skutella, Ines Spenke |
Approximation and Complexity of k-Splittable Flows. |
WAOA |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Gyula Pap |
Some new results on node-capacitated packing of A-paths. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
node-capacities, paths-packing, algorithms |
Displaying result #1 - #5 of 5 (100 per page; Change: )
|
|