Sciweavers

170 search results - page 3 / 34
» On Metro-Line Crossing Minimization
Sort
View
GD
2008
Springer
14 years 10 months ago
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
Evmorfia N. Argyriou, Michael A. Bekos, Michael Ka...
DAM
2010
56views more  DAM 2010»
14 years 9 months ago
Crossing minimization in extended level drawings of graphs
Christian Bachmaier, Hedi Buchner, Michael Forster...
IJON
2006
40views more  IJON 2006»
14 years 9 months ago
A new biclustering technique based on crossing minimization
Ahsan Abdullah, Amir Hussain
IWOCA
2010
Springer
229views Algorithms» more  IWOCA 2010»
14 years 4 months ago
Ranking and Drawing in Subexponential Time
In this paper we obtain parameterized subexponential-time algorithms for p-Kemeny Aggregation (p-KAGG) -- a problem in social choice theory -- and for p-One-Sided Crossing Minimiza...
Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov,...
COMSWARE
2006
IEEE
15 years 1 months ago
Architecting protocol stack optimizations on mobile devices
Applications using traditional protocol stacks (e.g TCP/IP) from wired networks do not function efficiently in mobile wireless scenarios. This is primarily due to the layered archi...
Vijay T. Raisinghani, Sridhar Iyer