yusuke1997/dblp-id-title huggingface dataset:
Modular Descriptions of Regular Functions
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems
A Chomsky-Schützenberger Theorem for Weighted Automata with Storage
Fast Computing the Algebraic Degree of Boolean Functions
From Tree-Based Generators to Delegation Networks
Weighted Propositional Configuration Logic over De Morgan Algebras
Codes and Combinatorial Structures from Circular Planar Nearrings
The Syntactic Complexity of Eulerian Graphs
Independence of Hyperlogarithms over Function Fields via Algebraic Combinatorics
Hadamard Matrices, Designs and Their Secret-Sharing Schemes
Shuffle Product of Regular Languages: Results and Open Problems
On Sets of Numbers Rationally Represented in a Rational Base Number System
On Gröbner Bases in the Context of Satisfiability-Modulo-Theories Solving over the Real Numbers
Picture Languages: From Wang Tiles to 2D Grammars
Nonassociativity à la Kleene
Designated-Verifier Linkable Ring Signatures with Unconditional Anonymity
Recognizable vs. Regular Picture Languages
New Cryptcodes for Burst Channels
A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages
From Grammars and Automata to Algebras and Coalgebras
Commutative Regular Languages - Properties and State Complexity
Algebraic Methods in Quantum Informatics
Proofs of Storage: Theory, Constructions and Applications
On Several Proofs of the Recognizability Theorem
Randomized Nyström Features for Fast Regression: An Error Analysis
A Backward and a Forward Simulation for Weighted Tree Automata
Maximal Diameter on a Class of Circulant Graphs
An Algorithm for Computing a Basis of a Finite Abelian Group
Algebraic Models for Arbitrary Strength Covering Arrays over v-ary Alphabets
Verifying Security Protocols for Sensor Networks Using Algebraic Specification Techniques
Attacking BEAR and LION Schemes in a Realistic Scenario
An Algebraic Geometric Approach to Multidimensional Words
More Than 1700 Years of Word Equations
Algebraic Informatics - 4th International Conference, CAI 2011, Linz, Austria, June 21-24, 2011. Proceedings
Enhancing an Attack to DSA Schemes
Combinatorics of Finite Words and Suffix Automata
Iteration Grove Theories with Applications
Intersecting Two Quadrics with GeoGebra
Algebraic Informatics - 8th International Conference, CAI 2019, Niš, Serbia, June 30 - July 4, 2019, Proceedings
On Some Algebraic Ways to Calculate Zeros of the Riemann Zeta Function
Some Combinatorial Applications of Gröbner Bases
Canonical Reduction Systems in Symbolic Mathematics
Algebraic Informatics, Second International Conference, CAI 2007, Thessaloniki, Greece, May 21-25, 2007, Revised Selected and Invited Papers
Simplifying Algebraic Functional Systems
Recognizable Picture Languages and Polyominoes
Computation of Solutions to Certain Nonlinear Systems of Fuzzy Relation Inequations
Why We Need Semirings in Automata Theory (Extended Abstract)
On Near Prime-Order Elliptic Curves with Small Embedding Degrees
Single-Path Restarting Tree Automata
On Generalizations of Weighted Finite Automata and Graphics Applications
Algebraic Informatics, Third International Conference, CAI 2009, Thessaloniki, Greece, May 19-22, 2009, Proceedings
Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics
Polynomial Interpolation of the k-th Root of the Discrete Logarithm
Watson-Crick Powers of a Word
From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
Cycle-Free Finite Automata in Partial Iterative Semirings
On Elliptic Curve Paillier Schemes
Effective Invariant Theory of Permutation Groups Using Representation Theory
A New Bound for Cyclic Codes Beating the Roos Bound
Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays
Unbordered Pictures: Properties and Construction
Strong Prefix Codes of Pictures
On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes
Generalized AG Codes as Evaluation Codes
A New Partial Key Exposure Attack on Multi-power RSA
Side Channel Attacks against Pairing over Theta Functions
On the Lower Block Triangular Nature of the Incidence Matrices to Compute the Algebraic Immunity of Boolean Functions
Restarting Tree Automata and Linear Context-Free Tree Languages
Model-Checking by Infinite Fly-Automata
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited
How to Decide Functionality of Compositions of Top-Down Tree Transducers
Sturmian and Episturmian Words
Parallelisms of \mathrmPG(3, 4) Invariant Under Cyclic Groups of Order 4
Algebraic Informatics - 6th International Conference, CAI 2015, Stuttgart, Germany, September 1-4, 2015. Proceedings
The Precise Complexity of Finding Rainbow Even Matchings
Computation of Pell Numbers of the Form pX2
On the Scalar Complexity of Chudnovsky ^2 Multiplication Algorithm in Finite Fields
Osculating Spaces of Varieties and Linear Network Codes
Theme and Variations on the Concatenation Product
EF+EX Forest Algebras
Algebraic Systems Motivated by DNA Origami
Process Algebra: An Algebraic Theory of Concurrency
Weighted Two-Way Transducers
On the Efficient Generation of Generalized MNT Elliptic Curves
Approximation of Large Probabilistic Networks by Structured Population Protocols
Equivalence Checking Problem for Finite State Transducers over Semigroups
On a Conjecture of Helleseth
An Eilenberg Theorem for Pictures
Chaining Multiplications in Finite Fields with Chudnovsky-Type Algorithms and Tensor Rank of the k-Multiplication
An Algebra for Tree-Based Music Generation
Ordering the Boolean Cube Vectors by Their Weights and with Minimal Change
Parallel Communicating Grammar Systems with Regular Control
Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem
Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages
Symbolic and numeric quantum circuit simulation
Quantum Strategies and Bell Inequalities
Anonymous Transmission of Quantum Information
Quantum Merkle Puzzles
Preparation and Thermal Characterization of Carbon Nanotubes-Based Composites for Applications in Electronics Packaging
Biometric Nanotechnology and Nonlinear Dynamics
Surface Plasmon Resonances in Diffusive Reflection Spectra of Multilayered Silver Nanocomposite Films
A Scheme to Entangle Nanomechanical Resonators and Microwave Cavities
Strict Hierarchy of Bell Theorems
Towards Model-Checking Quantum Security Protocols
DFT studies of closely bound ground state of (N2-N2)+1 ionic dimmer
Secure Message Relay over Networks with QKD-Links
A New Approach for Modelling Circuits Containing NAND Gates Using Biomolecular Computing
Towards Multistate Nanocomputing: The Implementation of a Primitive Fuzzy Controller
Multiparty Distributed Compression of Quantum Information
DNA and quantum theory
Diner based Channel Access Protocol for Nano-Machines
Architecture of the Secoqc Quantum Key Distribution network
Quantum Key Distribution with Classical Bob
Quantum Entanglement, Non-Locality and Secure Computation
Qunits in Two Way Quantum Key Distribution
Contextual Probabilistic Analysis of Bell's Inequality: Nonlocality, "Death of Reality'' or Non-Kolmogorovness?
Transfering Proofs of Zero-Knowledge Systems with Quantum Correlations
Anisotropic Plasmon Resonance of Surface Metallic Nanostructures Prepared by Ion Beam Mixing
First International Conference on Quantum, Nano, and Micro Technologies, ICQNM 2007, January 2-6, 2007, Guadeloupe, French Caribbean
Stochastic Processes in Machine Intelligence: Neural Structures Based on the Model of the Quantum Harmonic Oscillator
Classical, Quantum and Non-signalling Resources in Bipartite Games
A Quantum Network Manager that Supports a One-Time Pad Stream
Continuous-variable quantum information with three-mode Gaussian states: allotment, trade-off, teleportation, and telecloning
DNA as Building Block for Self-Assembly of Micro-components
Second International Conference on Quantum, Nano, and Micro Technologies, ICQNM 2008, February 10-15, 2008, Sainte Luce, Martinique, French Caribbean
Comparison of two bounds of the quantum correlation set
Loss-Tolerant Quantum Coin Flipping
A Survey of Quantum Programming Languages: History, Methods, and Tools
More about Subcolorings
On the Relation of Strong Triadic Closure and Cluster Deletion
Parallel Triangulation of Nonconvex Polytopes
Hypergraphs and Decision Trees (Abstract)
Distributed Parallelism of Graph Transformations
Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG '95, Aachen, Germany, June 20-22, 1995, Proceedings
Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults
Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1
On the Lossy Kernelization for Connected Treedepth Deletion Set
Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers
Playing Snake on a Graph
On Stable Cutsets in Claw-Free Graphs and Planar Graphs
Graph Reconstruction with Connectivity Queries
GALA - eine Sprache zur Erzeugung und Manipulation von interpretierten Graphen
On the Spanning Trees of Weighted Graphs
Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs
Improved Compressions of Cube-Connected Cycles Networks
A Generalized Best-First Search Method in Graphs
Formal Tools for Top-Down and Bottom-Up Generation of Acyclic Relational Schemata
Strong Cliques in Diamond-Free Graphs
Cluster Graph Modification Problems
α i -Metric Graphs: Radius, Diameter and all Eccentricities
VLSI Algorithms for the Connected Component Problem and its Verification Problem
Upper Clique Transversals in Graphs
A Graph Polynomial Arising from Community Structure (Extended Abstract)
Lattices and Maximum Flow Algorithms in Planar Graphs
On Module-Composed Graphs
An Improved FPT Algorithm for Independent Feedback Vertex Set
Treedepth Bounds in Linear Colorings
Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers
System Diagnosis with Smallest Risk of Error
Application of Attributed Graph Grammars to VLSI Design
An Approximation Algorithm for 3-Colourability
Clique-Width: Harnessing the Power of Atoms
Structural Parameterizations for Boxicity
On Improved Time Bounds for Permutation Graph Problems
Fast Parallel Algorithms for Coloring Random Graphs
Lightweight Near-Additive Spanners
Graph Subcolorings: Complexity and Algorithms
Split Clique Graph Complexity
Description and Simulation of Processes Using Condensed Nets
Hierarchical Specified Unit Disk Graphs (Extended Abstract)
On Randomized Broadcasting in Star Graphs
The Cinderella Game on Holes and Anti-holes
NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract)
Two Broadcasting Problems in Faulty Hypercubes
Tree Spanners for Subgraphs and Related Tree Covering Problems
Low-Port Tree Representations
Hanani-Tutte and Monotone Drawings
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs
Approximating Bin Packing with Conflict Graphs via Maximization Techniques
Computing Small Pivot-Minors
Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts
Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs
A Most General Edge Elimination Polynomial
Approximation Algorithms for Geometric Intersection Graphs
Depth-First Search Algorithms for Augmentation Problems
Untangling Gaussian Mixtures
Toward a General Theory of Unicast-Based Multicast Communication
Finding k Disjoint Triangles in an Arbitrary Graph
Finding and Counting Small Induced Subgraphs Efficiently
On Minimum Connecting Transition Sets in Graphs
The Computational Complexity of the Minimum Weight Processor Assignment Problem
Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph
Monotonicity of Non-deterministic Graph Searching
An 'All Pairs Shortest Path' Distributed Algorithm Using 2n² Messages
Acyclic Choosability of Graphs with Small Maximum Degree
max-cut and Containment Relations in Graphs
Euler is Standing in Line
Metric Dimension Parameterized by Treewidth in Chordal Graphs
On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT
Diameter Determination on Restricted Graph Faminlies
Epsilon-Nets for Halfplanes
On Reduction Algorithms for Graphs with Small Treewidth
Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs
On the Use of Some Almost Sure Graph Properties
Drawing Planar Graphs with Few Geometric Primitives
Linearizable Special Cases of the Quadratic Shortest Path Problem
Bisections above Tight Lower Bounds
Flow Graph Grammars and Flow Graph Languages
Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes
Measuring Indifference: Unit Interval Vertex Deletion
Graphtheoretic Concepts in Computer Science, International Workshop, WG '86, Bernried, Germany, June 17-19, 1986, Proceedings
Implementing Data Structures on a Hypercube Multiprocessor, and Applications in Parallel Computational Geometry
Graph Rewriting and Automatic, Machine-Independent Program Optimization
The Minimum Degree Heuristic and the Minimal Triangulation Process
On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract)
Graph Algorithms = Iteration + Data Structures? The Structure of Graph Algorithms and a Corresponding Style of Programming
Parameterized Inapproximability of Independent Set in H-Free Graphs
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs
Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
On the Isomorphism of Graphs with Few P4s
Chordal Probe Graphs
Graph-Theoretic Concepts in Computer Science, International Workshop, WG '87, Kloster Banz/Staffelstein, Germany, June 29 - July 1, 1987, Proceedings
Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract)
Diagnosis of t/s-Diagnosable Systems
Listing Chordal Graphs and Interval Graphs
The Analysis of Search Trees: A Survey
Worst and Best Case Behaviour of an Approximate Graph Coloring Algorithm
From Path Graphs to Directed Path Graphs
Maximum Cardinality Search for Computing Minimal Triangulations
The Number of Bits Needed to Represent a Unit Disk Graph
On Protocols for Cake Cutting
The Grid File: A Data Structure to Support Proximity Queries on Spatial Objects
The Diameter of Connected Components of Random Graphs
Distance d -Domination Games
From Few Components to an Eulerian Graph by Adding Arcs
From a Circular-Arc Model to a Proper Circular-Arc Model
Odd Chromatic Number of Graph Classes
Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs
Characterisations and Linear-Time Recognition of Probe Cographs
Adding an Edge in a Cograph
Resource Allocation Problems in Multifiber WDM Tree Networks
Computing Branchwidth Via Efficient Triangulations and Blocks
Approximation Algorithms for Treewidth, Pathwidth, and Treedepth - A Short Survey
The Bounded Tree-Width Problem of Context-Free Graph Languages
A Graph Defining Language and its Implementation and Applications
A Language for Software Design and its Graphoriented Semantics
Construction of Deterministic Transition Graphs from Dynamic Integrity Constraints
Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024, Revised Selected Papers
Minimal Roman Dominating Functions: Extensions and Enumeration
On the Hardness of Allocating Frequencies for Hybrid Networks
Tight Bounds for Gomory-Hu-like Cut Counting
On the Expected Runtime and the Success Probability of Evolutionary Algorithms
Discrete Structures and Algorithms, Proceedings WG '79, Berlin, Germany
Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing
Probabilistic Graph Grammars
On the Complexity of Partial Order Properties
Critical and Anticritical Edges in Perfect Graphs
Approximating the Treewidth of AT-Free Graphs
Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More
Lexicographic Breadth First Search - A Survey
Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers
Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
Polynomial-Delay and Polynomial-Space Enumeration of Large Maximal Matchings
Memory Efficient Anonymous Graph Exploration
Scheduling with Incompatible Jobs
Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers
Partition Coefficients of Acyclic Graphs
Packing and Covering Immersion Models of Planar Subcubic Graphs
DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
Quasimonotone Graphs
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs
Using Programmed Graph Rewriting for the Formal Specification of a Configuration Management System
On Anti-stochastic Properties of Unlabeled Graphs
Some Supplementary Notes on the Graph Algorithmic Language GRAAL
Overview of New Approaches for Approximating TSP
Online Call Admission in Optical Networks with Larger Demands
On Devising Boolean Routing Schemes
An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs
A Combinatorial Rearrangement Problem with Implications to the Embedding of Graphs
A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators
Parameterized Edge Hamiltonicity
A Quartic Kernel for Pathwidth-One Vertex Deletion
Graphs with Bounded Induced Distance
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms
Graph Labelings Derived from Models in Distributed Computing
The Complexity of Approximating the Oriented Diameter of Chordal Graphs
An Improved Upper Bound on the Crossing Number of the Hypercube
CADULA - A Graph-Based Model for Monitoring CAD-Processes
An FPT Algorithm for Set Splitting
Cops and Robber - When Capturing Is Not Surrounding
Using Maximal Independent Sets to Solve Problems in Parallel
Testing Full Outer-2-planarity in Linear Time
Approximating Call-Scheduling Makespan in All-Optical Networks
Recognition of Unit Segment and Polyline Graphs is $\exists \mathbb {R} $-Complete
Uniquely Restricted Matchings and Edge Colorings
Coloring Powers of Graphs of Bounded Clique-Width
Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs
Vertex Coloring of Comparability+ k e and - k e Graphs
Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts
Vertex Partitioning of Crown-Free Interval Graphs
Incremental Hive Graph
Approximating Source Location and Star Survivable Network Problems
On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract)
Interval k-graphs : Recognition and Forbidden Obstructions
Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints
On the Complexity of Planar Covering of Small Graphs
Which Multi-peg Tower of Hanoi Problems Are Exponential?
Acyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract)
Fast Load Balancing in Cayley Graphs and in Circuits
On the Solution of Inequality Systems Relevant to IC-Layout
Complementation in T-perfect Graphs
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP
Face-Hitting Dominating Sets in Planar Graphs
Thickness and Colorability of Geometric Graphs
The Locus Approach
The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
∀∃ℝ-Completeness and Area-Universality
Improved Algorithms for Routing on Two-Dimensional Grids
The Longest Path Problem is Polynomial on Cocomparability Graphs
Almost Induced Matching: Linear Kernels and Parameterized Algorithms
Exact and Approximate k-planarity Testing for Maximal Graphs of Small Pathwidth
The Complexity of Bottleneck Labeled Graph Problems
Large Networks with Small Diameter
Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars
Recognizing Threshold Tolerance Graphs in O(n 2 ) Time
The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree
Optimality Program in Segment and String Graphs
Combinatorial Properties of Abstract Voronoi Diagrams
Hypertree Decompositions: Structure, Algorithms, and Applications
Parameterized Results on Acyclic Matchings with Implications for Related Problems
On Set Expansion Problems and the Small Set Expansion Conjecture
Generalized Coloring for Tree-like Graphs
Acyclic, Star, and Injective Colouring: Bounding the Diameter
The 3-Edge-Components and a Structural Description of All 3-Edge-Cuts in a Graph
Saturated Simple and 2-simple Topological Graphs with Few Edges
Vertex Cover Structural Parameterization Revisited
Beyond Knights and Knaves
A New Approach for Approximating Directed Rooted Networks
Fast Winning Strategies for the Attacker in Eternal Domination
Hydras: Directed Hypergraphs and Horn Formulas
Search in Indecomposable Graphs
Safe Reduction Rules for Weighted Treewidth
An Algorithm for Testing Planarity of Hierarchical Graphs
Extending Partial Representations of Trapezoid Graphs
Dynamic Algorithms for Graphs with Treewidth 2
On the Number of alpha -Orientations
Alternating Reachability and Integer Sum of Closed Alternating Trails - The 3rd Annual Uri N. Peled Memorial Lecture
Optimal Parallel Algorithms for Sparse Graphs
On the Estimate of a Directed Graph
Graph Searching in a Crime Wave
Parallel Algorithms for Treewidth Two
Optimizing Cost Flows by Modifying Arc Costs and Capacities
Inserting One Edge into a Simple Drawing Is Hard
Characterizations of Deque and Queue Graphs
Embeddings of Treelike Graphs into 2-Dimensional Meshes
Box-Rectangular Drawings of Plane Graphs
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded
Clique and Anticlique Partition of Graphs
Off-Line and On-Line Call-Scheduling in Stars and Trees
Backbone Colorings for Networks
Algorithmic Meta Theorems
Optimal Fault-Tolerant Routings for k -Connected Graphs with Smaller Routing Tables
Maximum Series-Parallel Subgraph
Searching for Faulty Leaves in Binary Trees
Maintenance of Transitive Closures and Transitive Reductions of Graphs
On the Number of Simple Cycles in Planar Graphs
Excluding Graphs as Immersions in Surface Embedded Graphs
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width
Network Discovery and Verification
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs
Mixing 3-Colourings in Bipartite Graphs
FPT Is Characterized by Useful Obstruction Sets
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs
Unbent Collections of Orthogonal Drawings
Multilevel Graph Grammars
An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time
Diametral Path Graphs
NP-Completness Results for Minimum Planar Spanners
Exact (Exponential) Algorithms for the Dominating Set Problem
Graph-Theoretical Methods to Construct Entity-Relationship Databases
Efficient Routes in Vector-Valued Graphs
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
The Complexity of Graph Problems for Succinctly Represented Graphs
Bandwidth of Split and Circular Permutation Graphs
Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
Traversing Directed Eulerian Mazes
Solutions for the Stable Roommates Problem with Payments
An Algorithmic Study of Switch Graphs
Nonplanar Graph Drawings with k Vertices per Face
Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version)
Color Refinement, Homomorphisms, and Hypergraphs
Graph Languages Defined by Systems of Forbidden Structures: A Survey
Planarization of Graphs Embedded on Surfaces
On Termination of Graph Rewriting
A Declarative Approach to Graph Based Modeling