Fast parallel algorithms for chordal graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
NC Algorithms for Recognizing Chordal Graphs and k Trees
IEEE Transactions on Computers
Incremental modular decomposition
Journal of the ACM (JACM)
Recognizing circle graphs in polynomial time
Journal of the ACM (JACM)
Covering orthogonal polygons with star polygons: the perfect graph approach
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Spill code minimization techniques for optimizing compliers
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Designing molecules and crystals by computer
IBM Systems Journal
Triangulating three-colored graphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
An O(n2) time algorithm for the 2-chain cover problem and related problems
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Compiler technology for parallel scientific computation
Scientific Programming
An Efficient Parallel Recognition Algorithm For Bipartite-Permutation Graphs
IEEE Transactions on Parallel and Distributed Systems
Energy minimization using multiple supply voltages
ISLPED '96 Proceedings of the 1996 international symposium on Low power electronics and design
A New Technique for Optimization Problems in Graph Theory
IEEE Transactions on Computers
A polynomial approximation algorithm for the minimum fill-in problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A study of isochronous channel reuse in DQDB metropolitan area networks
IEEE/ACM Transactions on Networking (TON)
Complexity of graph partition problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Allocation Techniques for Reducing BIST Area Overhead ofData Paths
Journal of Electronic Testing: Theory and Applications - special issue on high-level test synthesis
A Simple Approximation Algorithm for Two Problems in Circuit Design
IEEE Transactions on Computers
Faster and simpler algorithm for sorting signed permutations by reversals
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Mathematical Software (TOMS)
A Framework for High Level Estimations of Signal Processing VLSI Implementations
Journal of VLSI Signal Processing Systems
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Heuristic datapath allocation for multiple wordlength systems
Proceedings of the conference on Design, automation and test in Europe
An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs
Computational Optimization and Applications
Monotone bipartitioning problem in a planar point set with applications to VLSI
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Polynomial time recognition of P4-structure
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
On clique divergent graphs with linear growth
Discrete Mathematics
Optimization of Dynamic Hardware Reconfigurations
The Journal of Supercomputing
Letter graphs and well-quasi-order by induced subgraphs
Discrete Mathematics - Algebraic and topological methods in graph theory
A characterization for a set of partial partitions to define an X-tree
Discrete Mathematics
An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Generalized domination in chordal graphs
Nordic Journal of Computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
-Opt Population Training for Minimization of Open Stack Problem
SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Optimal Algorithm for a Special Point-Labeling Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Higher-Dimensional Packing with Order Constraints
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Separators Are as Simple as Cutsets
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs
ISAAC '98 Proceedings of the 9th 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
Minimum Edge Ranking Spanning Trees of Threshold Graphs
ISAAC '02 Proceedings of the 13th International Symposium 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
Listing All Potential Maximal Cliques of a Graph
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Parameterized Complexity of Finding Subgraphs with Hereditary Properties
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Maximum Red/Blue Interval Matching with Applications
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On Assigning Prefix Free Codes to the Vertices of a Graph
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A Notion of Cross-Perfect Bipartite Graphs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Edge Connectivity vs Vertex Connectivity in Chordal Graphs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Parallel Decomposition of Distance-Hereditary Graphs
ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
Crossing Number of Abstract Topological Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Visualization of Parallel Execution Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Complexity Classification of Some Edge Modification Problems
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Vertex Partitioning of Crown-Free Interval Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient Analysis of Graphs with Small Minimal Separators
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
On Claw-Free Asteroidal Triple-Free Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
On the Clique-Width of Perfect Graph Classes
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Triangulated Neighbourhoods in C4-Free Berge Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximating the Treewidth of AT-Free Graphs
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
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
Search in Indecomposable 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
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Finding All Common Intervals of k Permutations
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Pattern Matching Problems over 2-Interval Sets
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
SNPs Problems, Complexity, and Algorithms
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Approximate Distance Labeling Schemes
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Coupling Variable Fixing Algorithms for the Automatic Recording Problem
ESA '01 Proceedings of the 9th 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
Coloring Algorithms for Tolerance Graphs: Reasoning and Scheduling with Interval Constraints
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
An approximation result for the interval coloring problem on claw-free chordal graphs
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Coloring permutation graphs in parallel
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Perfect edge domination and efficient edge domination in graphs
Discrete Applied Mathematics
Hybrid backtracking bounded by tree-decomposition of constraint networks
Artificial Intelligence
On the layering problem of multilayer PWB wiring
DAC '81 Proceedings of the 18th Design Automation Conference
Automatic storage optimization
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
Parameterized complexity of vertex colouring
Discrete Applied Mathematics
Scheduling unitary task systems with zero-one communication delays for quasi-interval orders
Discrete Applied Mathematics
Discrete Applied Mathematics
Signal Processing - From signal processing theory to implementation
Fuzzy Sets and Systems - Special issue: Preference modelling and applications
A linear time recognition algorithm for proper interval graphs
Information Processing Letters
2-role assignments on triangulated graphs
Theoretical Computer Science
Optimal Replacement Is NP-Hardfor Nonstandard Caches
IEEE Transactions on Computers
Generating and characterizing the perfect elimination orderings of a chordal graph
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
A Graph-Based Approach to Power-Constrained SOC Test Scheduling
Journal of Electronic Testing: Theory and Applications
Finding hidden independent sets in interval graphs
Theoretical Computer Science
Tree spanners on chordal graphs: complexity and algorithms
Theoretical Computer Science
Optimal algorithm for a special point-labeling problem
Information Processing Letters
On Random Intersection Graphs: The Subgraph Problem
Combinatorics, Probability and Computing
Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
Journal of Parallel and Distributed Computing
EMAGEN: an efficient approach to multiple whole genome alignment
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
On the computational complexity of 2-interval pattern matching problems
Theoretical Computer Science
The list partition problem for graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A certifying algorithm for the consecutive-ones property
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Hole and antihole detection in graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Two tricks to triangulate chordal probe graphs in polynomial time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Automatic storage optimization
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Journal of Scheduling - Special issue: On-line algorithm part I
Scheduling with conflicts on bipartite and interval graphs
Journal of Scheduling - Special issue: On-line scheduling
Partitioning chordal graphs into independent sets and cliques
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
Discrete Applied Mathematics
Journal of Parallel and Distributed Computing
Thematic segmentation of meetings through document/speech alignment
Proceedings of the 12th annual ACM international conference on Multimedia
Using bi-modal alignment and clustering techniques for documents and speech thematic segmentations
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Networks on which hot-potato routing does not livelock
Distributed Computing
Representation and Detection of Deformable Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discrete Applied Mathematics
Representing a concept lattice by a graph
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Efficiently parallelizable problems on a class of decomposable graphs
Journal of Computer and System Sciences
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)
Computing the branchwidth of interval 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)
Distance labeling schemes for well-separated graph classes
Discrete Applied Mathematics
Path partition for graphs with special blocks
Discrete Applied Mathematics
The k-Track Assignment Problem on Partial Orders
Journal of Scheduling
Information Processing Letters
Journal of Combinatorial Theory Series B
Optimum and heuristic synthesis of multiple word-length architectures
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Leakage power optimization with dual-Vth library in high-level synthesis
Proceedings of the 42nd annual Design Automation Conference
Dotted interval graphs and high throughput genotyping
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Intelligent embedded agents
Polynomial and APX-hard cases of the individual haplotyping problem
Theoretical Computer Science - Pattern discovery in the post genome
Factoring boolean functions using graph partitioning
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
On finding the minimum test set of a BDD-based circuit
GLSVLSI '06 Proceedings of the 16th ACM Great Lakes symposium on VLSI
An exact method for graph coloring
Computers and Operations Research
Parameterized coloring problems on chordal graphs
Theoretical Computer Science - Parameterized and exact computation
Independent set of intersection graphs of convex objects in 2D
Computational Geometry: Theory and Applications
Orthogonal axial line placement in hole free collections of rectangles
SAICSIT '05 Proceedings of the 2005 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
Algorithms for clique-independent sets on subclasses of circular-arc graphs
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
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 combinatorial structure of chromatic scheduling polytopes
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
Approximating interval coloring and max-coloring in chordal graphs
Journal of Experimental Algorithmics (JEA)
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Discrete Applied Mathematics
List Set Colouring: Bounds and Algorithms
Combinatorics, Probability and Computing
An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs
The Journal of Supercomputing
Simple algorithms for partial point set pattern matching under rigid motion
Pattern Recognition
O(1) query time algorithm for all pairs shortest distances on permutation graphs
Discrete Applied Mathematics
Tangent circle graphs and 'orders'
Discrete Applied Mathematics
Recognizing and representing proper interval graphs in parallel using merging and sorting
Discrete Applied Mathematics
Minimum edge ranking spanning trees of split graphs
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Digraph matrix partitions and trigraph homomorphisms
Discrete Applied Mathematics
Procedure placement using temporal-ordering information: Dealing with code size expansion
Journal of Embedded Computing - Cache exploitation in embedded systems
Exact Algorithms for a Loading Problem with Bounded Clique Width
INFORMS Journal on Computing
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
Mathematics of Operations Research
Information Sciences: an International Journal
Journal of Discrete Algorithms
Linear structure of bipartite permutation graphs and the longest path problem
Information Processing Letters
Discrete Applied Mathematics
Note: MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
Theoretical Computer Science
Admission control with advance reservations in simple networks
Journal of Discrete Algorithms
Interval completion with few edges
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the Complexity of Register Coalescing
Proceedings of the International Symposium on Code Generation and Optimization
Scratchpad allocation for data aggregates in superperfect graphs
Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
On compact and efficient routing in certain graph classes
Discrete Applied Mathematics
The neighbour-scattering number can be computed in polynomial time for interval graphs
Computers & Mathematics with Applications
Journal of Combinatorial Theory Series B
NP-completeness results for some problems on subclasses of bipartite and chordal graphs
Theoretical Computer Science
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Theoretical Computer Science
Some approximation algorithms for the clique partition problem in weighted interval graphs
Theoretical Computer Science
On the parallel computation of the biconnected and strongly connected co-components of graphs
Discrete Applied Mathematics
Optimization problems in multiple-interval graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On testable properties in bounded degree graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Theoretical Computer Science
Subtree filament graphs are subtree overlap graphs
Information Processing Letters
Extracting constrained 2-interval subsets in 2-interval sets
Theoretical Computer Science
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
Discrete Applied Mathematics
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
On Periodic Register Need in Software Pipelining
IEEE Transactions on Computers
Maximizing throughput for optical burst switching networks
IEEE/ACM Transactions on Networking (TON)
Chain programming over difference constraints
Nordic Journal of Computing
The complete optimal stars-clustering-tree problem
Discrete Applied Mathematics
The k-edge intersection graphs of paths in a tree
Discrete Applied Mathematics
Equistable distance-hereditary graphs
Discrete Applied Mathematics
Batch processing with interval graph compatibilities between tasks
Discrete Applied Mathematics
Minimal comparability completions of arbitrary graphs
Discrete Applied Mathematics
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
Discrete Applied Mathematics
Geodeticity of the contour of chordal graphs
Discrete Applied Mathematics
A dichotomy for minimum cost graph homomorphisms
European Journal of Combinatorics
Minimal proper interval completions
Information Processing Letters
Partitioned probe comparability graphs
Theoretical Computer Science
Counting the number of independent sets in chordal graphs
Journal of Discrete Algorithms
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
ACM Transactions on Algorithms (TALG)
Cyclic Extensions of Order Varieties
Electronic Notes in Theoretical Computer Science (ENTCS)
The maximum edit distance from hereditary graph properties
Journal of Combinatorial Theory Series B
Fully dynamic algorithms for chordal graphs and split graphs
ACM Transactions on Algorithms (TALG)
An improvement on the complexity of factoring read-once Boolean functions
Discrete Applied Mathematics
Approximating the 2-interval pattern problem
Theoretical Computer Science
Approximation algorithm for coloring of dotted interval graphs
Information Processing Letters
Instruction Scheduling Across Control Flow
Scientific Programming
Sharp Bounds for the Oriented Diameters of Interval Graphs and 2-Connected Proper Interval Graphs
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Alternative Aggregates in Mizar
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
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
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
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
Routing to reduce the cost of wavelength conversion
Discrete Applied Mathematics
Advanced conservative and optimistic register coalescing
CASES '08 Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems
Aliased register allocation for straight-line programs is NP-complete
Theoretical Computer Science
A polynomial-time algorithm for the paired-domination problem on permutation graphs
Discrete Applied Mathematics
SecGRID: model for maintaining trust in large-scale dynamic environments
International Journal of Grid and Utility Computing
Minimal interval completion through graph exploration
Theoretical Computer Science
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
Approximating maximum weight K-colorable subgraphs in chordal graphs
Information Processing Letters
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Additive Spanners for Circle Graphs and Polygonal Graphs
Graph-Theoretic Concepts in Computer Science
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
Graph-Theoretic Concepts in Computer Science
From a Circular-Arc Model to a Proper Circular-Arc Model
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
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
A characterization of cycle-free unit probe interval graphs
Discrete Applied Mathematics
Hadwiger's conjecture for proper circular arc graphs
European Journal of Combinatorics
Linear-time certifying recognition algorithms and forbidden induced subgraphs
Nordic Journal of Computing
Offline and online aspects of defragmenting the module layout of a partially reconfigurable device
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
An Optimal Parallel Algorithm for Finding All Hinge Vertices of a Circular-Arc Graph
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Labeling bipartite permutation graphs with a condition at distance two
Discrete Applied Mathematics
Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
Discrete Applied Mathematics
Algorithmic aspects of a general modular decomposition theory
Discrete Applied Mathematics
Connected graph searching in chordal graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics
Discrete Applied Mathematics
A new approach for scheduling independent tasks with multiple modes
Journal of Heuristics
Approximating the Minimum Chain Completion problem
Information Processing Letters
Latency Constrained Aggregation in Chain Networks Admits a PTAS
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
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
Counting birds with wireless sensor networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
A simple algorithm to find Hamiltonian cycles in proper interval graphs
Information Processing Letters
SRF coloring: stream register file allocation via graph coloring
Journal of Computer Science and Technology
Edge-Intersection Graphs of k-Bend Paths in Grids
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Convex Recoloring Revisited: Complexity and Exact Algorithms
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
A Scheme for Computing Minimum Covers within Simple Regions
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A solution method for a car fleet management problem with maintenance constraints
Journal of Heuristics
Algorithms on Subtree Filament Graphs
Graph Theory, Computational Intelligence and Thought
On Distance-3 Matchings and Induced Matchings
Graph Theory, Computational Intelligence and Thought
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
Graph Theory, Computational Intelligence and Thought
Multiagent graph coloring: Pareto efficiency, fairness and individual rationality
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Hardness of edge-modification problems
Theoretical Computer Science
Distance paired-domination problems on subclasses of chordal graphs
Theoretical Computer Science
Resource temporal networks: definition and complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
About equivalent interval colorings of weighted graphs
Discrete Applied Mathematics
Acoustic counting algorithms for wireless sensor networks
Proceedings of the 6th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
A new characterization of matrices with the consecutive ones property
Discrete Applied Mathematics
Independent set of intersection graphs of convex objects in 2D
Computational Geometry: Theory and Applications
A linear-time algorithm for paired-domination problem in strongly chordal graphs
Information Processing Letters
Fast and accurate statistical criticality computation under process variations
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Random Generation and Enumeration of Bipartite Permutation Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Discrete Applied Mathematics
Factoring Boolean functions using graph partitioning
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)
Chordal co-gem-free and (P5,gem)-free graphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Computing the branchwidth of interval 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
Representing a concept lattice by a graph
Discrete Applied Mathematics
Efficient parallel recognition of cographs
Discrete Applied Mathematics
The Hamiltonian problem on distance-hereditary graphs
Discrete Applied Mathematics
On the interval completion of chordal graphs
Discrete Applied Mathematics
Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Discrete Applied Mathematics
Subclasses of k-trees: Characterization and recognition
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Information Processing Letters
Optimal register allocation for SSA-form programs in polynomial time
Information Processing Letters
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
Theoretical Computer Science
Approximating fractional hypertree width
ACM Transactions on Algorithms (TALG)
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms (TALG)
Finding hidden independent sets in interval graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Isoperimetric inequalities and the width parameters of graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
LCPC'06 Proceedings of the 19th international conference on Languages and compilers for parallel computing
RECOMB'05 Proceedings of the 2005 joint annual satellite conference on Systems biology and regulatory genomics
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Characterizing minimal interval completions towards better understanding of profile and pathwidth
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Treewidth and minimum fill-in of weakly triangulated graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Approximating bandwidth by mixing layouts of interval graphs
STACS'99 Proceedings of the 16th 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
A characterisation of the minimal triangulations of permutation graphs
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
Pathwidth of circular-arc graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Mixed search number and linear-width of interval and split graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Simple geometrical intersection graphs
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
A precedence constraint posting approach for the RCPSP with time lags and variable durations
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
On-line sensing task optimization for shared sensors
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Locating multiple gene duplications through reconciled trees
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time
Information Processing Letters
A graph theoretic approach to cache-conscious placement of data for direct mapped caches
Proceedings of the 2010 international symposium on Memory management
Sorting under partial information (without the ellipsoid algorithm)
Proceedings of the forty-second ACM symposium on Theory of computing
An output sensitive algorithm for computing a maximum independent set of a circle graph
Information Processing Letters
Approximate capacity subregions of uniform multihop wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Subexponential interval graphs generated by immigration–death processes
Probability in the Engineering and Informational Sciences
Adjacency matrices of probe interval graphs
Discrete Applied Mathematics
Algorithms and complexity for reasoning about time
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
A practical algorithm for finding optimal triangulations
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
On the parameterized complexity of some optimization problems related to multiple-interval graphs
Theoretical Computer Science
Fast distance multiplication of unit-Monge matrices
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
SEU-aware resource binding for modular redundancy based designs on FPGAs
Proceedings of the Conference on Design, Automation and Test in Europe
Improving scratchpad allocation with demand-driven data tiling
CASES '10 Proceedings of the 2010 international conference on Compilers, architectures and synthesis for embedded systems
Scratchpad memory allocation for data aggregates via interval coloring in superperfect graphs
ACM Transactions on Embedded Computing Systems (TECS)
Constraint based scheduling to deal with uncertain durations and self-timed execution
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Nectar: automatic management of data and computation in datacenters
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
The longest path problem is polynomial on cocomparability graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
From path graphs to directed path graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
On counting interval lengths of interval graphs
Discrete Applied Mathematics
An Efficient Algorithm for Partial Order Production
SIAM Journal on Computing
A New Intersection Model and Improved Algorithms for Tolerance Graphs
SIAM Journal on Discrete Mathematics
The LBFS Structure and Recognition of Interval Graphs
SIAM Journal on Discrete Mathematics
Independent Sets of Maximum Weight in Apple-Free Graphs
SIAM Journal on Discrete Mathematics
Separator orders in interval, cocomparability, and AT-free graphs
Discrete Applied Mathematics
Assembling 2D blocks into 3D chips
Proceedings of the 2011 international symposium on Physical design
ATMOS'04 Proceedings of the 4th international Dagstuhl, ATMOS conference on Algorithmic approaches for transportation modeling, optimization, and systems
A polynomial time algorithm for longest paths in biconvex graphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
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
Using topic salience and connotational drifts to detect candidates to semantic change
IWCS '11 Proceedings of the Ninth International Conference on Computational Semantics
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
Unique perfect phylogeny is NP-hard
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Algorithms for interval structures with applications
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Encoding watermark numbers as cographs using self-inverting permutations
Proceedings of the 12th International Conference on Computer Systems and Technologies
MCPR'11 Proceedings of the Third Mexican conference on Pattern recognition
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
Parameterized complexity of vertex deletion into perfect graph classes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Strongly chordal and chordal bipartite graphs are sandwich monotone
Journal of Combinatorial Optimization
Constructing perfect phylogenies and proper triangulations for three-state characters
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Efficiently solvable perfect phylogeny problems on binary and k-state data with missing values
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
The Recognition of Tolerance and Bounded Tolerance Graphs
SIAM Journal on Computing
Interval Graphs: Canonical Representations in Logspace
SIAM Journal on Computing
Vertex coloring of comparability+ke and -ke
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Finding intersection models of weakly chordal graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Graph theoretic models for reasoning about time
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Random generation and enumeration of bipartite permutation graphs
Journal of Discrete Algorithms
Oriented coloring: complexity and approximation
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Overcoming browser cookie churn with clustering
Proceedings of the fifth ACM international conference on Web search and data mining
Characterizations and linear time recognition of helly circular-arc graphs
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Laminar structure of ptolemaic graphs and its applications
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An intersection model for multitolerance graphs: efficient algorithms and hierarchy
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
ACM Transactions on Architecture and Code Optimization (TACO)
Reduced clique graphs of chordal graphs
European Journal of Combinatorics
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
An O(n2)-time algorithm for the minimal interval completion problem
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of 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)
Fixed-Parameter algorithms for cochromatic number and disjoint rectangle stabbing
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Distributed computing of efficient routing schemes in generalized chordal graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Harmonious coloring on subclasses of colinear graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Pathwidth and searching in parameterized threshold graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Certifying algorithms for the path cover and related problems on interval graphs
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II
A parameterized algorithm for chordal sandwich
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
ACM Transactions on Embedded Computing Systems (TECS)
Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Efficient algorithms for network localization using cores of underlying graphs
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
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
Collective additive tree spanners for circle graphs and polygonal graphs
Discrete Applied Mathematics
The recognition of triangle graphs
Theoretical Computer Science
Computing minimum geodetic sets of proper interval graphs
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Algorithmic complexity of finding cross-cycles in flag complexes
Proceedings of the twenty-eighth annual symposium on Computational geometry
Ordered coloring of grids and related graphs
Theoretical Computer Science
Distributed computing of efficient routing schemes in generalized chordal graphs
Theoretical Computer Science
Fair cost allocations under conflicts - a game-theoretic point of view -
Discrete Optimization
Irregular community discovery for cloud service improvement
The Journal of Supercomputing
Making life easier for firefighters
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Towards a comprehensive theory of conflict-tolerance graphs
Discrete Applied Mathematics
On L(2,1)-coloring split, chordal bipartite, and weakly chordal graphs
Discrete Applied Mathematics
Multiple encoding of a watermark number into reducible permutation graphs using cotrees
Proceedings of the 13th International Conference on Computer Systems and Technologies
Subgraph extraction and metaheuristics for the maximum clique problem
Journal of Heuristics
Computing all-pairs shortest paths by leveraging low treewidth
Journal of Artificial Intelligence Research
Towards data tiling for whole programs in scratchpad memory allocation
ACSAC'07 Proceedings of the 12th Asia-Pacific conference on Advances in Computer Systems Architecture
Aliased register allocation for straight-line programs is NP-complete
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
A decoupled local memory allocator
ACM Transactions on Architecture and Code Optimization (TACO) - Special Issue on High-Performance Embedded Architectures and Compilers
Revisiting neighborhood inverse consistency on binary CSPs
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
An exact algorithm for subset feedback vertex set on chordal graphs
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Reducing problems in unrooted tree compatibility to restricted triangulations of intersection graphs
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Optimizing a geomodeling domain specific language
SBLP'12 Proceedings of the 16th Brazilian conference on Programming Languages
Time Automaton: A visual mechanism for temporal querying
Journal of Visual Languages and Computing
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
Computing square roots of trivially perfect and threshold graphs
Discrete Applied Mathematics
Black-and-white threshold graphs
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Complexity of computing convex subgraphs in custom instruction synthesis
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Approximation algorithms for B 1-EPG graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
On dominating sets whose induced subgraphs have a bounded diameter
Discrete Applied Mathematics
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Algorithms for interval structures with applications
Theoretical Computer Science
Information and Computation
Equistable simplicial, very well-covered, and line graphs
Discrete Applied Mathematics
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
Journal of Combinatorial Optimization
Roman domination on strongly chordal graphs
Journal of Combinatorial Optimization
| Hi-index | 0.04 |