Sciweavers

13306 search results - page 450 / 2662
» Theoretical Computer Science
Sort
View
WG
2009
Springer
16 years 2 months ago
A New Intersection Model and Improved Algorithms for Tolerance Graphs
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This class of graphs, which generalizes...
George B. Mertzios, Ignasi Sau, Shmuel Zaks
ACSC
2008
IEEE
16 years 2 months ago
Informatics olympiads: challenges in programming and algorithm design
The International Olympiad in Informatics is a worldwide contest for high school students, with a strong focus on creativity and ingenuity in algorithm design. Here we describe th...
Benjamin A. Burton
ACSC
2005
IEEE
16 years 1 months ago
Modelling and Measuring Collaborative Software Engineering
Collaborative Software Engineering (CSE) supports the fine-grained real-time development of software by teams of developers located anywhere on the Internet. In this paper we des...
Carl Cook, Neville Churcher
WG
2005
Springer
16 years 1 months ago
Channel Assignment and Improper Choosability of Graphs
Abstract. We model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average de...
Frédéric Havet, Jean-Sébastie...
WG
2005
Springer
16 years 1 months ago
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broa...
Pinar Heggernes, Daniel Lokshtanov