|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 186 occurrences of 141 keywords
|
|
|
|
|
Results
Found 505 publication records. Showing 505 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 13 | Xaver Gubás, Juraj Hromkovic, Juraj Waczulík |
A Nonlinear Lower Bound on the Practical Combinational Complexity.  |
STACS  |
1992 |
DBLP DOI BibTeX RDF |
|
| 13 | Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis |
Computing Shortest Paths and Distances in Planar Graphs. |
ICALP |
1991 |
DBLP DOI BibTeX RDF |
|
| 13 | Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson |
Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. |
WG |
1991 |
DBLP DOI BibTeX RDF |
|
| 13 | Fang Wan |
New divide-and-conquer techniques for finding disjoint paths. |
SPDP |
1991 |
DBLP DOI BibTeX RDF |
|
| 13 | Kenneth R. Sloan, James Painter |
Pessimal Guesses may be Optimal: A Counterintuitive Search Result. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1988 |
DBLP DOI BibTeX RDF |
3-D object surface reconstruction, counterintuitive search, planar contours, pattern recognition, pattern recognition, picture processing, picture processing, search spaces, search efficiency, divide-and-conquer method |
Displaying result #501 - #505 of 505 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6] |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license