Complexity Classification of Some Edge Modification Problems
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Algorithms for optimal orientations of a unicyclic graph
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
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
An introduction to competition-reachability of a graph
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Minimal comparability completions of arbitrary graphs
Discrete Applied Mathematics
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Route-Enabling Graph Orientation Problems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Wheel-free deletion is W[2]-hard
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Improving scratchpad allocation with demand-driven data tiling
CASES '10 Proceedings of the 2010 international conference on Compilers, architectures and synthesis for embedded systems
Improved orientations of physical networks
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Exploiting bounded signal flow for graph orientation based on cause-effect pairs
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Approximation algorithms for orienting mixed graphs
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Making arbitrary graphs transitively orientable: minimal comparability completions
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Improved approximation for orienting mixed graphs
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Approximation algorithms for orienting mixed graphs
Theoretical Computer Science
| Hi-index | 0.89 |