Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Book
|
![]() |
Graph-Theoretic Concepts in Computer Science: 24th International Workshop, WG'98, Smolenice Castle, Slovak Republic, June 18-20, 1998. ProceedingsGoos, Gerhard ; Hartmanis, Juris ; van Leeuwen, Jan Hromkovič, Juraj ; Sýkora, OndrejBerlin, Heidelberg: Springer Berlin / Heidelberg 1998Full text available |
2 |
Material Type: Book
|
![]() |
Graph-Theoretic Concepts in Computer Science: 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 ProceedingsBrandstädt, Andreas ; Le, Van BangBerlin, Heidelberg: Springer Berlin / Heidelberg 2001Full text available |
3 |
Material Type: Article
|
![]() |
Treewidth Lower Bounds with BramblesBodlaender, Hans L. ; Grigoriev, Alexander ; Koster, Arie M. C. A.Algorithmica, 2008-05, Vol.51 (1), p.81-98 [Peer Reviewed Journal]New York: Springer-VerlagFull text available |
4 |
Material Type: Article
|
![]() |
Design and Performance Evaluation of Sequence Partition AlgorithmsYang, Bing ; Chen, Jing ; Lu, En-Yue ; Zheng, Si-QingJournal of computer science and technology, 2008-09, Vol.23 (5), p.711-718 [Peer Reviewed Journal]Boston: Springer USFull text available |
5 |
Material Type: Article
|
![]() |
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration AlgorithmsFomin, Fedor V. ; Gaspers, Serge ; Pyatkin, Artem V. ; Razgon, IgorAlgorithmica, 2008-10, Vol.52 (2), p.293-307 [Peer Reviewed Journal]New York: Springer-VerlagFull text available |
6 |
Material Type: Article
|
![]() |
Exact Algorithms for Exact Satisfiability and Number of Perfect MatchingsBjörklund, Andreas ; Husfeldt, ThoreAlgorithmica, 2008-10, Vol.52 (2), p.226-249 [Peer Reviewed Journal]New York: Springer-VerlagFull text available |
7 |
Material Type: Article
|
![]() |
Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short CyclesRaman, Venkatesh ; Saurabh, SaketAlgorithmica, 2008-10, Vol.52 (2), p.203-225 [Peer Reviewed Journal]New York: Springer-VerlagFull text available |
8 |
Material Type: Article
|
![]() |
Nondeterministic Graph Searching: From Pathwidth to TreewidthFomin, Fedor V. ; Fraigniaud, Pierre ; Nisse, NicolasAlgorithmica, 2009-03, Vol.53 (3), p.358-373 [Peer Reviewed Journal]New York: Springer-VerlagFull text available |
9 |
Material Type: Article
|
![]() |
Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner’s ContractionDemaine, Erik D. ; Hajiaghayi, MohammadTaghi ; Kawarabayashi, Ken-ichiAlgorithmica, 2009-06, Vol.54 (2), p.142-180 [Peer Reviewed Journal]New York: Springer-VerlagFull text available |
10 |
Material Type: Article
|
![]() |
On Two Techniques of Combining Branching and TreewidthFomin, Fedor V. ; Gaspers, Serge ; Saurabh, Saket ; Stepanov, Alexey A.Algorithmica, 2009-06, Vol.54 (2), p.181-207 [Peer Reviewed Journal]New York: Springer-VerlagFull text available |