Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On universally easy classes for NP-complete problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A software engineering perspective on algorithmics
ACM Computing Surveys (CSUR)
Information Processing Letters
Approximating minimum cocolorings
Information Processing Letters
Minimum feedback vertex set and acyclic coloring
Information Processing Letters
On claw-free asteroidal triple-free graphs
Discrete Applied Mathematics
European Journal of Combinatorics
Certifying algorithms for recognizing interval graphs and permutation graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Scalar Aggregation in FD-Inconsistent Databases
ICDT '01 Proceedings of the 8th International Conference on Database Theory
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Tree Decompositions with Small Cost
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Computing Phylogenetic Roots with Bounded Degrees and Errors
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
LexBFS-Ordering in Asteroidal Triple-Free Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Efficient Minus and Signed Domination in Graphs
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Phylogenetic k-Root and Steiner k-Root
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Tree Decomposition Based Algorithms for Domination-like Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Space Efficient Algorithms for Series-Parallel Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Complexity Classification of Some Edge Modification Problems
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Networks with Small Stretch Number
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
On the Domination Search Number
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Split-Perfect Graphs: Characterizations and Algorithmic Use
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
(k, +)-Distance-Hereditary Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Connected and Loosely Connected List Homomorphisms
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
On the Recognition of P4-Comparability Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
The Complexity of Approximating the Oriented Diameter of Chordal Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
An Additive Stretched Routing Scheme for Chordal Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
New Graph Classes of Bounded Clique-Width
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Partially-Ordered Knapsack and Applications to Scheduling
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Approximating Minimum Cocolourings
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On Robust Algorithms for the Maximum Weight Stable Set Problem
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On the Clique Problem in Intersection Graphs of Ellipses
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Intersection graphs of maximal hypercubes
European Journal of Combinatorics
Computing
Ρ-Queries: enabling querying for semantic associations on the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
Structure and stability number of chair-, co-P- and gem-free graphs revisited
Information Processing Letters
Perfect edge domination and efficient edge domination in graphs
Discrete Applied Mathematics
On the k-path partition of graphs
Theoretical Computer Science
Finding a maximum induced matching in weakly chordal graphs
Discrete Mathematics - Special issue: The 18th British combinatorial conference
On the domination search number
Discrete Applied Mathematics
Discrete Applied Mathematics
Efficient minus and signed domination in graphs
Theoretical Computer Science
Recognition of some perfectly orderable graph classes
Discrete Applied Mathematics
Discrete Mathematics
Note: on universally easy classes for NP-complete problems
Theoretical Computer Science
On linear and circular structure of (claw, net)-free graphs
Discrete Applied Mathematics
On variations of P4-sparse graphs
Discrete Applied Mathematics
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
The complexity of the locally connected spanning tree problem
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Maximum independent set and maximum clique algorithms for overlap graphs
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
On the structure and stability number of P5- and co-chair-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Induced matchings in asteroidal triple-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Algorithms for graphs with small octopus
Discrete Applied Mathematics
Some optimization problems on weak-bisplit graphs
Information Processing Letters
Compact and localized distributed data structures
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Tree spanners on chordal graphs: complexity and algorithms
Theoretical Computer Science
(k, +)-distance-hereditary graphs
Journal of Discrete Algorithms
Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
Journal of Parallel and Distributed Computing
A linear algorithm for the Hamiltonian completion number of the line graph of a cactus
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
A fully dynamic algorithm for modular decomposition and recognition of cographs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
The obnoxious center problem on weighted cactus graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
Information Processing Letters
A certifying algorithm for the consecutive-ones property
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
On simplicial and co-simplicial vertices in graphs
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Recognizing quasi-triangulated graphs
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
L(h,1)-labeling subclasses of planar graphs
Journal of Parallel and Distributed Computing
The Brown--Colbourn conjecture on zeros of reliability polynomials is false
Journal of Combinatorial Theory Series B
PAC-learning bounded tree-width graphical models
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Discrete Applied Mathematics
Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5 - Volume 06
Tree decompositions with small cost
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Linear-time modular decomposition of directed graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Chordal co-gem-free and (P5,gem)-freegraphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Strong branchwidth and local transversals
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Discrete Applied Mathematics
Dotted interval graphs and high throughput genotyping
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Covering planar graphs with forests
Journal of Combinatorial Theory Series B
The complexity of modular decomposition of boolean functions
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
On the relationship between NLC-width and linear NLC-width
Theoretical Computer Science
Subclasses of k-trees: characterization and recognition
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Discrete Applied Mathematics - Special issue: Efficient algorithms
Distance-hereditary graphs are clique-perfect
Discrete Applied Mathematics
Structure and linear time recognition of 3-leaf powers
Information Processing Letters
Computing bounded-degree phylogenetic roots of disconnected graphs
Journal of Algorithms
Complexity aspects of generalized Helly hypergraphs
Information Processing Letters
Improved bottleneck domination algorithms
Discrete Applied Mathematics
On the structure of certain intersection graphs
Information Processing Letters
Space efficient algorithms for directed series-parallel graphs
Journal of Algorithms
NP-completeness results for edge modification problems
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
On the interval completion of chordal graphs
Discrete Applied Mathematics
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
Theoretical Computer Science
Discrete Applied Mathematics - Special issue: Max-algebra
Efficient parallel recognition of cographs
Discrete Applied Mathematics - Special issue: Max-algebra
Computing phylogenetic roots with bounded degrees and errors is NP-complete
Theoretical Computer Science - Computing and combinatorics
Strictly chordal graphs are leaf powers
Journal of Discrete Algorithms
A 3-approximation for the pathwidth of Halin graphs
Journal of Discrete Algorithms
An optimal parallel solution for the path cover problem on P4-sparse graphs
Journal of Parallel and Distributed Computing
Discrete Applied Mathematics
Partially ordered knapsack and applications to scheduling
Discrete Applied Mathematics
Characterization of P6-free graphs
Discrete Applied Mathematics
Efficient algorithms for the minimum connected domination on trapezoid graphs
Information Sciences: an International Journal
Faster recognition of clique-Helly and hereditary clique-Helly graphs
Information Processing Letters
Linear structure of bipartite permutation graphs and the longest path problem
Information Processing Letters
Discrete Applied Mathematics
Universal augmentation schemes for network navigability: overcoming the √n-barrier
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics
Minimum transversals in posi-modular systems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Journal of Combinatorial Theory Series B
Note: The induced matching and chain subgraph cover problems for convex bipartite graphs
Theoretical Computer Science
Note: Note on maximal split-stable subgraphs
Discrete Applied Mathematics
Optimization problems in multiple-interval graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Subtree filament graphs are subtree overlap graphs
Information Processing Letters
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Discrete Applied Mathematics
Note: The harmonious coloring problem is NP-complete for interval and permutation graphs
Discrete Applied Mathematics
Note: On the 2-rainbow domination in graphs
Discrete Applied Mathematics
Decomposable graphs and definitions with no quantifier alternation
European Journal of Combinatorics
Characterization and recognition of generalized clique-Helly graphs
Discrete Applied Mathematics
Managing highly correlated semi-structured data: architectural aspects of a digital archive
Proceedings of the ACM first Ph.D. workshop in CIKM
Rectangular layouts and contact graphs
ACM Transactions on Algorithms (TALG)
Polynomial algorithms for protein similarity search for restricted mRNA structures
Information Processing Letters
Equistable distance-hereditary graphs
Discrete Applied Mathematics
Simple permutations: Decidability and unavoidable substructures
Theoretical Computer Science
Mutual exclusion scheduling with interval graphs or related classes. Part II
Discrete Applied Mathematics
Steiner distance and convexity in graphs
European Journal of Combinatorics
Counting the number of independent sets in chordal graphs
Journal of Discrete Algorithms
Graphical Methods for Efficient Likelihood Inference in Gaussian Covariance Models
The Journal of Machine Learning Research
The 0-1 inverse maximum stable set problem
Discrete Applied Mathematics
Probe Matrix Problems: Totally Balanced Matrices
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Characterizing and Computing Minimal Cograph Completions
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Mixed Search Number of Permutation Graphs
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Damaged BZip Files Are Difficult to Repair
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A New Characterization of P6-Free Graphs
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Note: An improved algorithm for the longest induced path problem on k-chordal graphs
Discrete Applied Mathematics
Structure and linear-time recognition of 4-leaf powers
ACM Transactions on Algorithms (TALG)
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Efficient algorithms for Roman domination on some classes of graphs
Discrete Applied Mathematics
Closest 4-leaf power is fixed-parameter tractable
Discrete Applied Mathematics
Disjoint paths in symmetric digraphs
Discrete Applied Mathematics
Note: On the inapproximability of independent domination in 2P3-free perfect graphs
Theoretical Computer Science
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
Graph-Theoretic Concepts in Computer Science
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Random Generation and Enumeration of Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Linear-time certifying recognition algorithms and forbidden induced subgraphs
Nordic Journal of Computing
Cage-amalgamation graphs, a common generalization of chordal and median graphs
European Journal of Combinatorics
Universal augmentation schemes for network navigability
Theoretical Computer Science
The complexity of clique graph recognition
Theoretical Computer Science
Discrete Applied Mathematics
The clique-separator graph for chordal graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Algorithmic aspects of a general modular decomposition theory
Discrete Applied Mathematics
Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
INFORMS Journal on Computing
On the complexity of recognizing directed path families
Discrete Applied Mathematics
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Edge Search Number of Cographs in Linear Time
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
CFI Construction and Balanced Graphs
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Pathwidth is NP-Hard for Weighted Trees
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
Discrete Applied Mathematics
On the complexity of signed and minus total domination in graphs
Information Processing Letters
On Distance-3 Matchings and Induced Matchings
Graph Theory, Computational Intelligence and Thought
Graph Theory, Computational Intelligence and Thought
On the complexity of some subgraph problems
Discrete Applied Mathematics
Exponential time algorithms for the minimum dominating set problem on some graph classes
ACM Transactions on Algorithms (TALG)
A mobile tourist assistance and recommendation system based on complex networks
Proceedings of the 1st ACM international workshop on Complex networks meet information & knowledge management
Journal of Discrete Algorithms
Characterising (k,l)-leaf powers
Discrete Applied Mathematics
Route-Enabling Graph Orientation Problems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Random Generation and Enumeration of Bipartite Permutation Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
The complexity of modular decomposition of Boolean functions
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Tree decompositions with small cost
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Linear-time modular decomposition of directed graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Strong branchwidth and local transversals
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Discrete Applied Mathematics
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics
Maximum independent set and maximum clique algorithms for overlap graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Efficient parallel recognition of cographs
Discrete Applied Mathematics
On simplicial and co-simplicial vertices in graphs
Discrete Applied Mathematics
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics
Distance-hereditary graphs are clique-perfect
Discrete Applied Mathematics
On the interval completion of chordal graphs
Discrete Applied Mathematics
Subclasses of k-trees: Characterization and recognition
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Discrete Applied Mathematics - Special issue: Efficient algorithms
Local temporal logic is expressively complete for cograph dependence alphabets
Information and Computation
Structure and linear time recognition of 3-leaf powers
Information Processing Letters
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Computing bounded-degree phylogenetic roots of disconnected graphs
Journal of Algorithms
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms (TALG)
The Steiner Forest Problem revisited
Journal of Discrete Algorithms
Hardness and approximation of minimum distortion embeddings
Information Processing Letters
Logarithmic keying of communication networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
A new approach to graph recognition and applications to distance-hereditary graphs
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
An O(nm)-time certifying algorithm for recognizing HHD-free graphs
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Recognizing bipartite tolerance graphs in linear time
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
The clique-width of tree-power and leaf-power graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Complexity and approximation results for the connected vertex cover problem
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Characterisations and linear-time recognition of probe cographs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Proper Helly circular-arc graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Unifying two graph decompositions with modular decomposition
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Graphs of linear clique-width at most 3
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Ptolemaic graphs and interval graphs are leaf powers
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Collective additive tree spanners of homogeneously orderable graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Theoretical Computer Science
Incremental routing and scheduling in wireless grids
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
The clique operator on circular-arc graphs
Discrete Applied Mathematics
On the multimessage capacity region for undirected ring networks
IEEE Transactions on Information Theory
On the regularity of circular splicing languages: a survey and new developments
Natural Computing: an international journal
Enumeration of the perfect sequences of a chordal graph
Theoretical Computer Science
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Probe distance-hereditary graphs
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Improved approximability and non-approximability results for graph diameter decreasing problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Journal of Computer and System Sciences
Farey graphs as models for complex networks
Theoretical Computer Science
The longest path problem is polynomial on cocomparability graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Computing the cutwidth of bipartite permutation graphs in linear time
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Measuring indifference: unit interval vertex deletion
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
New min-max theorems for weakly chordal and dually hordal graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
A novel branching strategy for parameterized graph modification problems
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
On graphs without a C4 or a diamond
Discrete Applied Mathematics
On the Complexity of Finding a Sun in a Graph
SIAM Journal on Discrete Mathematics
Independent Sets of Maximum Weight in Apple-Free Graphs
SIAM Journal on Discrete Mathematics
A polynomial time algorithm for longest paths in biconvex graphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Theoretical Computer Science
Note: Recognizing Helly Edge-Path-Tree graphs and their clique graphs
Discrete Applied Mathematics
Equistable graphs, general partition graphs, triangle graphs, and graph products
Discrete Applied Mathematics
Computing role assignments of proper interval graphs in polynomial time
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Journal of Combinatorial Theory Series B
Extending partial representations of interval graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Hardness results and an exact exponential algorithm for the spanning tree congestion problem
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Edge contractions in subclasses of chordal graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Jump number of two-directional orthogonal ray graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Satisfiability of acyclic and almost acyclic CNF formulas (II)
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
On the rainbow connectivity of graphs: complexity and FPT algorithms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Bandwidth of convex bipartite graphs and related graphs
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Contracting a chordal graph to a split graph or a tree
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Data reduction for graph coloring problems
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Parameterized complexity of vertex deletion into perfect graph classes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Enumeration of minimal dominating sets and variants
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Theoretical Computer Science
Minimum d-blockers and d-transversals in graphs
Journal of Combinatorial Optimization
Navigating in a Graph by Aid of Its Spanning Tree Metric
SIAM Journal on Discrete Mathematics
Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices
SIAM Journal on Scientific Computing
The Recognition of Tolerance and Bounded Tolerance Graphs
SIAM Journal on Computing
Interval Graphs: Canonical Representations in Logspace
SIAM Journal on Computing
Properties of markovian subgraphs of a decomposable graph
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Distributed resource allocation for stream data processing
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
A fully dynamic algorithm for the recognition of P4-sparse graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Clique graph recognition is NP-complete
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Exponential time algorithms for the minimum dominating set problem on some graph classes
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Generalized powers of graphs and their algorithmic use
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Maximum-Size subgraphs of p4-sparse graphs admitting a perfect matching
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Recognition of probe cographs and partitioned probe distance hereditary graphs
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Drawing graphs using modular decomposition
GD'05 Proceedings of the 13th international conference on Graph Drawing
Maximum Weight Independent Sets in hole- and co-chair-free graphs
Information Processing Letters
On weighted efficient total domination
Journal of Discrete Algorithms
Random generation and enumeration of bipartite permutation graphs
Journal of Discrete Algorithms
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
Discrete Applied Mathematics
Improved approximability and non-approximability results for graph diameter decreasing problems
Theoretical Computer Science
Bounded degree closest k-tree power is NP-complete
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On the recognition of probe graphs of some self-complementary classes of perfect graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Counting hexagonal patches and independent sets in circle graphs
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Approximating maximum diameter-bounded subgraphs
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Efficient edge domination on hole-free graphs in polynomial time
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Laminar structure of ptolemaic graphs and its applications
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
5-th phylogenetic root construction for strictly chordal graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Localized and compact data-structure for comparability graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On clique separators, nearly chordal graphs, and the maximum weight stable set problem
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Optimal linear arrangement of interval graphs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On the computational complexity of minimal-change integrity maintenance in relational databases
Inconsistency Tolerance
The PIGs full monty – a floor show of minimal separators
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Roman domination over some graph classes
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Algorithms based on the treewidth of sparse graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Linear-time counting algorithms for independent sets in chordal graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Faster dynamic algorithms for chordal graphs, and an application to phylogeny
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Strong colorings of hypergraphs
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
A dynamic implicit adjacency labelling scheme for line graphs
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Error compensation in leaf root problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On compact and efficient routing in certain graph classes
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Canonical data structure for interval probe graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Efficient algorithms for the longest path problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
ACM Transactions on Algorithms (TALG)
Improved algorithms and complexity results for power domination in graphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Clique-width for four-vertex forbidden subgraphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
New applications of clique separator decomposition for the maximum weight stable set problem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Fixed-Parameter algorithms for cochromatic number and disjoint rectangle stabbing
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Lexicographic breadth first search – a survey
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Recognizing HHD-free and welsh-powell opposition graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Computing bounded-degree phylogenetic roots of disconnected graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Characterization and recognition of generalized clique-helly graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Edge search number of cographs
Discrete Applied Mathematics
Algorithms on graphs with small dominating targets
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Reconstruction algorithm for permutation graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Harmonious coloring on subclasses of colinear graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Bandwidth of convex bipartite graphs and related graphs
Information Processing Letters
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Graph classes with structured neighborhoods and algorithmic applications
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Maximum independent set in 2-direction outersegment graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Approximability of the path-distance-width for AT-free graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Bounding the number of reduced trees, cographs, and series-parallel graphs by compression
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Computing role assignments of proper interval graphs in polynomial time
Journal of Discrete Algorithms
Restricted vertex multicut on permutation graphs
Discrete Applied Mathematics
A fully dynamic algorithm for the recognition of P4-sparse graphs
Theoretical Computer Science
The recognition of triangle graphs
Theoretical Computer Science
Efficient total domination in digraphs
Journal of Discrete Algorithms
Computing minimum geodetic sets of proper interval graphs
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Approximability results for the maximum and minimum maximal induced matching problems
Discrete Optimization
Note: Computing maximum stable sets for distance-hereditary graphs
Discrete Optimization
An O(nm)-time certifying algorithm for recognizing HHD-free graphs
Theoretical Computer Science
Routing equal-size messages on a slotted ring
Journal of Scheduling
A peep through the looking glass: articulation points in lattices
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Making life easier for firefighters
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Graph orientations optimizing the number of light or heavy vertices
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Eccentric counts, connectivity and chordality
Information Processing Letters
Information Processing Letters
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Geometric intersection graph: do short cycles help?
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
A polynomial kernel for proper interval vertex deletion
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
European Journal of Combinatorics
Polar permutation graphs are polynomial-time recognisable
European Journal of Combinatorics
Recognition of probe distance-hereditary graphs
Discrete Applied Mathematics
Exploring pairwise compatibility graphs
Theoretical Computer Science
Maximum weight independent sets in (P6,co-banner)-free graphs
Information Processing Letters
Cycle transversals in perfect graphs and cographs
Theoretical Computer Science
Triangulation and clique separator decomposition of claw-free graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Integral mixed unit interval graphs
Discrete Applied Mathematics
Black-and-white threshold graphs
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Satisfiability of acyclic and almost acyclic CNF formulas
Theoretical Computer Science
Computing square roots of trivially perfect and threshold graphs
Discrete Applied Mathematics
Which distance-hereditary graphs are cover-incomparability graphs?
Discrete Applied Mathematics
Computing a minimum outer-connected dominating set for the class of chordal graphs
Information Processing Letters
Complexity of finding maximum regular induced subgraphs with prescribed degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Feedback vertex sets on restricted bipartite graphs
Theoretical Computer Science
Data reduction for graph coloring problems
Information and Computation
Information and Computation
Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets
Journal of Automated Reasoning
Preprocessing subgraph and minor problems: When does a small vertex cover help?
Journal of Computer and System Sciences
On atomic structure of P5-free subclasses and Maximum Weight Independent Set problem
Theoretical Computer Science
(Nearly-)tight bounds on the contiguity and linearity of cographs
Theoretical Computer Science
On asteroidal sets in chordal graphs
Discrete Applied Mathematics
Distance-$$d$$ independent set problems for bipartite and chordal graphs
Journal of Combinatorial Optimization
Approximating the path-distance-width for AT-free graphs and graphs in related classes
Discrete Applied Mathematics
Residual Closeness in Cycles and Related Networks
Fundamenta Informaticae
| Hi-index | 0.09 |