search result

Cover von Efficient generation and execution of DAG-structured query graphs
Author: Neumann, Thomas -TH Darmstadt- Search for this author
Year: 2005
Publisher: Mannheim, Universität
Media group: DISSERTATION
Cover von Scale-isometric polytopal graphs in hypercubes and cubic lattices
polytopes in hypercubes and Zn
Author: Deza, Michel Marie; Grishukhin, Viatcheslav P.; Shtogrin, Mikhail Search for this author
Year: 2004
Publisher: London, Imperial College Press
Media group: MONOGRAPHIE
Cover von Special issue on advances in mining graphs, trees and sequences; 1/2
S. 1 - 198
Search for this author
Year: 2005
Publisher: Amsterdam, IOS Press
Count: 1/2
Media group: SPECIAL ISSUE
Cover von A framework for planning with incrementally created graphs in attributed problem spaces
Author: Balakirsky, Stephen B. Search for this author
Year: 2003
Publisher: Berlin, Infix Akademische Verlagsgesellschaft
Series: Dissertationen zur künstlichen Intelligenz; 270
Media group: DISSERTATION
Cover von Proceedings of the fifth international seminar on random graphs and probabilistic methods in combinatorics and computer science, "Random graphs '91", held August 5-9, 1991 in Poznan, Poland
Search for this author
Year: 1993
Publisher: New York, Wiley
Series: Random structures and algorithms : 5. 1994, 1
Media group: SPECIAL ISSUE
Cover von On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs

Year: 2026
Media group: LIPIcs
Cover von Lower Bounds on Pure Dynamic Programming for Connectivity Problems on Graphs of Bounded Path-Width

Lower Bounds on Pure Dynamic Programming for Connectivity Problems on Graphs of Bounded Path-Width

Year: 2026
Media group: LIPIcs
Cover von 2D Minimal Graph Rigidity is in NC for One-Crossing-Minor-Free Graphs

2D Minimal Graph Rigidity is in NC for One-Crossing-Minor-Free Graphs

Year: 2026
Media group: LIPIcs
Cover von Weakly-Sparse and Strongly Flip-Flat Classes of Graphs Are Uniformly Almost-Wide

Weakly-Sparse and Strongly Flip-Flat Classes of Graphs Are Uniformly Almost-Wide

Year: 2026
Media group: LIPIcs
Cover von Star-Based Separators for Intersection Graphs of c-Colored Pseudo-Segments

Star-Based Separators for Intersection Graphs of c-Colored Pseudo-Segments

Year: 2025
Media group: LIPIcs
OPEN V 11.1.0.0