Sciweavers

Share
TAMC
2010
Springer
8 years 8 months ago
Revisiting the Minimum Breakpoint Linearization Problem
Laurent Bulteau, Guillaume Fertin, Irena Rusu
TAMC
2010
Springer
8 years 8 months ago
Different Approaches to Proof Systems
Olaf Beyersdorff, Sebastian Müller
TAMC
2010
Springer
8 years 8 months ago
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
Pinar Heggernes, Daniel Meister, Udi Rotics
TAMC
2010
Springer
8 years 8 months ago
Two-Layer Planarization Parameterized by Feedback Edge Set
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
Johannes Uhlmann, Mathias Weller
TAMC
2010
Springer
9 years 2 months ago
Binary De Bruijn Partial Words with One Hole
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity functi...
Francine Blanchet-Sadri, Jarett Schwartz, Slater S...
TAMC
2010
Springer
9 years 3 months ago
Community Structure in Large Complex Networks
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
Liaoruo Wang, John E. Hopcroft
TAMC
2010
Springer
9 years 3 months ago
Incremental List Coloring of Graphs, Parameterized by Conservation
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
Sepp Hartung, Rolf Niedermeier
TAMC
2010
Springer
9 years 3 months ago
The Max k-Cut Game and Its Strong Equilibria
An instance of the max k−cut game is an edge weighted graph. Every
Laurent Gourvès, Jérôme Monnot
TAMC
2010
Springer
9 years 3 months ago
A Note on the Testability of Ramsey's Class
Abstract. In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a s...
Charles Jordan, Thomas Zeugmann
books