Sciweavers

DM
2008
82views more  DM 2008»
13 years 11 months ago
Problems and results in extremal combinatorics - II
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
Noga Alon
EOR
2010
81views more  EOR 2010»
13 years 11 months ago
Dynamic pickup and delivery problems
In the last decade, there has been an increasing body of research in dynamic vehicle routing problems. This article surveys the subclass of those problems called dynamic pickup an...
Gerardo Berbeglia, Jean-François Cordeau, G...
DM
2008
88views more  DM 2008»
13 years 11 months ago
Packing triangles in low degree graphs and indifference graphs
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
Gordana Manic, Yoshiko Wakabayashi
EJC
2010
13 years 11 months ago
Problems from CGCS Luminy, May 2007
Most of these problems were presented at the conference on Combinatorics, Geometry and Computer Science, held at CIRM, Luminy, 2-4 May 2007. I have added one problem on a similar ...
Peter J. Cameron
DAM
2008
68views more  DAM 2008»
13 years 11 months ago
Parameterized algorithmics for linear arrangement problems
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for th...
Henning Fernau
CORR
2008
Springer
72views Education» more  CORR 2008»
13 years 11 months ago
Inferring Company Structure from Limited Available Information
: In this paper we present several algorithmic techniques for inferring the structure of a company when only a limited amount of information is available. We consider problems with...
Mugurel Ionut Andreica, Angela Andreica, Romulus A...
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 11 months ago
Explicit Learning: an Effort towards Human Scheduling Algorithms
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Jingpeng Li, Uwe Aickelin
CORR
2008
Springer
63views Education» more  CORR 2008»
13 years 11 months ago
Testing Statistical Hypotheses About Ergodic Processes
We propose a method for statistical analysis of time series, that allows us to obtain solutions to some classical problems of mathematical statistics under the only assumption tha...
Daniil Ryabko, Boris Ryabko
CORR
2008
Springer
71views Education» more  CORR 2008»
13 years 11 months ago
Problem Solving and Complex Systems
The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models re...
Frédéric Guinand, Yoann Pigné
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 11 months ago
Geometric Set Cover and Hitting Sets for Polytopes in $R^3$
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
Sören Laue