Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
The vertex separation number of a graph equals its path-width
Information Processing Letters
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Computer architecture (2nd ed.): a quantitative approach
Computer architecture (2nd ed.): a quantitative approach
All structured programs have small tree width and good register allocation
Information and Computation
Register allocation in structured programs
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Vertex Partitioning Problems on Partial k-Trees
SIAM Journal on Discrete Mathematics
Two Strikes Against Perfect Phylogeny
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Zero Knowledge and the Chromatic Number
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Listing all potential maximal cliques of a graph
Theoretical Computer Science
The Treewidth of Java Programs
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Iterative-free program analysis
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Tree-decompositions of small pathwidth
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Space-efficient construction variants of dynamic programming
Nordic Journal of Computing
A global progressive register allocator
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Derivation of algorithms for cutwidth and related graph layout parameters
Journal of Computer and System Sciences
Tree-decompositions of small pathwidth
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Register allocation after classical SSA elimination is NP-Complete
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Optimal register allocation in polynomial time
CC'13 Proceedings of the 22nd international conference on Compiler Construction
Optimal placement of bank selection instructions in polynomial time
Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems
The complexity of register allocation
Discrete Applied Mathematics
| Hi-index | 0.00 |