A unified approach to domination problems on interval graphs
Information Processing Letters
Work-preserving emulations of fixed-connection networks
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Ordering problems approximated: single-processor scheduling and interval graph completion
Proceedings of the 18th international colloquium on Automata, languages and programming
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fast approximate graph partitioning algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Divide-and-conquer approximation algorithms via spreading metrics
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Pushing dependent data in clients-providers-servers systems
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Divide-and-conquer approximation algorithms via spreading metrics
Journal of the ACM (JACM)
A survey of graph layout problems
ACM Computing Surveys (CSUR)
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Random Geometric Problems on [0, 1]²
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Pushing dependent data in clients-providers-servers systems
Wireless Networks
Discovering temporal relations in molecular pathways using protein-protein interactions
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
The directed circular arrangement problem
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Experiments on the minimum linear arrangement problem
Journal of Experimental Algorithmics (JEA)
Circular arrangements and cyclic broadcast scheduling
Journal of Algorithms
Theoretical Computer Science - Latin American theorotical informatics
Improved lower and upper bounds for universal TSP in planar metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
l22 spreading metrics for vertex ordering problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Assign ranges in general ad-hoc networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
On the interval completion of chordal graphs
Discrete Applied Mathematics
Memory management optimization problems for integrated circuit simulators
Discrete Applied Mathematics
FPGA placement using space-filling curves: Theory meets practice
ACM Transactions on Embedded Computing Systems (TECS)
On the interval completion of chordal graphs
Discrete Applied Mathematics
The directed circular arrangement problem
ACM Transactions on Algorithms (TALG)
Eigenspaces from seriated graphs
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Machine learning with seriated graphs
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Assign ranges in general ad-hoc networks
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Optimal linear arrangement of interval graphs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |