yusuke1997/dblp-id-title huggingface dataset:
Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs
The Complexity of Contracting Bipartite Graphs into Small Cycles
A Language for Linearizing Graphics
Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs
Graph Grammar Derivation Processes
How to Sell a Graph: Guidelines for Graph Retailers
A PrT-Net Representation of Graph Grammars
The Post-Office Problem and Related Questions
Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers
Approximation Algorithms for the Weighted Independent Set Problem
On-Line Convex Plabarity Testing
Two Counterexamples in Graph Drawing
Minimum Weight Dynamo and Fast Opinion Spreading - (Extended Abstract)
Local Algorithms for Edge Colorings in UDGs
The Asynchronous Committee Meeting Problem
Finite Graph-Automata
Splitting Number is NP-complete
A Time-Optimal Parallel Algorithm for the Computing of Voronoi-Diagrams
A Fast Sequential and Parallel Algorithm for the Computation of the k-Closure of a Graph
Geometric Representations of Dichotomous Ordinal Data
Graph-Theoretic Concepts in Computer Science - 42nd International Workshop, WG 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected Papers
A Linear-Time Parameterized Algorithm for Computing the Width of a DAG
The 4-Steiner Root Problem
Induced Subgraphs of Bounded Degree and Bounded Treewidth
Designing Distance-Preserving Fault-Tolerant Topologies
Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs
Parallel Computation Using Meshes of Trees
An Additive Stretched Routing Scheme for Chordal Graphs
On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks
Improved Outerplanarity Bounds for Planar Graphs
A New Characterization of Tree Medians with Applications to Distributed Algorithms
Generalised Dualities and Finite Maximal Antichains
Copmlete Problems for Logspace Involving Lexicographic First Paths in Graphs
Tolerance Based Algorithms for the ATSP
Directed Rank-Width and Displit Decomposition
On Stable Matchings and Flows
An Algorithm for the Compilation of Arithmetic Expressions Generating an Associated Tree with Minimal Weighted Height
Guarding Quadrangulations and Stacked Triangulations with Edges
The Complexity of Determining Paths of Length k
Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings
Finding Cut-Vertices in the Square Roots of a Graph
Generalized Edge-Ranking of Trees (Extended Abstract)
The Expressive Power and Complexity of Dynamic Process Graphs
Optimal Parallel Routing in Star Graphs
The Shape of a Set of Points in the Plane
Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs
Disjoint Compatibility via Graph Classes
On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs
The Hardness of Embedding Grids and Walls
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees
On Bubble Generators in Directed Graphs
Efficient Algorithms for Eulerian Extension
Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks
Planar Graphs, via Well-Orderly Maps and Trees
Hadwiger Number of Graphs with Small Chordality
On Finding Balanced Bicliques via Matchings
Sparse Square Roots
Linear Time Algorithms for Testing Approximate Congruence in the Plane
Construction and Local Routing for Angle-Monotone Graphs
Domino Treewith (Extended Abstract)
Genus of Order and Lattices
Lowerbounds and Upperbounds on VLSI-Layouts for Perfect Binary Trees
Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
Contour Extraction Via Path Algorithms
The Expressiveness of Silence: Tight Bounds for Synchronous Communication of Information Using Bits and Silence
1-Pass Top-Down Update Schemes for Balanced Search Trees
Reporting Intersections of Line Segments: An Improvement of the Ottmann-Bentley Algorithm
Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs
Important Separators and Parameterized Algorithms
Bounding the Bandwidth of NP-Complete Problems
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
Diameter of the Knödel Graph
On Morphing 1-Planar Drawings
Computational Complexity of the Krausz Dimension of Graphs
Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes
Integral Uniform Flows in Symmetric Networks
Drawing Planar Partitions II: HH-Drawings
Subset Feedback Vertex Set Parameterized by Multiway Cut is FPT
NP-Complete Problems on Some Tree-Structured Graphs: a Review
Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs
Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers
A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs
Issues in the Study of Graph Embeddings
Multiple Hotlink Assignment
Segment Intersection Representations, Level Planarity and Constrained Ordering Problems
Moving Regular k-Gons in Contact
Complexity of Graph Covering Problems
Single vs. Double Pushout Derivations of Graphs
Fugitive-Search Games on Graphs and Related Parameters
New Approximation Results on Graph Matching and related Problems
On Scheduling Problems Restricted to Interval Orders
Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract)
Snakes and Ladders: A Treewidth Story
Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers
On 3-Coloring of (2P 4, C 5) -Free Graphs
Graph Rewriting Systems with Priorities
Approximations and Hardness of Covering and Packing Partially Ordered Items
Periodic Storage Schemes for Vector Computations
Finding Smallest Supertrees Under Minor Containment
On-line Algorithms for Satisfiability Problems with Uncertainty
Homothetic Triangle Contact Representations
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
Computing Maximum Cliques in B_2 -EPG Graphs
De Bruijn Graphs and DNA Graphs
Connectivity-Preserving Minimum Separator in AT-Free Graphs
On the Stable Degree of Graphs
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem
Lower Bounds on the Efficiency of Transforming Static Data Structures into Dynamic Structures
On Finding Graph Clusterings with Maximum Modularity
On Feedback Problems in Diagraphs
Dynamic Algorithms for Shortest Paths in Planar Graphs
Extending Partial Representations of Circular-Arc Graphs
Well-quasi-ordering Does Not Imply Bounded Clique-width
Tree-Partitions of k-Trees with Applications in Graph Layout
Determining the L(2, 1)-Span in Polynomial Space
On a Generalization of Heaps
Concurrent Transformations of Graphs and Relational Structures
Fully Dynamic Representations of Interval Graphs
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time
An Approximation Algorithms for Steiner's Problem in Graphs
Domination and Steiner Tree Problems on Graphs with Few P4S
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
Weighted Node Coloring: When Stable Sets Are Expensive
Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract)
Independent Set Reconfiguration in H-Free Graphs
Recognizing HHDS-Free Graphs
Separation Problems and Circular Arc Systems
Approximating the Metric TSP in Linear Time
Structures and Hyperstructures in Metabolic Networks
Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases
Popular Matchings of Desired Size
Treewidth: Characterizations, Applications, and Computations
Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time
Fast Robber in Planar Graphs
New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs
Small k-Dominating Sets in Planar Graphs with Applications
Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers
Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny
Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers
On Group Feedback Vertex Set Parameterized by the Size of the Cutset
Complexity of Coloring Graphs without Forbidden Induced Subgraphs
Clique-Width of Point Configurations
New Results on Weighted Independent Domination
Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates
New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth
Complexity of Secure Sets
Beyond Steiner's Problem: A VLSI Oriented Generalization
Polynomial-Time Recognition and Maximum Independent Set in Burling Graphs
Mixed Dominating Set: A Parameterized Perspective
Greedy Edge-Disjoint Paths in Complete Graphs
Deciding 3-Colourability in Less Than O(1.415^n) Steps
Saving Probe Bits by Cube Domination
Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs
The θ 5-Graph is a Spanner
On Fair Covering and Hitting Problems
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters
On the Relationship Between k-Planar and k-Quasi-Planar Graphs
On the Space and Access Complexity of Computation DAGs
Finding Two Edge-Disjoint Paths with Length Constraints
Gridless Channelrouting Revisited - a New Formulation of the Problem
Combinatorial Bounds for Conflict-Free Coloring on Open Neighborhoods
Core Stability of Minimum Coloring Games
Regular Marked Petri Nets
Digraph Decompositions and Monotonicity in Digraph Searching
On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs
Externasl Labeling and Algorithms for Hierarchic Networks
Homogeneous Sets and Domination Problems
The Power and the Limitations of Local Computations on Graphs
Eccentricity Approximating Trees - Extended Abstract
Feedback Edge Sets in Temporal Graphs
On the Complexity of (k, l)-Graph Sandwich Problems
Monotony Properties of Connected Visible Graph Searching
The Parameterized Complexity of the Rainbow Subgraph Problem
Graph Functionality
On the Relationship between Clique-Width and Treewidth
The Parameterized Complexity Landscape of the Unsplittable Flow Problem
Three-Dimensional VLSI Layouts
On Disjoint Cycles
Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid
The SIMPL Family of Programming Languages and Compilers
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings
Logic Arrays for Interval Indicator Functions
Completely Independent Spanning Trees in Maximal Planar Graphs
Minimum Eccentricity Shortest Paths in Some Structured Graph Classes
A Graph Grammar Representation of Non-Sequential Processes
Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers
Oriented Trees in $O(k \sqrt{k})$-Chromatic Digraphs, a Subquadratic Bound for Burr's Conjecture
Complexity and Approximability of Certain Bicriteria Location Problems
Network Flows in Trees and Knapsack Problems with Nested Constraints
Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance
Turán's Theorem Through Algorithmic Lens
Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings
How to Eliminate a Graph
An O ( n log n ) Algorithm for 1-D Tile Compaction
On k-Partitioning the n-Cube
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking
On Plane Cycles in Geometric Multipartite Graphs
Deciding the Erdős-Pósa Property in 3-Connected Digraphs
Crossing Reduction in Circular Layouts
A Characterisation of the Minimal Triangulations of Permutation Graphs
Bend-Minimum Orthogonal Drawings of Plane 3-Graphs
Separating a Polyhedron by One Translation from a Set of Obstacles (Extended Abstract)
Algebraic Graph Derivations for Graphical Calculi
On Subgraphs of Bounded Degeneracy in Hypergraphs
Independent Set Reconfiguration in Cographs
Graph Amalgamation Under Logical Constraints
Triangulation and Clique Separator Decomposition of Claw-Free Graphs
Reachablity Homomorphisms on Nets
Rankings of Directed Graphs
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
Optimization Problems in Dotted Interval Graphs
Disjoint Stable Matchings in Linear Time
Obtaining a Planar Graph by Vertex Deletion
Optical All-to-All Communication in Inflated Networks
Structured Development of Modular Software Systems: The Module Graph as Central Data Structure
Minimal Size of Piggybacked Information for Tracking Causality: A Graph-Based Characterization
A New Characterization of P k -free Graphs
Convex Drawings of Graphs with Non-convex Boundary
Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems
Finding a Minimal Transitive Reduction in a Strongly Connected Digraph within Linear Time
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space
Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set
Parameterized Graph Cleaning Problems
The Complexity of Diameter on H-free Graphs
Structural Parameterizations for Induced and Acyclic Matching
Coloring k-Colorable Graphs in Constant Expected Parallel Time
Minimum Weight Euclidean (1+ε )-Spanners
Euclidian Shortest Paths in the Presence of Parallel Rectilinear Barriers
Boundaried Kernelization
Colouring and Covering Nowhere Dense Graphs
Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings
On the Time Complexity of Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
Schema Hypergraphs: A Formalism to Investigate Logical Data Base Design
On Decision Problems for Forbidden Structures
A Turing Kernelization Dichotomy for Structural Parameterizations of ℱ -Minor-Free Deletion
Linearizing Partial Search Orders
Filtering Hyperedge-Replacement Through Compatible Properties
Graph Rewriting Systems and their Application to Network Reliability Analysis
Recognizing Binary Hamming Graphs in O(n² log n) Time
A 9k Kernel for Nonseparating Independent Set in Planar Graphs
Two Polynomial Problems in PLA Folding
On Low Rank-Width Colorings
Feedback Vertex Set on Hamiltonian Graphs
Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors
Approximate Association via Dissociation
Succinct Preferential-Attachment Graphs
Efficient Broadcasting in Random Power Law Networks
A Multi-scale Algorithm for the Linear Arrangement Problem
Bandwidth and Profile Minimization
The k-Disjoint Paths Problem on Chordal Graphs
Short Disjoint Cycles in Cubic Bridgeless Graphs
The 3-Steiner Root Problem
A Parallel Algorithm for Channel Routing
Segmenting Strings Homogeneously Via Trees
Alternative Cycle Covers and Paths
Graph-Based Approaches to Software Watermarking
A Uniform Approach to Graph Rewriting: The Pullback Approach
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results
The Parameterized Complexity of Some Minimum Label Problems
Recognizing k-Clique Extendible Orderings
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs
On Stable Cutsets in Line Graphs
Polynomial Kernelization for Removing Induced Claws and Diamonds
On Feedback Problems in Planar Digraphs
n Points and One Line: Analysis of Randomized Games
The Probabilistic Minimum Coloring Problem
A Lower Bound for Treewidth and Its Consequences
Kernels in Bipartite Graphs
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes
Deciding the Bell Number for Hereditary Graph Properties - (Extended Abstract)
Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs
Chordal Graphs and Their Clique Graphs
Smallest Odd Holes in Claw-Free Graphs (Extended Abstract)
Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract)
Planarity of the 2-Level Cactus Model
Graphen-Sprachen - eine Übersicht
Konzept einer virtuellen Maschine zur Strukturmanipulation
Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture)
A Structural Description of Zykov and Blanche Descartes Graphs
Induced Subgraph Isomorphism for Cographs in NP-Complete
Time-Optimal Tree Computations on Sparse Meshes
Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
Feedback Vertex Set and Longest Induced Path on AT-Free Graphs
Improved Diameter Bounds for Altered Graphs
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs
Computing the Independence Number of Dense Triangle-Free Graphs
Efficient Parallel Modular Decomposition (Extended Abstract)
Edge Partitions of Optimal 2-plane and 3-plane Graphs
Parameterized Complexity for Domination Problems on Degenerate Graphs
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
Linearly \chi χ -Bounding (P_6, C_4) ( P 6 , C 4 ) -Free Graphs
Cutting Barnette Graphs Perfectly is Hard
Optimal (s, t)-Cuts (Extended Abstract)
Approximating Minimum Dominating Set on String Graphs
Tree Spanners for Bipartite Graphs and Probe Interval Graphs
Token Sliding on Graphs of Girth Five
Drawing Graphs as Spanners
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
An Algorithmic Framework for Locally Constrained Homomorphisms
Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth
On Domination Elimination Orderings and Domination Graphs (Extended Abstract)
Sequence Hypergraphs
Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation
Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting
Induced Separation Dimension
Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs
On the Boolean-Width of a Graph: Structure and Applications
Decomposition of Linear Recursive Logic Programs
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions
An Upper Bound for the Maximum Cut Mean Value
On Additive Spanners in Weighted Graphs with Local Error
Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems
Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height
Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs
log n-Approximative NLC k -Decomposition in O(n 2k+1 ) Time
Efficient Communication in Unknown Networks
Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees
A New Characterization of P4-connected Graphs
The Largest Connected Subgraph Game
Faster Exact Bandwidth
Bounds to the Page Number of Partially Ordered Sets
On the Small Cycle Transversal of Planar Graphs
Connected and Loosely Connected List Homomorphisms
On the Analysis of Grid Structures for Spatial Objects of Non-Zero Size
Flowshop Scheduling with no Wait in Process on Three Machines
Chromatic Index Under Parameterized Settings
Approximability of the Path-Distance-Width for AT-free Graphs
Linear Rank-Width and Linear Clique-Width of Trees
Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers
Account on Intervals
Generalized Parametric Multi-terminal Flows Problem
Finding Induced Paths of Given Parity in Claw-Free Graphs
Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs
Proper Helly Circular-Arc Graphs
Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property
On the Connectivity of the Flip Graph of Plane Spanning Paths
Dominance in the Presence of Obstracles
The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs
A Symbolic Approach to the All-Pairs Shortest-Paths Problem
Split-Perfect Graphs: Characterizations and Algorithmic Use
Certifying 3-Edge-Connectivity
Specification of a Programming Support Environment by Graph Grammars
Efficient Dispersion Algorithms for Geometric Intersection Graphs
A Generalized Encryption Scheme Based on Random Graphs
Graph Ear Decompositions and Graph Embeddings (Extended Abstract)
Tolerance Graphs and Orders
Simultaneous Visibility Representations of Plane st-graphs Using L-shapes
A Comparison Between Petri-Nets and Graph Grammars
The Chinese Postman Problem for Mixed Graphs
Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-
Collective Tree Spanners and Routing in AT-free Related Graphs
Paging Binary Trees with External Balancing
Neighbourhood-Uniform NLC Grammars
An Observation Concerning the Complexity of Problems with Few Solutions and its Application to Cryptography
The Write Fixed Serializability Problem of Interleaved Database Transactions
Colouring Vertices of Triangle-Free Graphs
Variants of Multidimensional B-Trees as Dynamic Index Structures for Associative Retrieval in Database Systems
NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems
Parameterized Algorithms for Even Cycle Transversal
Octagonal Drawings of Plane Graphs with Prescribed Face Areas
Recognition of Linear and Star Variants of Leaf Powers is in P
Token Sliding on Chordal Graphs
Finding Intersection Models of Weakly Chordal Graphs
A New 3-Color Criterion for Planar Graphs
Ranking of Graphs
Roman Cycle Hitting Set
Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs
Covering a Graph with Minimal Local Sets
NCE Graph Grammars and Clique-Width
The Complexity of Approximating the Class Steiner Tree Problem
Bears with Hats and Independence Polynomials
Virtuelle Binärbaum-Technik
Triangulated Neighbourhoods in C 4 -Free Berge Graphs
Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy
Threshold-Coloring and Unit-Cube Contact Representation of Graphs
Relational Data Base Schemas with Functional Dependencies and Objects
Graph-Theoretical Tools and their Use in a Practical Distributed Operating System Design Case
Efficient Embeddings of Grids into Grids
On the Broadcast Time of the Butterfly network
Graph Isomorphism Restricted by Lists
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Additive Spanners for Circle Graphs and Polygonal Graphs
Degreewidth: A New Parameter for Solving Problems on Tournaments
Proceedings WG '84, Workshop on Graphtheoretic Concepts in Computer Science, Berlin, Germany
Linear Orderings of Random Geometric Graphs
(k, +)-Distance-Hereditary Graphs
Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation
Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity
Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers
Independent Tree Spanners
Efficient Union-Find for Planar Graphs and other Sparse Graph Classes (Extended Abstract)
Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT
Upward Straight-Line Embeddings of Directed Graphs into Point Sets
Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks
The Stable Fixtures Problem with Payments
A Language for Generic Graph-Transformations
Toward a Complete Representation of Graphoids in Graphs (Abridged Version)
Locally Consistent Constraint Satisfaction Problems with Binary Constraints
Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds
Geodetic Convexity Parameters for Graphs with Few Short Induced Paths
Switchbox Routing in VLSI Design: Closing the Complexity Gap
Algorithms and Models for the On-Line Vertex-Covering
Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs