Sciweavers

WG
2007
Springer
14 years 1 months ago
Pathwidth of Circular-Arc Graphs
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...
Karol Suchan, Ioan Todinca
WG
2007
Springer
14 years 1 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
WG
2007
Springer
14 years 1 months ago
Characterisations and Linear-Time Recognition of Probe Cographs
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
Van Bang Le, H. N. de Ridder
FUN
2007
Springer
87views Algorithms» more  FUN 2007»
14 years 1 months ago
Knitting for Fun: A Recursive Sweater
In this paper we investigate the relations between knitting and computer science. We show that the two disciplines share many concepts. Computer science, in particular algorithm th...
Anna Bernasconi, Chiara Bodei, Linda Pagli
CSEE
2007
Springer
14 years 1 months ago
Increased Retention of Early Computer Science and Software Engineering Students Using Pair Programming
An important problem faced by many Computer Science and Software Engineering programs is declining enrollment. In an effort to reverse that trend at Mississippi State University, ...
Jeffrey C. Carver, Lisa Henderson, Lulu He, Julia ...
TIME
2007
IEEE
14 years 1 months ago
Towards a Science of Temporal Databases
Computer science has long been considered to emphasize three distinct perspectives: mathematics, science, and engineering. While the database field has some very strong mathemati...
Richard T. Snodgrass
LICS
2007
IEEE
14 years 1 months ago
Pi-Calculus in Logical Form
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...
Marcello M. Bonsangue, Alexander Kurz
LICS
2007
IEEE
14 years 1 months ago
A Robust Class of Context-Sensitive Languages
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
LICS
2007
IEEE
14 years 1 months ago
Higher-Order Matching, Games and Automata
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
Colin Stirling