Sciweavers

WADS
2001
Springer
143views Algorithms» more  WADS 2001»
14 years 2 months ago
An Approach for Mixed Upward Planarization
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
Markus Eiglsperger, Michael Kaufmann
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
14 years 2 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
14 years 2 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
WADS
2001
Springer
72views Algorithms» more  WADS 2001»
14 years 2 months ago
Seller-Focused Algorithms for Online Auctioning
Amitabha Bagchi, Amitabh Chaudhary, Rahul Garg, Mi...
WADS
2001
Springer
105views Algorithms» more  WADS 2001»
14 years 2 months ago
Secure Multi-party Computational Geometry
Mikhail J. Atallah, Wenliang Du
WADS
2001
Springer
137views Algorithms» more  WADS 2001»
14 years 2 months ago
Visual Ranking of Link Structures
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e...
Ulrik Brandes, Sabine Cornelsen
WADS
2001
Springer
63views Algorithms» more  WADS 2001»
14 years 2 months ago
When Can You Fold a Map?
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequenc...
Esther M. Arkin, Michael A. Bender, Erik D. Demain...
WADS
2001
Springer
126views Algorithms» more  WADS 2001»
14 years 2 months ago
On External-Memory Planar Depth First Search
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
14 years 2 months ago
Admission Control to Minimize Rejections
Avrim Blum, Adam Kalai, Jon M. Kleinberg