Sciweavers

393 search results - page 10 / 79
» The LCA Problem Revisited
Sort
View
GD
2003
Springer
14 years 19 days ago
Fixed Parameter Algorithms for one-sided crossing minimization Revisited
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
Vida Dujmovic, Henning Fernau, Michael Kaufmann
APAL
2004
81views more  APAL 2004»
13 years 7 months ago
The complexity of first-order and monadic second-order logic revisited
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower...
Markus Frick, Martin Grohe
JOT
2007
104views more  JOT 2007»
13 years 7 months ago
Common Requirements Problems, Their Negative Consequences, and the Industry Best Practices to Help Solve Them
In this column, I summarize the 12 worst of the most common requirements engineering problems I have observed over many years working on and with real projects as a requirements e...
Donald Firesmith
WEA
2010
Springer
300views Algorithms» more  WEA 2010»
14 years 2 months ago
Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
Charles Delort, Olivier Spanjaard
DAM
2008
88views more  DAM 2008»
13 years 7 months ago
On the asymmetric representatives formulation for the vertex coloring problem
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
Manoel B. Campêlo, Victor A. Campos, Ricardo...