Sciweavers

ISAAC
2007
Springer
92views Algorithms» more  ISAAC 2007»
13 years 10 months ago
In-Place Algorithm for Image Rotation
Tetsuo Asano, Shinnya Bitou, Mitsuo Motoki, Nobuak...
ISAAC
2007
Springer
122views Algorithms» more  ISAAC 2007»
13 years 10 months ago
Compressing Spatio-temporal Trajectories
Trajectory data is becoming increasingly available and the size of the trajectories is getting larger. In this paper we study the problem of compressing spatio-temporal trajectorie...
Joachim Gudmundsson, Jyrki Katajainen, Damian Merr...
ISAAC
2007
Springer
91views Algorithms» more  ISAAC 2007»
13 years 10 months ago
2-Stage Fault Tolerant Interval Group Testing
Ferdinando Cicalese, José Augusto Amgarten ...
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
13 years 10 months ago
Manipulation in Games
This paper studies to which extent the social welfare of a game can be influenced by an interested third party within economic reason, i.e., by taking the implementation cost into...
Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schm...
ISAAC
2007
Springer
89views Algorithms» more  ISAAC 2007»
13 years 10 months ago
Finding Popular Places
Widespread availability of location aware devices (such as GPS receivers) promotes capture of detailed movement trajectories of people, animals, vehicles and other moving objects, ...
Marc Benkert, Bojan Djordjevic, Joachim Gudmundsso...
ISAAC
2007
Springer
113views Algorithms» more  ISAAC 2007»
13 years 10 months ago
The Parameterized Complexity of the Unique Coverage Problem
Hannes Moser, Venkatesh Raman, Somnath Sikdar
ISAAC
2007
Springer
111views Algorithms» more  ISAAC 2007»
13 years 10 months ago
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
Jiong Guo
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
13 years 10 months ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar