yusuke1997/dblp-id-title huggingface dataset:
Reconstructing Graphs from Connected Triples
On Subgraph Complementation to H-free Graphs
Investigating Programs in Terms of Partial Graphs
On the Rectilinear Art Gallery Problem - Algorithmic Aspects
Dihamiltonian Decomposition of Regular Graphs with Degree Three
Fixed-Parameter Complexity of lambda-Labelings
Generalized k-Center: Distinguishing Doubling and Highway Dimension
A Sweep Algorithm and its Implementation: The All-Nearest-Neighbors Problem Revisited
Proceedings of the WG '83, International Workshop on Graphtheoretic Concepts in Computer Science, June 16-18, 1983, Haus Ohrbeck, near Osnabrück, Germany
Induced Minor Free Graphs: Isomorphism and Clique-width
A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems
Minimum Flow Time Graph Ordering
Drawing Planar Graphs with Prescribed Face Areas
Wireless Networking: Graph Theory Unplugged
Collective Tree 1-Spanners for Interval Graphs
Graph Separator Algorithms: A Refined Analysis
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
A Dynamic Algorithm for Line Graph Recognition
Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract)
Optimal Irreversible Dynamos in Chordal Rings
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
Zur Anwendung von graphentheoretischen Cluster-Algorithmen auf das Begriffsnetz eines Wörterbuches
An Exact Algorithm for Minimum Distortion Embedding
Parameterized Complexity of Weighted Multicut in Trees
Complexity of Hypergraph Coloring and Seidel's Switching
Enumerating Minimal Solution Sets for Metric Graph Problems
On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings
Vertex-Disjoint Trees and Boundary Single-Layer Routing
The Maximum Labeled Path Problem
A Sweepcircle Algorithm for Voronoi Diagrams
Set-Theoretic Concepts in Programming Languages and their Implementation
Computing List Homomorphisms in Geometric Intersection Graphs
Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization
Local Approximation of the Maximum Cut in Regular Graphs
A Realistic Cost Measure for Binary Search Trees
Recognizing k-equistable Graphs in FPT Time
A Graph-Theoretic Approach for Designing Fair Distributed Resource Scheduling Algorithms
Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings
On Multi-Label Linear Interval Routing Schemes (Extended Abstract)
Rolling Upward Planarity Testing of Strongly Connected Graphs
Detecting Diamond Necklaces in Labeled Dags (A Problem from Distributed Debugging)
Parameterized Directed k-Chinese Postman Problem and k Arc-Disjoint Cycles Problem on Euler Digraphs
Competitive Location in the L 1 and L INF Metrics
Development of Several Reachability Algorithms for Directed Graphs
All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time
Definability Equals Recognizability of Partial 3-Trees
Reporting Geometric Inclusions with an Application to the Hidden Line Problem
Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains
Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs
The Maximum Weight Stable Set Problem in ( P_6 , bull)-Free Graphs
The Peculiarities of Extending Queue Layouts
The Folded Petersen Network: A New Versatile Multiprocessor Interconnection Topology
On Happy Colorings, Cuts, and Structural Parameterizations
Properties of Ordered Graph Grammars
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
Recognizing Bipolarizable and P 4-Simplicial Graphs
Student Poster Session
Subgraph-Universal Planar Graphs for Trees
Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT
Defective Coloring on Classes of Perfect Graphs
Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers
Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs
On the transition graphs of automata and grammars
Applications of Parallel Scheduling to Perfect Graphs
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs
Short Disjoint Cycles in Graphs with Degree Constraints
On Collinear Sets in Straight-Line Drawings
Graph Grammars and the Complexity Gap in the Isomorphism Problem for Acyclic Digraphs
Finding Paths in Grids with Forbidden Transitions
Graph-Theoretic Concepts in Computer Science, 15th International Workshop, WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings
On Retracts, Absolute Retracts, and Folds in Cographs
Finite Vertex-Colored Ultrahomogeneous Oriented Graphs
Talk Outlines and References
Optimal Embedding of Complete Binary Trees into Lines and Grids
Labeling Schemes for Deterministic Radio Multi-broadcast
A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
The Malleability of TSP_{2Opt}
Hamiltonicity Below Dirac's Condition
Gründe, Techniken und Konsequenzen der Verallgemeinerung von Wegealgorithmen
Structurally Parameterized d-Scattered Set
Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor
Domination Search on Graphs with Low Dominating-Target-Number
Towards a Provably Resilient Scheme for Graph-Based Watermarking
On Systems of Equations Defining Infinite Graphs
Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs
Ein axiomatischer Ansatz für eine Algebra strukturierter Objekte
Complexity of Some Infinite Games Played on Finite Graphs
On Complexity of a Message-Routing Strategy for Multicomputer Systems
The Power of a One-Dimensional Vector of Processors
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs
Improved Upper Bounds for Partial Vertex Cover
Book Embeddings and Crossing Numbers
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective
The Node Visit Cost of Brother Trees
Graph Coloring on a Coarse Grained Multiprocessor
Four Approximation Algorithms for the Feedback Vertex Set Problem
The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth
Complexity of the Packing Coloring Problem for Trees
Finding Squares and Rectangles in Sets of Points
Edge Elimination in TSP Instances
Improving Bounds for the Crossing Numbers on Surfaces of Genus g
Pathwidth of Circular-Arc Graphs
Cycles, Paths, Connectivity and Diameter in Distance Graphs
Finding Disjoint Paths on Directed Acyclic Graphs
Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model
Kernelization Hardness of Connectivity Problems in d -Degenerate Graphs
Improved Bounds for Minimum Fault-Tolerant Gossip Graphs
Computing Disjoint Path with Lenght Constraints
On Polynomial Kernelization for Stable Cutset
On the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint Graphs
Characterization and Recognition of Tree 3-Spanner Admissible Directed Path Graphs of Diameter Three
Approximation Algorithms for Unit Disk Graphs
Graph-Theoretic Properties Compatible with Graph Derivations
Approximation of Pathwidth of Outerplanar Graphs
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths
Upgrading Bottleneck Constrained Forests
New and Simple Algorithms for Stable Flow Problems
Complete Graph Drawings Up to Triangle Mutations
Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
Complexity of Pattern Coloring of Cycle Systems
Algorithmic Graph Minors and Bidimensionality
On the Crossing Number of the Hypercube and the Cube Connected Cycles
A New Data Structure for Representing Sorted Lists
A Stochastic Location Problem with Applications to Tele-diagnostic
Erratum: Cycles in Generalized Networks
Graph-Theoretic Concepts in Computer Science - 51st International Workshop, WG 2025, Otzenhausen, Germany, June 11-13, 2025, Revised Selected Papers
Nondeterministic Control Structures for Graph Rewriting Systems
On the Maximum Cardinality Search Lower Bound for Treewidth
Beyond Recognizing Well-Covered Graphs
An Efficient Algorithm to Recognize Prime Undirected Graphs
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs
Decomposing Data for Comparison in Systolic (VLSI) Arrays
Visualizing Two- and Three-Dimensional Models of Meristematic Growth
Classifying Subset Feedback Vertex Set for H-Free Graphs
Unsplittable Coverings in the Plane
GLB-Closures in Directed Acyclic Graphs and Their Applications
Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees
On Restrictions of Balanced 2-Interval Graphs
Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers
A Simple Implementation of Warshall's Algorithm on a VLSI Chip
On the Frank Number and Nowhere-Zero Flows on Graphs
Generation of Graphs with Bounded Branchwidth
Characterization and Recognition of Digraphs of Bounded Kelly-width
Complexity of Colored Graph Covers I. Colored Directed Multigraphs
A Simple Systolic Method to Find all Bridges of an Undirected Graph
On Dispersable Book Embeddings
Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings
Kernelization for Feedback Vertex Set via Elimination Distance to a Forest
Harmonious Coloring: Parameterized Algorithms and Upper Bounds
Graphs that Admit Right Angle Crossing Drawings
Temporal Graph Classes: A View Through Temporal Separators
Linear Layouts of Generalized Hypercubes
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Computation of Chromatic Polynomials Using Triangulations and Clique Trees
Invited Presentation: Data Management in Networks
Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract)
Families of Graphs Having Broadcasting and Gossiping Properties
Faster Algorithms for Graph Monopolarity
Distributedly Testing Cycle-Freeness
Upward Drawings of Acyclic Digraphs
Graph Grammars as a Tool for Description in Computer Processed Control: A Case Study
On Weak Isomorphism of Rooted Vertex-Colored Graphs
t/s-Diagnosable Systems: A Characterization and Diagnosis Algorithm
On Paths in Search or Decision Trees Which Require Almost Worst-Case Time
Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract)
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
Proceedings of the 8th Conference Graphtheoretic Concepts in Computer Science (WG '82), Neuenkirchen (near Erlangen), Germany
The Valve Location Problem in Simple Network Topologies
Modifying Networks to Obtain Low Cost Trees
Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers
Application of Graph Theory to Topology Generation for Logic Gates
Approximating Rank-Width and Clique-Width Quickly
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
Partitioned Probe Comparability Graphs
Algorithms Based on the Treewidth of Sparse Graphs
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity
Bounding Width on Graph Classes of Constant Diameter
Behaviour Preserving Refinement of Petri Nets
Excluding an Induced Wheel Minor in Graphs Without Large Induced Stars
On the Number of Labeled Graphs of Bounded Treewidth
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width
On Directed Steiner Trees with Multiple Roots
Short Cycles in Planar Graphs
A Fully Dynamic Algorithm for the Recognition of P 4 -Sparse Graphs
Uniform Sampling of Digraphs with a Fixed Degree Sequence
On the Tree-Degree of Graphs
Sequences of Radius k for Complete Bipartite Graphs
Computing Graph Polynomials on Graphs of Bounded Clique-Width
Odd Cycle Transversal in Mixed Graphs
Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness
Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs
Algorithms and Complexity of Sandwich Problems in Graphs (Extended Abstract)
Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation
Informatica, Scoula, Communità: Uno Sguardo dall' Occhio del Ciclone
Elegant Distance Constrained Labelings of Trees
Maximum Independent Set in 2-Direction Outersegment Graphs
Recognizing Bipartite Incident-Graphs of Circulant Digraphs
Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure
Series of Graphs Generated by Rational Machines
Two Algorithms for Finding Rectangular Duals of Planar Graphs
Beyond Helly Graphs: The Diameter Problem on Absolute Retracts
Hardness Results and Efficient Algorithms for Graph Powers
Graphs, Data Structures, Algorithms, Proceedings WG '78, Castle Feuerstein (near Erlangen), Germany
A Characterization of Mixed Unit Interval Graphs
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth
Hierarchical Partial Planarity
Facets of the Directed Acyclic Graph Layering Polytope
Criterion and algorithms for determination of bipartite subgraphs and their application to planarization of graphs
Matchings with Five Directions in Hypercubes Extend to Hamilton Cycles and Paths with Prescribed Ends
Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings
Plattenbauten: Touching Rectangles in Space
Invited Lecture: Silver Graphs: Achievements and New Challenges
A Syntactic Approach to Random Walks on Graphs
Flexible Matchings
On Minimum Diameter Spanning Trees under Reload Costs
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
Optimal Vertex Ordering of a Graph and its Application to Symmetry Detection
A Faster Parameterized Algorithm for Group Feedback Edge Set
Toward a Solution of the Holyer's Problem
The Forest Wrapping Problem on Outerplanar Graphs
Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings
Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings
Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2
Circular-Perfect Concave-Round Graphs
Improved Approximations of Independent Dominating Set in Bounded Degree Graphs
Restructuring Aspect Graphs into Aspect- and Cell-Equivalence Classes for Use in Computer Vision
On Subfamilies of AT-Free Graphs
Budgeted Maximum Graph Coverage
Algebraic Approach to Graph Transformation Based on Single Pushout Derivations
Deterministic Message Routing in Faulty Hypercubes
Augmenting Plane Straight-Line Graphs to Meet Parity Constraints
The Complexity of Graph Contractions
The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube
CABRI, An Interactive System for Graph Manipulation
The Complexity of the Vertex Coloring Problem on Hierarchies of Sparse Graphs
Polynomial-Size Enumeration Kernelizations for Long Path Enumeration
Asteroidal Sets in Graphs
Extending the Tractability Border for Closest Leaf Powers
The Minimum Conflict-Free Row Split Problem Revisited
On Complexity of Some Chain and Antichain Partition Problems
Concurrency Constrained Scheduling with Tree-Like Constraints
Bounded Arboricity to Determine the Local Structure of Sparse Graphs
Fast Breadth-First Search in Still Less Space
The Computational Complexity of Delay Management
Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability
On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties
Tree-width and Path-width of Comparability Graphs of interval Orders
Completing Colored Graphs to Meet a Target Property
Graphtheoretic Concepts in Computer Science, Proceedings of the International Workshop WG '80, Bad Honnef, Germany, June 15-18, 1980
Recognizing HHD-free and Welsh-Powell Opposition Graphs
Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings
Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching
Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory
Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs
On the Homogeneous Decomposition of Graphs
Boxicity and Separation Dimension
Linear Separation of Total Dominating Sets in Graphs
Upward Drawings of Search Trees (Extended Abstract)
Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs
Make your Enemies Transparent
Improved Edge-Coloring with Three Colors
Recognizing Outerplanar Graphs in Linear Time
Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies
The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
Revisiting Path Contraction and Cycle Contraction
On the Energy-Time-Area Cost of a Memory Access
A New Upper Bound on the Complexity of the All Pairs Shortest Path Problem
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
Pseudo-Hamiltonian Graphs
Alternation Graphs
The Complexity of Determing a Shortest Cycle of Even Length
Critical Relaxed Stable Matchings with Two-Sided Ties
Seperability of Sets of Polygons
The VLSI layout in various embedding models
Heuristics for Level Graph Embeddings
Finding k-Secluded Trees Faster
Bounded Tree-Width and LOGCFL
The Duals of Upward Planar Graphs on Cylinders
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons
A Multi-Scale Algorithm for Drawing Graphs Nicely
Fault Tolerant Additive Spanners
Graph Classes with Structured Neighborhoods and Algorithmic Applications
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
Preventing Small (s,t)Cuts by Protecting Edges
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
Describing Distributed Systems by Categorical Graph Grammars
Edge Elimination and Weighted Graph Classes
Approximate Constrained Bipartite Edge Coloring
Computer Experiences with Implicit Enumeration Algorithms for Graph Coloring
Interfacing and Transforming Knowledge Bases in a Graph Grammar Based Documentation System
Parameterized Complexity of the Arc-Preserving Subsequence Problem
Graph Search Trees and Their Leaves
Triangles in Euclidean Arrangements
On Some Generalizations of Outerplanar Graphs: Results and Open Problems
Graphs with Large Obstacle Numbers
k-Nearest-Neighbor Voronoi Diagrams for Sets of Convex Polygons, Line Segments and Points
A Polynomial-Time Algorithm for the Independent Set Problem in P_10, C_4, C_6 -Free Graphs
On the Number of Connected Sets in Bounded Degree Graphs
Reductions in Local Certification
Searching for a Visible, Lazy Fugitive
Parameterized Power Vertex Cover
Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms
A More Compact Visibility Representation
Transitive Closure Algorithms for Very Large Databases
Mixed Search Number and Linear-Width of Interval and Split Graphs
The Maximal f-Dependent Set Problem for Planar Graphs is in NC
On the Recognition of General Partition Graphs
Remarks on Some Concurrency Measures
Shortest Reconfiguration of Matchings
On the Existence of F-Factors
Embeddings in Recursive Combinatorial Networks
Weak-Order Extensions of an Order
A Polynomial Time Algorithm for Bounded Directed Pathwidth
A Linear Disjoint Path Algorithm
Degree Distribution for Duplication-Divergence Graphs: Large Deviations
The Minimum Shared Edges Problem on Grid-Like Graphs
New Graph Classes of Bounded Clique-Width
On H-Topological Intersection Graphs
Non-crossing H-Graphs: A Generalization of Proper Interval Graphs Admitting FPT Algorithms
The Average Size of Ordered Binary Subgraphs
Topology of Parallel Networks and Computational Complexity (Extended Abstract)
Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality
Node Rewriting in Hypergraphs
1. Fachtagung über Graphentheoretische Konzepte der Informatik (Graphtheoretic Concepts in Computer Science), 2.-4. Juli 1975, Berlin, 3. Workshop und Treffen des German Chapter of the ACM über Graphen-Sprachen und Algorithmen auf Graphen
A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness
Polychromatic Colorings of Unions of Geometric Hypergraphs
Twin-Width and Transductions of Proper k-Mixed-Thin Graphs
Closure Properties of Context-Tree Hyperedge Replacement Systems
Canadian Traveler Problems in Temporal Graphs
When Does FTP Become FPT?
Parameterized Domination in Circle Graphs
Deciding 1-sovability of distributed task is NP-hard
One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs
On Directed Feedback Vertex Set Parameterized by Treewidth
On Star Coloring of Graphs
Tree Spanners in Planar Graphs
2.5-Connectivity: Unique Components, Critical Graphs, and Applications
On the Nature of Structure and Its Identification
Travelling on Graphs with Small Highway Dimension
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
A Simple Quadratic Kernel for Token Jumping on Surfaces
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes
On the Fixed-Parameter Enumerability of Cluster Editing
On the Minimum Degree Up to Local Complementation: Bounds and Complexity
Invited Presentation: Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces
The Parameterized Complexity of the Equidomination Problem
Shortest Path Algorithms for Nearly Acyclic Directed Graphs
Probabilistic Models for Database Schemes and Random Hypergraphs
3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes
Vertex Contact Graphs of Paths on a Grid
The Perfect Matching Cut Problem Revisited
Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs
On the Complexity of Optimal Drawings of Graphs
On the Domination Search Number
Centipede Graphs and Visibility on a Cylinder
On Strong Menger-Connectivity of Star Graphs
Parameterized Complexity of Generalized Domination Problems
Expanders in Models of Social Networks
ADA Concurrency Specified by Graph Grammars
The Linear Arboricity Conjecture for 3-Degenerate Graphs
A Negative Circuit Algorithm for Weighted Min Cost Flows
Graph-Theoretic Solutions to Computational Geometry Problems
Transforming Semi-Dynamic Data Structures into Dynamic Structures
Efficient Parameterized Approximation
Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs
Effizienz von Färbungsalgorithmen
Graph-TSP from Steiner Cycles
An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem
Complexity of Splits Reconstruction for Low-Degree Trees
New Developments in Network Optimization and their Application in Industry and Government
NLC-2 Graph Recognition and Isomorphism
Counting Graphs and Null Models of Complex Networks: Configuration Model and Extensions
OBDD-Based Representation of Interval Graphs
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem
Budget Constrained Minimum Cost Connected Medians
Between Treewidth and Clique-Width
On Graphs Coverable by Chubby Shortest Paths
Linear-Time Recognition of Double-Threshold Graphs
A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem
Linear MIM-Width of Trees
Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time
EDM - A Data Model for Electronic CAD/CAM-Applications
Edge-Connectivity Augmentation and Network Matrices
Algorithms for Classes of Graphs with Bounded Expansion
Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms
Pretty Patterns Produced by Hyperedge Replacement