% BibTeX Exporter written in LotusScript by Uwe Brahm,
% Please send bug reports via email to . Thanks.
% Exported: Tuesday, 06. December 2016, 13:08, Server: domino/MPII/DE
@ARTICLE{2006CTW_Propp,
AUTHOR = {Doerr, Benjamin and Friedrich, Tobias},
JOURNAL = {Electronic Notes in Discrete Mathematics},
TITLE = {Quasirandomness in Graphs},
ADDRESS = {Amsterdam, The Netherlands},
PUBLISHER = {Elsevier},
VOLUME = {25},
ISBN = {1571-0653},
YEAR = {2006},
PAGES = {61--64},
ABSTRACT = {Jim Propp’s rotor router model is a simple deterministic analogue of a random
walk.
Instead of distributing chips randomly, it serves the neighbors in a fixed
order. We
analyze the difference between Propp machine and random walk on the infinite
two-
dimensional grid. We show that, independent of the starting configuration, at
each
time, the number of chips on each vertex deviates from the expected number of
chips in the random walk model by at most a constant c, which is 7.83 for
clockwise
rotor sequences and 7.28 otherwise. This is the first paper which demonstrates
that
the order in which the neighbors are served makes a difference.},
}
@INPROCEEDINGS{2011STOC,
AUTHOR = {Doerr, Benjamin and Fouz, Mahmoud and Friedrich, Tobias},
TITLE = {Social Networks Spread Rumors in Sublogarithmic Time},
BOOKTITLE = {STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing},
PADDRESS = {New York, NY},
ADDRESS = {San Jose, CA},
PUBLISHER = {ACM},
ISBN = {978-1-4503-0691-1},
DOI = {10.1145/1993636.1993640},
YEAR = {2011},
PAGES = {21--30},
}
@ARTICLE{a15-kavitha,
AUTHOR = {Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios and Paluch, Katarzyna E.},
JOURNAL = {ACM Transactions on Algorithms},
TITLE = {Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem},
ADDRESS = {New York, NY, USA},
NUMBER = {2},
PUBLISHER = {ACM},
VOLUME = {3},
ISBN = {1549-6325},
DOI = {10.1145/1240233.1240238},
YEAR = {2007},
PAGES = {15.1--15.18},
}
@INPROCEEDINGS{Abed2012,
AUTHOR = {Abed, Fidaa and Huang, Chien-Chung},
EDITOR = {Epstein, Leah and Ferragina, Paolo},
TITLE = {Preemptive Coordination Mechanisms for Unrelated Machines},
BOOKTITLE = {Algorithms - ESA 2012 : 20th Annual European Symposium},
PADDRESS = {Berlin},
ADDRESS = {Ljubljana, Slovenia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7501},
ISBN = {978-3-642-33089-6},
DOI = {10.1007/978-3-642-33090-2_3},
YEAR = {2012},
PAGES = {12--23},
}
@ARTICLE{Abraham2007Popular,
AUTHOR = {Abraham, David J. and Irving, Robert W. and Kavitha, Telikepalli and Mehlhorn, Kurt},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Popular Matchings},
ADDRESS = {Philadelphia, PA, USA},
NUMBER = {4},
PUBLISHER = {SIAM},
VOLUME = {37},
ISBN = {0097-5397},
DOI = {10.1137/06067328X},
YEAR = {2007},
PAGES = {1030--1045},
}
@INPROCEEDINGS{ACMM04,
AUTHOR = {Abraham, David and Cechl{\'a}rov{\'a}, Katarina and Manlove, David F. and Mehlhorn, Kurt},
EDITOR = {Fleischer, Rudolf and Trippen, G.},
TITLE = {Pareto-optimality in house allocation problems},
BOOKTITLE = {Algorithms and Computation: 15th International Symposium, ISAAC 2004},
PADDRESS = {Berlin, Germany},
ADDRESS = {Hong Kong, China},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3341},
ISBN = {3-540-24131-0},
DOI = {10.1007/b104582},
YEAR = {2004},
PAGES = {3--15},
}
@INPROCEEDINGS{ACO-P2012,
AUTHOR = {Panagiotou, Konstantinos and Coja-Oghlan, Amin},
TITLE = {Catching the k-{NAESAT} Threshold},
BOOKTITLE = {STOC’12 : Proceedings of the 2012 ACM Symposium on Theory of Computing},
PADDRESS = {New York, NY},
ADDRESS = {New York, NY},
PUBLISHER = {ACM},
ISBN = {978-1-4503-1245-5},
DOI = {10.1145/2213977.2214058},
YEAR = {2012},
PAGES = {899--907},
}
@TECHREPORT{ACS-TR-121108-01,
AUTHOR = {Eigenwillig, Arno and Kettner, Lutz and Wolpert, Nicola},
TITLE = {Snap Rounding of {B}{\'e}zier Curves},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
TYPE = {Technical Report},
ADDRESS = {66123 Saarbr{\"u}cken, Germany},
NUMBER = {ACS-TR-121108-01},
MONTH = {March},
YEAR = {2007},
PAGES = {19},
}
@TECHREPORT{ACS-TR-121202-01,
AUTHOR = {Berberich, Eric and Hemmer, Michael},
EDITOR = {Kettner, Lutz},
TITLE = {Prototype implementation of the algebraic kernel},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {Groningen, Netherlands},
NUMBER = {ACS-TR-121202-01},
MONTH = {April},
YEAR = {2006},
PAGES = {35},
ABSTRACT = {In this report we describe the current progress with respect to prototype
implementations of algebraic kernels within the ACS project. More specifically,
we report on: (1) the Cgal package Algebraic\_kernel\_for\_circles\_2\_2 aimed
at providing the necessary algebraic functionality required for treating
circular arcs; (2) an interface between Cgal and SYNAPS for accessing the
algebraic functionality in the SYNAPS library; (3) the NumeriX library (part of
the EXACUS project) which is a prototype implementation of a set of algebraic
tools on univariate polynomials, needed to built an algebraic kernel and (4) a
rough CGAL-like prototype implementation of a set of algebraic tools on
univariate polynomials.},
}
@TECHREPORT{ACS-TR-121202-01,
AUTHOR = {Berberich, Eric and Hemmer, Michael and Karavelas, Menelaos and Pion, Sylvain and Teillaud, Monique and Tsigaridas, Elias},
TITLE = {Prototype implementation of the algebraic kernel},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {9700 AB Groningen THE NETHERLANDS},
NUMBER = {ACS-TR-121202-01},
MONTH = {April},
YEAR = {2008},
PAGES = {35},
ABSTRACT = {In this report we describe the current progress with respect to prototype
implementations of algebraic kernels within the ACS project. More specifically,
we report on: (1) the Cgal package Algebraic_kernel_for_circles_2_2 aimed at
providing the necessary algebraic functionality required for treating circular
arcs; (2) an interface between Cgal and SYNAPS for accessing the algebraic
functionality in the SYNAPS library; (3) the NumeriX library (part of the
EXACUS project) which is a prototype implementation of a set of algebraic tools
on univariate polynomials, needed to built an algebraic kernel and (4) a rough
CGAL-like prototype implementation of a set of algebraic tools on univariate
polynomials.},
}
@TECHREPORT{ACS-TR-123101-01,
AUTHOR = {Berberich, Eric and Hemmer, Michael and Karavelas, Menelaos and Pion, Sylvain and Teillaud, Monique and Tsigaridas, Elias},
EDITOR = {Kettner, Lutz},
TITLE = {Interface specification of algebraic kernel},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {Groningen, The Netherlands},
NUMBER = {ACS-TR-123101-01},
MONTH = {April},
YEAR = {2006},
PAGES = {27},
}
@TECHREPORT{ACS-TR-241402-01,
AUTHOR = {Hemmer, Michael and Dupont, Laurent and Petitjean, Sylvain and Sch{\"o}mer, Elmar},
TITLE = {Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of Quadrics},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {9700 AB Groningen THE NETHERLANDS},
NUMBER = {ACS-TR-241402-01},
MONTH = {April},
YEAR = {2008},
PAGES = {13},
ABSTRACT = {We present a complete, exact and efficient implementation to compute the
adjacency graph of an arrangement of quadrics, surfaces of algebraic degree~2.
This is a major step towards the computation of the full arrangement. We
enhanced an implementation for an exact parameterization of the intersection
curves of two quadrics, such that we can compute the exact parameter value for
intersection points and from that the adjacency graph of the arrangement. Our
implementation is complete in the sense that it can handle all kind of inputs
including all degenerate ones where intersection curves have singularities or
pairs of curves intersect with high multiplicity. It is exact in that it always
computes the mathematical correct result. It is efficient measured in running
times, we compare it with a previous implementation based on planar
arrangements of the projected intersection curves.},
}
@TECHREPORT{ACS-TR-241405-03,
AUTHOR = {Hemmer, Michael and H{\"u}lse, Dominik},
TITLE = {Traits classes for polynomial gcd computation over algebraic extensions},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {9700 AB Groningen THE NETHERLANDS},
NUMBER = {ACS-TR-241405-03},
YEAR = {2007},
PAGES = {28},
ABSTRACT = {Reported are experiences on templated implementations for polynomial gcd
computation over algebraic extensions within EXACUS. In particular we report on
preliminary benchmarks for gcd computation of univariate polynomials comparing
the naive approach with a preliminary implementation based on modular
arithmetic. The report includes specification of traits classes needed to deal
with algebraic coefficients. The presented traits classes are supposed to serve
as a design study in order to extend the current framework in the algebraic
foundations package of CGAL.},
}
@TECHREPORT{ACS-TR-243306-03,
AUTHOR = {Hemmer, Michael and Limbach, Sebastian},
TITLE = {Benchmarks on a generic univariate algebraic kernel},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {9700 AB Groningen THE NETHERLANDS},
NUMBER = {ACS-TR-243306-03},
MONTH = {April},
YEAR = {2007},
PAGES = {33},
ABSTRACT = {The CGAL algebraic kernel specification splits into an univariate and a
bivariate algebraic kernel. For a univariate algebraic kernel the most
important components are the root isolation method and the implementation of
the number type representing the algebraic numbers. We followed the spirit of
CGAL and implemented a generic univariate algebraic kernel, for which it is
possible to exchange the coefficient type, the root isolation method and the
representation of the algebraic real type. Reported are benchmarks obtained
using the different instantiations of this kernel.},
}
@TECHREPORT{ACS-TR-243400-04,
AUTHOR = {Hemmer, Michael},
TITLE = {CGAL package: Algebraic Foundations},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {9700 AB Groningen THE NETHERLANDS},
NUMBER = {ACS-TR-243400-04},
MONTH = {April},
YEAR = {2008},
PAGES = {103},
ABSTRACT = {CGAL is targeting towards exact computation with non-linear objects, in
particular objects defined on algebraic curves and surfaces. As a consequence
types representing polynomials, algebraic extensions and finite fields play a
more important role in related implementations. This package has been
introduced to stay abreast of these changes. Since in particular polynomials
must be supported by the introduced framework the package avoids the term {\em
number type}. Instead the package distinguishes between the {\em algebraic
structure} of a type and whether a type is embeddable on the real axis, or {\em
real embeddable} for short. Moreover, the package introduces the notion of {\em
interoperable} types which allows an explicit handling of mixed operations.},
}
@TECHREPORT{acs-tr-243404-03,
AUTHOR = {Kerber, Michael},
TITLE = {On filter methods in CGAL's 2D curved kernel},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {Groningen, The Netherlands},
NUMBER = {ACS-TR-243404-03},
MONTH = {May},
YEAR = {2008},
PAGES = {7},
ABSTRACT = {We report on several filter techniques on top of the recently completed
{\sc CGAL} package {\tt Curved\_kernel\_via\_analysis\_2},
a model for {\sc CGAL}'s
{\sf ArrangementTraits\_2} concept.
Geometric predicates for two arcs are usually answered by analyzing the
geometry of the underlying supporting curve pair.
Such an analysis tends to be a time-consuming task, especially
if arcs are defined by algebraic curves of arbitrary degree.
Our refined model {\tt Filtered\_curved\_kernel\_via\_analysis\_2}
tries to prevent
the computation of such a curve pair analysis if possible by a filtered method
to detect non-intersections.
When instantiated with a proper model of the {\sf CurveKernel\_2} concept,
we show experimentally that fewer curve pair analyses are necessary.},
}
@TECHREPORT{ACS-TR-243406-01,
AUTHOR = {Hemmer, Michael},
TITLE = {CGAL package for modular arithmetic operations},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {9700 AB Groningen THE NETHERLANDS},
NUMBER = {ACS-TR-243406-01},
MONTH = {April},
YEAR = {2008},
PAGES = {17},
ABSTRACT = {Modular arithmetic is a fundamental tool in modern algebra systems. In
conjunction with the Chinese remainder theorem it serves as the workhorse in
several algorithms computing the gcd, resultant etc. Moreover, it can serve as
a very efficient filter. This CGAL package introduces the type {\tt
CGAL::Modular} representing a finite field over some prime. Moreover, the
package introduces {\tt CGAL::Modular\_traits} providing a mapping from some
algebraic structure {\tt T} into an algebraic structure that is based on the
type {\tt CGAL::Modular}.},
}
@TECHREPORT{ACS-TR-361502-02,
AUTHOR = {Mehlhorn, Kurt and Osbild, Ralf and Sagraloff, Michael},
TITLE = {A General Approach to the Analysis of Controlled Perturbation Algorithms},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {9700 AB Groningen THE NETHERLANDS},
NUMBER = {ACS-TR-361502-02},
YEAR = {2008},
PAGES = {24},
ABSTRACT = {Controlled Perturbation (CP, for short) is an approach to implement
efcient and robust geometric algorithms using the computational speed of
builtin
nite precision arithmetic, while bypassing precision problems during the
computation.
Furthermore it avoids the time-consuming and error-prone discussion
of degenerate cases. CP replaces the input objects by a set of randomly
perturbed
(moved, scaled, stretched, etc.) objects such that the algorithm is guaranteed
to
compute the exact combinatorial structure that these objects imply.
This paper is meant as a guide how to decide if CP can be applied to a given
algorithm, and if, how to correlate all CP parameters: the perturbation amount
d ,
the arithmetic precision $L$, the maximum range of input values $[−m,m]$, the
number
of input objects $n$, the error bound $\mathcal{B}_f$ of the (chosen) predicate
evaluations,
and the probability $\mathcal{P}$ of a successful computation. For this purpose
we present
a general methodology to analyze predicate functions that leads to an inequality
correlating these parameters and hence to bounds on the precision or
perturbation
amount. In particular we treat the case of the wide used class of polynomial
predicates
in detail. Advantages, drawbacks and implementation issues are discussed.},
}
@TECHREPORT{ACS-TR-361502-03,
AUTHOR = {Mehlhorn, Kurt and Sagraloff, Michael},
TITLE = {A deterministic Bitstream Descartes Algorithm},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {9700 AB Groningen THE NETHERLANDS},
NUMBER = {ACS-TR-361502-03},
YEAR = {2008},
PAGES = {18},
NOTE = {accepted to ISSAC 2009},
ABSTRACT = {We describe a variant of the Descartes algorithm for root isolation of
polynomials with real
coefficients. It is assumed that the coefficients of the polynomial can be
approximated with arbitrary
precision; exact computation in the field of coefficients is not required. We
refer to such
coefficients as bitstream coefficients. The algorithm is deterministic and has
same asymptotic
complexity as the randomized bitstream Descartes algorithm of Eigenwillig et.
al. [EKK+05].
Besides being deterministic, the algorithm is also somewhat simpler to analyse.},
}
@TECHREPORT{ACS-TR-363501-01,
AUTHOR = {Hemmer, Michael},
TITLE = {Evaluation of different approaches in 3D curved kernel for arrangements of quadrics},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {9700 AB Groningen THE NETHERLANDS},
NUMBER = {ACS-TR-363501-01},
MONTH = {April},
YEAR = {2008},
PAGES = {19},
ABSTRACT = {Within the context of the ACS project we have investigated two
approaches towards the arrangements of quadrics. The first approach,which is
presented in ACS-TR-241402-01, computes the adjacency graph of the arrangement
and is based on an exact parameterization of the appearing intersection curves.
The second approach, which is presented in ACS-TR-241402-02, computes the
arrangement on each quadric and is base on the computation of the planar
arrangement of the projected intersection curves. This report provides a
dedicated empirical comparison of both approaches towards the arrangement of
quadrics.},
}
@TECHREPORT{acs-tr-363602-01,
AUTHOR = {Emeliyanenko, Pavel and Kerber, Michael},
TITLE = {An implementation of the 2D Algebraic Kernel},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {Groningen, The Netherlands},
NUMBER = {ACS-TR-363602-01},
MONTH = {May},
YEAR = {2008},
PAGES = {14},
ABSTRACT = {We report on a model for {\sc CGAL}'s
{\sf AlgebraicKernelWithAnalysis\_d\_2} concept
which refines {\sf AlgebraicKernel\_d\_2}. Our implementation handles bivariate
polynomials in full generality, i.e., with no restriction on their degree.
Moreover, it allows both integers and nested square-root numbers as coefficient
type. The Curve analysis and Curve pair analysis required by the concept
are realized using recent work of Eigenwillig, Kerber and Wolpert
('Fast and exact geometric analysis\ldots', ISSAC 2007 and 'Exact and efficient
2D-Arrangements\ldots'. SODA 2008).
The consequent use of certified numerical methods
leads to significant speed-ups without spoiling exactness.
We present benchmark results about the performance of several key methods.},
}
@TECHREPORT{ACS-TR-363602-02,
AUTHOR = {Emiris,Ioannis and Hemmer, Michael and Karavelas, Menelaos and Limbach, Sebastian and Mourrain, Bernard and Tsigaridas, Elias and Zafeirakopoulos,Zafeirakis},
TITLE = {Cross-benchmarks of univariate algebraic kernels},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {9700 AB Groningen THE NETHERLANDS},
NUMBER = {ACS-TR-363602-02},
MONTH = {April},
YEAR = {2008},
PAGES = {35},
ABSTRACT = {We summarize the results of the cross-benchmarks for two univariate algebraic
kernels (AK) developed in ACS. The kernels, developed at INRIA and MPI, were
tested on 6 types of univariate polynomials of various degrees and bitsizes.
The methods included were: Sturm, Sleeve, CF, NCF, NCF2 for the INRIA kernel,
and Descartes and Bitstream-Descartes for the MPI kernel. NCF, NCF2, Descartes
and Bitstream-Descartes are the most robust and never give wrong results. With
respect to speed, the results are not decisive in most cases. Overall NCF and
NCF2 seem faster, while for very large bitsizes Bitstream-Descartes seems more
efficient, provided
the degree is not very high. Special algorithms for polynomials of
degree up to 4 give better results. We also compare against an external
AK developed at LORIA-Nancy and based on the RS solver from INRIARocquencourt.},
}
@TECHREPORT{ACS-TR-363603-01,
AUTHOR = {Emiris, Ioannis and Hemmer, Michael and Tsigaridas, Elias and Tzoumas, Georg},
TITLE = {Voronoi diagram of ellipses: CGAL-based implementation},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {9700 AB Groningen THE NETHERLANDS},
NUMBER = {ACS-TR-363603-01},
MONTH = {April},
YEAR = {2008},
PAGES = {18},
ABSTRACT = {We present a C++ open-source implementation of an incremental algorithm
for the computation of the Voronoi diagram of ellipses in the Euclidean
plane. This is the first complete implementation, under the exact computation
paradigm; it also computes the approximate diagram with any given precision.
It is based on the cgal package for the Apollonius diagram. The ellipses
are given in parametric representation, which allows us to develop a GUI for
input / output. The software concerns non-intersecting ellipses, but it can be
generalized. We implement an interval Newton solver, bivariate polynomial
interpolation, and trivariate system resultant computation, and demonstrate
the factorization of certain resultants so as to arrive at an efficient
implementation
of InCircle . As a ballmark estimate, our code spends about 99sec
to construct the Voronoi diagram of 128 ellipses, when few degeneracies occur.
It is faster than the cgal Voronoi diagram of polygons, when ellipses
are approximated by k-gons for k > 15, but expectedly slower on circles than
the cgal Apollonius package. Our software is connected to the algebraic library
Synaps and, through it, to libraries mpfr and ntl, hence illustrating
the concept of algebraic support for geometric computing; it is targeted for
inclusion in the cgal library. In this direction, we present some experiments
using the new Algebraic Kernel from MPI.},
}
@TECHREPORT{ACS-TR-363606-01,
AUTHOR = {Hemmer, Michael and Limbach, Sebastian},
TITLE = {Arrangements of quadrics in 3D: continued work on experimental implementation},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {9700 AB Groningen THE NETHERLANDS},
NUMBER = {ACS-TR-363606-01},
YEAR = {2008},
PAGES = {46},
ABSTRACT = {On the way towards a complete, exact and efficient algorithm for the
computation of arrangements of quadric surfaces a major goal was recently
reached: An algorithm computing the adjacency graph of the arrangement’s
vertices using exact parameterizations of the occurring intersection curves and
points. In this report the general design of the implementation of this
algorithm as part of the QuadriX library of the Exacus project is presented.
Further we introduce a new “Environment Map” concept capable of representing
the environments of vertices in a quadric arrangement, i.e. information about
the correlations of incident intersection curves and quadric surfaces at each
vertex. We discuss some possible models of this “Environment Map” concept and
give an outlook on further work.},
}
@TECHREPORT{acs-tr-363608-02,
AUTHOR = {Emeliyanenko, Pavel and Kerber, Michael},
TITLE = {Visualizing and Exploring Planar Algebraic Arrangements - a Web Application},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {Groningen, The Netherlands},
NUMBER = {ACS-TR-363608-02},
MONTH = {May},
YEAR = {2008},
PAGES = {6},
ABSTRACT = {A web application is presented to compute, plot, and interactively explore
planar arrangements induced by algebraic plane curves of arbitrary degree.
It produces accurate curve plots and reflects the exact topology for
any arrangement, including highly-degenerate cases.
Various user interface features allow the interactive exploration
of the arrangement structure.
The tool useful for demonstrative and educational purposes,
especially as it runs without initial installation process.},
}
@TECHREPORT{acstr123109-01,
AUTHOR = {Funke, Stefan and Klein, Christian and Mehlhorn, Kurt and Schmitt, Susanne},
TITLE = {Controlled Perturbation for Delaunay Triangulations},
INSTITUTION = {Algorithms for Complex Shapes with certified topology and numerics},
TYPE = {Technical Report},
ADDRESS = {Instituut voor Wiskunde en Informatica, Groningen, NETHERLANDS},
NUMBER = {ACS-TR-121103-03},
YEAR = {2006},
PAGES = {20},
}
@TECHREPORT{acs:bcw-carc-07,
AUTHOR = {Berberich, Eric and Caroli, Manuel and Wolpert, Nicola},
TITLE = {Exact Computation of Arrangements of Rotated Conics},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {Groningen, The Netherlands},
NUMBER = {ACS-TR-123104-03},
MONTH = {April},
YEAR = {2007},
PAGES = {5},
}
@TECHREPORT{acs:bek-dffbiaq-06,
AUTHOR = {Berberich, Eric and Ebert, Franziska and Kettner, Lutz},
TITLE = {Definition of file format for benchmark instances for arrangements of Quadrics},
INSTITUTION = {University of Groningen},
ADDRESS = {Groningen, The Netherlands},
NUMBER = {ACS-TR-123109-01},
MONTH = {April},
YEAR = {2006},
PAGES = {17},
}
@TECHREPORT{acs:bek-wbipca-06,
AUTHOR = {Berberich, Eric and Ebert, Franziska and Fogel, Efi and Kettner, Lutz},
TITLE = {Web-site with benchmark instances for planar curve arrangements},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {Groningen, The Netherlands},
NUMBER = {ACS-TR-123108-01},
MONTH = {April},
YEAR = {2006},
PAGES = {4},
}
@TECHREPORT{acs:bfhmw-smtaoq-07,
AUTHOR = {Berberich, Eric and Fogel, Efi and Halperin, Dan and Mehlhorn, Kurt and Wein, Ron},
TITLE = {Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {Groningen, The Netherlands},
NUMBER = {ACS-TR-241402-02},
MONTH = {April},
YEAR = {2007},
PAGES = {10},
}
@TECHREPORT{acs:bfm-uwibaqpac-07,
AUTHOR = {Berberich, Eric and Fogel, Efi and Meyer, Andreas},
TITLE = {Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic Curves},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {Groningen, The Netherlands},
NUMBER = {ACS-TR-243305-01},
MONTH = {April},
YEAR = {2007},
PAGES = {5},
}
@TECHREPORT{acs:bh-dtqkc-07,
AUTHOR = {Berberich, Eric and Hemmer, Michael},
TITLE = {Definition of the 3D Quadrical Kernel Content},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {Groningen, The Netherlands},
NUMBER = {ACS-TR-243302-02},
MONTH = {April},
YEAR = {2007},
PAGES = {25},
}
@TECHREPORT{acs:bhkt-risak-06,
AUTHOR = {Berberich, Eric and Hemmer, Michael and Karavelas, Menelaos I. and Teillaud, Monique},
TITLE = {Revision of interface specification of algebraic kernel},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {Groningen, The Netherlands},
NUMBER = {ACS-TR-243301-01},
MONTH = {April},
YEAR = {2007},
PAGES = {100},
}
@TECHREPORT{acs:bm-ceq-07,
AUTHOR = {Berberich, Eric and Meyerovitch, Michal},
TITLE = {Computing Envelopes of Quadrics},
INSTITUTION = {University of Groningen},
TYPE = {Technical Report},
ADDRESS = {Groningen, The Netherlands},
NUMBER = {ACS-TR- 241402-03},
MONTH = {April},
YEAR = {2007},
PAGES = {5},
}
@TECHREPORT{acs:tr123203-04-08,
AUTHOR = {Berberich, Eric and Emeliyanenko, Pavel},
TITLE = {{CGAL's} Curved Kernel via Analysis},
INSTITUTION = {Algorithms for Complex Shapes},
TYPE = {Technical Report},
ADDRESS = {MPI f{\"u}r Informatik, Germany},
NUMBER = {ACS-TR-123203-04},
YEAR = {2008},
PAGES = {101},
}
@ARTICLE{ACTAI::BeckerM1986,
AUTHOR = {Becker, Michael and Mehlhorn, Kurt},
JOURNAL = {Acta Informatica},
TITLE = {Algorithms for Routing in Planar Graphs},
ADDRESS = {Berlin, Germany},
NUMBER = {2},
PUBLISHER = {Springer},
VOLUME = {23},
DOI = {10.1007/BF00289496},
YEAR = {1986},
PAGES = {163--176},
}
@INPROCEEDINGS{AdamaszekWiese2013,
AUTHOR = {Adamaszek, Anna and Wiese, Andreas},
TITLE = {Approximation Schemes for Maximum Weight Independent Set of Rectangles},
BOOKTITLE = {Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013)},
PADDRESS = {Los Alamitos, USA},
ADDRESS = {Berkeley, USA},
PUBLISHER = {IEEE},
YEAR = {2013},
}
@INPROCEEDINGS{addobj07,
AUTHOR = {Brockhoff, Dimo and Friedrich, Tobias and Hebbinghaus, Nils and Klein, Christian and Neumann, Frank and Zitzler, Eckart},
EDITOR = {Dirk Thierens},
TITLE = {Do Additional Objectives Make a Problem Harder?},
BOOKTITLE = {Genetic and Evolutionary Computation Conference 2007},
PADDRESS = {New York, NY, USA},
ADDRESS = {London, UK},
PUBLISHER = {ACM},
MONTH = {July},
DOI = {10.1145/1276958.1277114},
YEAR = {2007},
PAGES = {765--772},
}
@ARTICLE{ADHP2009,
AUTHOR = {Angelopoulos, Spyros and Doerr, Benjamin and Huber, Anna and Panagiotou, Konstantinos},
JOURNAL = {The Electronic Journal of Combinatorics},
TITLE = {Tight bounds for quasirandom rumor spreading},
ADDRESS = {Philadelphia, PA},
NUMBER = {1},
PUBLISHER = {Department of Mathematics of the University of Pennsylvania},
VOLUME = {16},
ISBN = {1077-8926},
YEAR = {2009},
PAGES = {R102,1--R102,19},
ABSTRACT = {This paper addresses the following fundamental problem: Suppose that in a group
of $n$ people,
where each person knows all other group members, a single person holds a piece
of information that must be disseminated to everybody within the group.
How should the people propagate the information so that after short time
everyone is informed?
The classical approach, known as the {\em push model}, requires that in each
round,
every informed person selects some other person in the group at random, whom it
then informs.
In a different model, known as the \emph{quasirandom push model}, each person
maintains a cyclic list, i.e., permutation,
of all members in the group (for instance, a contact list of persons).
Once a person is informed, it chooses a random member in its own list,
and from that point onwards, it informs a new person per round, in the order
dictated by the list.
In this paper we show that with probability $1-o(1)$ the quasirandom protocol
informs everybody in
$(1 \pm o(1))\log_2 n+\ln n$ rounds; furthermore we also show that this bound
is tight. This result, together with previous work on the randomized push
model, demonstrates that irrespectively of the choice of lists, quasirandom
broadcasting is as fast as broadcasting in the randomized push model, up to
lower order terms. At the same
time it reduces the number of random bits from $O(\log^2 n)$ to only
$\lceil\log_2 n\rceil$ per person. },
}
@ARTICLE{ADKMNT03:dominance,
AUTHOR = {Althaus, Ernst and Duchier, Denys and Koller, Alexander and Mehlhorn, Kurt and Niehren, Joachim and Thiel, Sven},
JOURNAL = {Journal of Algorithms},
TITLE = {An Efficient Algorithm for the Configuration Problem of Dominance Graphs},
ADDRESS = {Amsterdam, The Netherlands},
PUBLISHER = {Elsevier},
MONTH = {August},
VOLUME = {48},
ISBN = {0196-6774},
DOI = {10.1016/S0196-6774(03)00050-6},
YEAR = {2003},
PAGES = {194--219},
ABSTRACT = {Dominance constraints are logical descriptions of trees that are widely used in
computational linguistics. Their general satisfiability problem is known to be
NP-complete. Here we identify normal dominance constraints and present an
efficient graph algorithm for testing their satisfiablity in deterministic
polynomial time. Previously, no polynomial time algorithm was known.},
}
@INPROCEEDINGS{ADKMNT2001,
AUTHOR = {Althaus, Ernst and Duchier, Denys and Koller, Alexander and Mehlhorn, Kurt and Niehren, Joachim and Thiel, Sven},
TITLE = {An Efficient Algorithm for the Configuration Problem of Dominance Graphs},
BOOKTITLE = {Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01)},
ORGANIZATION = {ACM-SIAM},
PADDRESS = {New York},
ADDRESS = {Washington DC, USA},
PUBLISHER = {ACM},
MONTH = {January},
ISBN = {0-89871-490-7},
YEAR = {2001},
PAGES = {815--824},
ABSTRACT = {Dominance constraints are logical
tree descriptions originating from automata theory that have multiple
applications in computational linguistics. The satisfiability problem
of dominance constraints is NP-complete. In most applications,
however, only \emph{normal} dominance constraints are used. The
satisfiability problem of normal dominance constraints can be reduced
in linear time to the configuration problem of dominance graphs, as
shown recently. In this paper, we give a polynomial time algorithm
testing configurability of dominance graphs (and thus satisfiability
of normal dominance constraints). Previous to our work no polynomial
time algorithms were known.},
}
@INPROCEEDINGS{ADLO:08.listupdate,
AUTHOR = {Angelopoulos, Spyros and Dorrigiv, Reza and Lopez-Ortiz, Alejandro},
TITLE = {List Update with Locality of Reference},
BOOKTITLE = {8th Latin American Symposium on Theoretical Informatics (LATIN 2008)},
PADDRESS = {New York},
ADDRESS = {Buzios, Brasil},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4957},
YEAR = {2008},
PAGES = {399--410},
}
@INPROCEEDINGS{AEFM2004,
AUTHOR = {Althaus, Ernst and Eisenbrand, Friedrich and Funke, Stefan and Mehlhorn, Kurt},
TITLE = {Point Containment in the Integer Hull of a Polyhedron},
BOOKTITLE = {Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04)},
ORGANIZATION = {Association of Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {New Orleans, USA},
PUBLISHER = {ACM},
ISBN = {0-89871-558-X},
YEAR = {2004},
PAGES = {929--933},
ABSTRACT = { We show that the point containment problem in the integer hull of a
polyhedron, which is defined by $m$ inequalities, with coefficients of at most
$\varphi$ bits can be solved in time $\bigO(m+\varphi)$ in the two-dimensional
case and in expected time $\bigO(m+\varphi^2 \log m)$ in any fixed dimension.
This improves on the algorithm which is based on the equivalence of separation
and optimization and on a direct algorithm (SODA 97) for the two-dimensional
case.},
}
@MANUAL{af-hemmer-2007,
AUTHOR = {Hemmer, Michael},
TITLE = {Algebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3},
ORGANIZATION = {CGAL},
ADDRESS = {Campus E1 4, 66123 Saarbr{\"u}cken, Germany},
MONTH = {May},
YEAR = {2007},
PAGES = {105},
}
@ARTICLE{AF10,
AUTHOR = {Ajwani, Deepak and Friedrich, Tobias},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Average-case Analysis of Incremental Topological Ordering},
ADDRESS = {Amsterdam},
NUMBER = {4},
PUBLISHER = {Elsevier},
MONTH = {February},
VOLUME = {158},
ISBN = {0166-218X},
DOI = {10.1016/j.dam.2009.07.006},
YEAR = {2010},
PAGES = {240--250},
}
@ARTICLE{AFHKRS05,
AUTHOR = {Althaus, Ernst and Funke, Stefan and Har-Peled, Sariel and K{\"o}nemann, Jochen and Ramos, Edgar A. and Skutella, Martin},
JOURNAL = {Operations Research Letters},
TITLE = {Approximating k-Hop Minimum-Spanning Trees},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {2},
PUBLISHER = {Elsevier},
MONTH = {March},
VOLUME = {33},
ISBN = {0167-6377},
YEAR = {2005},
PAGES = {115--120},
ABSTRACT = { In this paper we consider the problem of computing minimum-cost spanning trees
with depth restrictions. Specifically, we are given an $n$-node complete graph
$G$, a metric cost-function $c$ on its edges, and an integer $k\geq 1$. The
goal in the minimum-cost $k$-hop spanning tree problem is to compute a spanning
tree $T$ in $G$ of minimum total cost such that the longest root-leaf-path in
the tree has at most $k$ edges.
Our main result is an algorithm that computes a tree of depth at most $k$ and
total expected cost $O(\log n)$ times that of a minimum-cost $k$-hop
spanning-tree. The result is based upon earlier work on metric space
approximation due to Fakcharoenphol et al.[FRT03] and Bartal [Bart96,Bart98].
In particular we show that the problem can be solved exactly in polynomial time
when the cost metric $c$ is induced by a so-called hierarchically
well-separated tree. },
}
@INPROCEEDINGS{AFM06,
AUTHOR = {Ajwani, Deepak and Friedrich, Tobias and Meyer, Ulrich},
EDITOR = {Arge, Lars and Freivalds, Rusins},
TITLE = {An ${O}(n^{2.75})$ algorithm for online topological ordering},
BOOKTITLE = {Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory},
PADDRESS = {Berlin, Germany},
ADDRESS = {Riga, Latvia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4059},
ISBN = {978-3-540-35753-7},
YEAR = {2006},
PAGES = {53--64},
ABSTRACT = {We present a simple algorithm which maintains the topological order of a
directed acyclic graph with $n$ nodes under an online edge insertion sequence
in $\O(n^{2.75})$ time, independent of the number of edges $m$ inserted. For
dense DAGs, this is an improvement over the previous best result of
$\O(\min\{m^{\frac{3}{2}} \log{n}, m^{\frac{3}{2}} + n^2 \log{n}\})$ by Katriel
and Bodlaender. We also provide an empirical comparison of our algorithm with
other algorithms for online topological sorting.},
}
@ARTICLE{AFM08,
AUTHOR = {Ajwani, Deepak and Friedrich, Tobias and Meyer, Ulrich},
JOURNAL = {ACM Transactions on Algorithms},
TITLE = {An $O(n^2.75)$ algorithm for incremental topological ordering},
NUMBER = {4},
PUBLISHER = {ACM Press},
VOLUME = {4},
ISBN = {1549-6325},
DOI = {10.1145/1383369.1383370},
YEAR = {2008},
PAGES = {1--14},
}
@INPROCEEDINGS{AFNPS02,
AUTHOR = {Andreou, Maria and Fotakis, Dimitris and Nikoletseas, Sotiris and Papadopoulou, Vicky and Spirakis, Paul G.},
EDITOR = {Diks, Krzysztof and Rytter, Wojciech},
TITLE = {On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations},
BOOKTITLE = {Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002},
PADDRESS = {Berlin, Germany},
ADDRESS = {Warsaw, Poland},
PUBLISHER = {Springer},
MONTH = {August},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2420},
ISBN = {3-540-44040-2},
YEAR = {2002},
PAGES = {81--92},
ABSTRACT = {Hierarchical specifications of graphs have been widely used in many important
applications, such as VLSI design, parallel programming and software
engineering. A well known hierarchical specification model, considered in this
work, is that of Lengauer [9, 10] referred to as L-specifications. In this
paper we discuss a restriction on the L-specifications resulting to graphs
which we call Well-Separated (WS). This class is characterized by a polynomial
time (to the size of the specification of the graph) testable combinatorial
property.
In this work we study the Radiocoloring Problem (RCP) on WS L-specified
hierarchical planar graphs. The optimization version of RCP studied here,
consists in assigning colors to the vertices of a graph, such that any two
vertices of distance at most two get different colors. The objective here is to
minimize the number of colors used. This problem is equivalent to the problem
of vertex coloring the square of a graph $G$, $G^2$, where $G^2$ has the same
vertex set as $G$ and there is an edge between any two vertices of $G^2$ if
their distance in $G$ is at most 2.
We first show that RCP is PSPACE-complete for WS L-specified hierarchical
planar graphs. Second, we present a polynomial time 3-approximation algorithm
as well as a more efficient 4-approximation algorithm for RCP on graphs of this
class.
We note that, the best currently known approximation ratio for the RCP on
ordinary (non-hierarchical) planar graphs of general degree is 2 ([6, 1]). Note
also that the only known results on any kind of coloring problems have been
shown for another special kind of hierarchical graphs (unit disk graphs)
achieving a 6-approximation solution [13]. },
}
@INCOLLECTION{Afshani2013,
AUTHOR = {Afshani, Peyman and Agrawal, Manindra and Doerr, Benjamin and Doerr, Carola and Larsen, Kasper Green and Mehlhorn, Kurt},
EDITOR = {Brodnik, Andrej and L{\'o}pez-Ortiz, Alejandro and Raman, Venkatesh and Viola, Alfredo},
TITLE = {The Query Complexity of Finding a Hidden Permutation},
BOOKTITLE = {Space-Efficient Data Structures, Streams, and Algorithms},
ADDRESS = {Heidelberg},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8066},
ISBN = {978-3-642-40272-2},
YEAR = {2013},
PAGES = {1--11},
}
@ARTICLE{AfshaniADGLMW12eccc,
AUTHOR = {Afshani, Peyman and Agrawal, Manindra and Doerr, Benjamin and Green Larsen, Kasper and Mehlhorn, Kurt and Winzen, Carola},
JOURNAL = {Electronic Colloquium on Computational Complexity (ECCC): Report Series},
TITLE = {The Query Complexity of Finding a Hidden Permutation},
ADDRESS = {Potsdam},
PUBLISHER = {Hasso-Plattner-Institut f{\"u}r Softwaresystemtechnik GmbH},
VOLUME = {87 (Revision 1)},
ISBN = {1433-8092},
YEAR = {2012},
PAGES = {1--36},
}
@INPROCEEDINGS{Agarwal03,
AUTHOR = {Agarwal, Amit and Agarwal, Tarun and Chopra, Sumit and Feldmann, Anja and Kammenhuber, Nils and Krysta, Piotr and V{\"o}cking, Berthold},
EDITOR = {Kosch, Harald and B{\"o}sz{\"o}rm{\'e}nyi, L{\'a}szl{\'o} and Hellwagner, Hermann},
TITLE = {An experimental study of k-splittable scheduling for DNS-based traffic allocation},
BOOKTITLE = {Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings},
PADDRESS = {Berlin, Germany},
ADDRESS = {Klagenfurt, Austria},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2790},
ISBN = {3-540-40788-X},
YEAR = {2003},
PAGES = {230--235},
}
@INPROCEEDINGS{Agarwal99,
AUTHOR = {Agarwal, Pankaj and Arge, Lars and Brodal, Gerth St{\o}lting and Vitter, Jeffrey Scott},
TITLE = {I/O-Efficient Dynamic Point Location in Monotone Subdivisions},
BOOKTITLE = {Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99)},
ORGANIZATION = {ACM-SIAM},
PADDRESS = {New York, USA},
ADDRESS = {Baltimore, USA},
PUBLISHER = {ACM},
MONTH = {January},
ISBN = {0-89871-434-6},
YEAR = {1999},
PAGES = {11--20},
ABSTRACT = {We present an efficient external-memory dynamic data structure for
point location in monotone planar subdivisions. Our data structure
uses $O(N/B)$ disk blocks to store a monotone subdivision of size $N$,
where $B$ is the size of a disk block. It supports queries in
$O(\log_{B}^{2} N)$ I/Os (worst-case) and updates in $O(\log_{B}^{2} N)$ I/Os
(amortized).
We also propose a new variant of $B$-trees, called
{\em level-balanced $B$-trees}, which allow insert, delete, merge,
and split operations in $O((1+\frac{b}{B}\log_{M/B} \frac{N}{B})\log_{b}
N)$ I/Os (amortized), $2\leq b\leq B/2$, even if each node stores a
pointer to its parent. Here $M$ is the size of main memory. Besides
being essential to our point-location data structure, we believe that
{\em level-balanced B-trees\/} are of significant independent
interest. They can, for example, be used to dynamically maintain a
planar st-graph using $O((1+\frac{b}{B}\log_{M/B} \frac{N}{B})\log_{b}
N)=O(\log_{B}^{2} N)$ I/Os (amortized) per update, so that reachability
queries can be answered in $O(\log_{B} N)$ I/Os (worst case).},
}
@INPROCEEDINGS{AGHSTW98,
AUTHOR = {Alefragis, Panayiotis and Goumopoulos, Christos and Sanders, Peter and Takkula, Tuomo and Wedelin, Dag},
EDITOR = {Pritchard, David and Reeve, Jeff},
TITLE = {Parallel Crew Scheduling in PAROS},
BOOKTITLE = {Proceedings of the 4th International Euro-Par Conference (Euro-Par-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Southhampton, UK},
PUBLISHER = {Springer},
MONTH = {September},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1470},
YEAR = {1998},
PAGES = {1104--1113},
}
@INPROCEEDINGS{AGMN97,
AUTHOR = {Alberts, David and Gutwenger, Carsten and Mutzel, Petra and N{\"a}her, Stefan},
EDITOR = {Italiano, Giuseppe and Orlando, S.},
TITLE = {AGD-Library: A Library of Algorithms for Graph Drawing},
BOOKTITLE = {Proceedings of the Workshop on Algorithm Engineering (WAE-97)},
PADDRESS = {Venice, Italy},
ADDRESS = {Venice, Italy},
PUBLISHER = {Universit{\`a} Ca' Foscari di Venezia},
YEAR = {1997},
PAGES = {112--123},
}
@ARTICLE{Ahuja-Mehlhorn-Orlin-Tarjan/90,
AUTHOR = {Ahuja, Ravindra K. and Mehlhorn, Kurt and Orlin, James B. and Tarjan, Robert E.},
JOURNAL = {Journal of the ACM},
TITLE = {Faster algorithms for the shortest path problem},
ADDRESS = {New York, USA},
NUMBER = {2},
PUBLISHER = {ACM},
VOLUME = {37},
YEAR = {1990},
PAGES = {213--223},
}
@INPROCEEDINGS{AIJMR09,
AUTHOR = {Amaldi, Edoardo and Iuliano, Claudio and Jurkiewicz, Tomasz and Mehlhorn, Kurt and Rizzi, Romeo},
EDITOR = {Fiat, Amos and Sanders, Peter},
TITLE = {Breaking the {$O(m^2n)$} Barrier for Minimum Cycle Bases},
BOOKTITLE = {Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings},
PADDRESS = {Springer Berlin, Germany},
ADDRESS = {Copenhagen, Denmark},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5757},
ISBN = {978-3-642-04127-3},
DOI = {10.1007/978-3-642-04128-0_28},
YEAR = {2009},
PAGES = {301--312},
}
@INPROCEEDINGS{AIKM05,
AUTHOR = {Abraham, David and Irving, Robert W. and Mehlhorn, Kurt and Telikepalli, Kavitha},
TITLE = {Popular Matchings},
BOOKTITLE = {Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05)},
PADDRESS = {Philadelphia, USA},
ADDRESS = {Vancouver, Canada},
PUBLISHER = {SIAM},
ISBN = {0-89871-585-7},
YEAR = {2005},
PAGES = {424--432},
}
@ARTICLE{Ailon2012,
AUTHOR = {Ailon, Nir and Avigdor-Elgrabli, Noa and Liberty, Edo and van Zuylen, Anke},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Improved Approximation Algorithms for Bipartite Correlation Clustering},
ADDRESS = {Philadelphia, PA},
NUMBER = {5},
PUBLISHER = {SIAM},
VOLUME = {41},
ISBN = {0097-5397},
DOI = {10.1137/110848712},
YEAR = {2012},
PAGES = {1110--1121},
}
@INPROCEEDINGS{AilonESA2011,
AUTHOR = {Ailon, Nir and Avigdor-Elgrabli, Noa and Liberty, Noa and van Zuylen, Anke},
EDITOR = {Demetrescu, Camil and Halld{\'o}rsson, Magn{\'u}s M.},
TITLE = {Improved Approximation Algorithms for Bipartite Correlation Clustering},
BOOKTITLE = {Algorithms - ESA 2011 : 19th Annual European Symposium},
ORGANIZATION = {European Association for Theoretical Computer Science (EATCS)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Saarbr{\"u}cken, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6942},
ISBN = {978-3-642-23718-8},
DOI = {10.1007/978-3-642-23719-5_3},
YEAR = {2011},
PAGES = {25--36},
}
@MASTERSTHESIS{Ajwani05,
AUTHOR = {Ajwani, Deepak},
TITLE = {Design, Implementation and Experimental Study of External Memory {BFS} Algorithms},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {2005},
}
@INPROCEEDINGS{Ajwani06,
AUTHOR = {Ajwani, Deepak and Dementiev, Roman and Meyer, Ulrich},
TITLE = {A computational study of external memory {BFS} algorithms},
BOOKTITLE = {Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06},
PADDRESS = {New York, USA},
ADDRESS = {Miami, USA},
PUBLISHER = {ACM / SIAM},
ISBN = {0-89871-605-5},
YEAR = {2006},
PAGES = {601--610},
}
@INPROCEEDINGS{Ajwani07,
AUTHOR = {Ajwani, Deepak and Meyer, Ulrich and Osipov, Vitaly},
EDITOR = {Applegate, David and Brodal, Gerth},
TITLE = {Improved external memory {BFS} implementations},
BOOKTITLE = {9th Workshop on Algorithm Engineering and Experiments (ALENEX)},
PADDRESS = {Philadephia},
ADDRESS = {New Orleans, USA},
PUBLISHER = {SIAM},
YEAR = {2007},
PAGES = {3--12},
}
@ARTICLE{Ajwani2012,
AUTHOR = {Ajwani, Deepak and Elbassioni, Khaled and Govindarajan, Sathish and Ray, Saurabh},
JOURNAL = {Discrete \& Computational Geometry},
TITLE = {Conflict-free coloring for rectangle ranges using O(n .382) colors},
ADDRESS = {New York, NY},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {48},
ISBN = {0179-5376},
DOI = {10.1007/s00454-012-9425-5},
YEAR = {2012},
PAGES = {39--52},
}
@INCOLLECTION{AjwaniMeyerOsipov2009,
AUTHOR = {Ajwani, Deepak and Meyer, Ulrich and Osipov, Vitaly},
EDITOR = {Demetrescu, Camil and Goldberg, Andrew V. and Johnson, David S.},
TITLE = {Breadth first search on massive graphs},
BOOKTITLE = {The shortest path problem : ninth DIMACS implemenation challenge},
ADDRESS = {Providence, RI},
PUBLISHER = {AMS},
SERIES = {DIMACS Series on Disrecte Mathematics and Theoretical Computer Science},
VOLUME = {74},
ISBN = {978-0-8218-4383-3},
YEAR = {2009},
PAGES = {291--307},
}
@INPROCEEDINGS{AkbariBS2012,
AUTHOR = {Akbari, Hoda and Berenbrink, Petra and Sauerwald, Thomas},
EDITOR = {Kowalski, Darek and Panconesi, Alessandro},
TITLE = {A simple approach for adapting continuous load balancing processes to discrete settings},
BOOKTITLE = {PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing},
PADDRESS = {New York, NY},
ADDRESS = {Madeira, Portugal},
PUBLISHER = {ACM},
ISBN = {978-1-4503-1450-3},
DOI = {10.1145/2332432.2332486},
YEAR = {2012},
PAGES = {271--280},
}
@INPROCEEDINGS{AKL+2000,
AUTHOR = {Althaus, Ernst and Kohlbacher, Oliver and Lenhof, Hans-Peter and M{\"u}ller, Peter},
EDITOR = {Shamir, Ron and Miyano, Satoru and Istrail, Sorin and Pevzner, Pavel and Waterman, Michael},
TITLE = {A Combinatorial Approach to Protein Docking with Flexible Side-Chains},
BOOKTITLE = {Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00)},
ORGANIZATION = {Association for Computing Machinery (ACM SIGACT)},
PADDRESS = {New York, USA},
ADDRESS = {Tokyo, Japan},
PUBLISHER = {ACM Press},
MONTH = {April},
ISBN = {1-58113-186-0},
YEAR = {2000},
PAGES = {15--24},
ABSTRACT = {\begin{abstract}
Rigid body docking approaches are not sufficient to predict the structure of a
protein complex from the unbound (native) structures of the two proteins.
Accounting for side--chain flexibility is an important step towards fully
flexible protein docking. This work describes an approach that allows
conformational flexibility for the side--chains while keeping the protein
backbone rigid. Starting from candidates created by a rigid docking
algorithm, we demangle the side--chains of the docking site, thus creating
reasonable approximations of the true complex structure. These structures are
ranked with respect to the binding free energy. We present two new techniques
for side--chain demangling. Both approaches are based on a discrete
representation of the side--chain conformational space by the use of a rotamer
library. This leads to a combinatorial optimization problem. For the solution
of this problem we propose a fast heuristic approach and an exact, albeit
slower method using branch--\&--cut techniques. As a test set we use the
unbound structures of three proteases and the corresponding protein
inhibitors. For each of the examples the highest--ranking conformation
produced was a good approximation of the true complex structure.
\end{abstract}
},
}
@INPROCEEDINGS{AKX08,
AUTHOR = {Albrecht, Marc and Karrenbauer, Andreas and Xu, Chihao},
TITLE = {A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight},
BOOKTITLE = {Proceedings of the 28th International Display Research Conference (IDRC)},
PADDRESS = {Campbell, USA},
ADDRESS = {Orlando, Florida, USA},
PUBLISHER = {SID Society for Information Display},
MONTH = {November},
YEAR = {2008},
PAGES = {286--289},
}
@ARTICLE{Albers-et-al95,
AUTHOR = {Albers, Susanne and von Stengel, Bernhard and Wechner, Ralph},
JOURNAL = {Information Processing Letters},
TITLE = {A combined BIT and TIMESTAMP algorithm for the list update problem},
NUMBER = {3},
PUBLISHER = {Elsevier},
VOLUME = {56},
ISBN = {0020-0190},
YEAR = {1995},
PAGES = {135--139},
}
@INPROCEEDINGS{Albers-Koga95,
AUTHOR = {Albers, Susanne and Koga, Hisashi},
EDITOR = {Akl, Selim G. and Dehne, Frank and Sack, J{\"o}rg-R{\"u}diger and Santoro, Nicola},
TITLE = {Page migration with limited local memory capacity},
BOOKTITLE = {Algorithms and Data Structures: 4th International Workshop (WADS95)},
PADDRESS = {Berlin},
ADDRESS = {Kingston, Canada},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {955},
YEAR = {1995},
PAGES = {412--158},
}
@ARTICLE{Albers1998a,
AUTHOR = {Albers, Susanne},
JOURNAL = {Theoretical Computer Science},
TITLE = {A competitive analysis of the list update problem with lookahead},
NUMBER = {1/2},
VOLUME = {197},
ISBN = {0304-3975},
YEAR = {1998},
PAGES = {95--109},
}
@ARTICLE{Albers1998b,
AUTHOR = {Albers, Susanne},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Improved randomized on-line algorithms for the list update problem},
NUMBER = {3},
VOLUME = {27},
ISBN = {0097-5397},
YEAR = {1998},
PAGES = {682--693},
}
@PHDTHESIS{Albers1999,
AUTHOR = {Albers, Susanne},
TITLE = {{Online-Algorithmen}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Habilitation thesis},
YEAR = {1999},
}
@ARTICLE{Albers2000,
AUTHOR = {Albers, Susanne},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Better bounds for online scheduling},
ADDRESS = {Philadelphia, USA},
NUMBER = {2},
PUBLISHER = {SIAM},
VOLUME = {29},
ISBN = {0097-5397},
YEAR = {1999},
PAGES = {459--473},
}
@INPROCEEDINGS{Albers95,
AUTHOR = {Albers, Susanne},
TITLE = {Improved randomized on-line algorithms for the list update problem},
BOOKTITLE = {6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95)},
PADDRESS = {New York},
ADDRESS = {San Francisco, California, USA},
PUBLISHER = {acm-Press},
YEAR = {1995},
PAGES = {412--419},
}
@INPROCEEDINGS{Albers96,
AUTHOR = {Albers, Susanne and Mitzenmacher, Michael},
EDITOR = {Meyer auf der Heide, Friedhelm and Monien, Burkhard},
TITLE = {Average Case Analysis of List Update Algorithms, with Applications to Data Compression},
BOOKTITLE = {Automata, Languages and Programming: 23rd International Colloquium (ICALP'96)},
PADDRESS = {Berlin},
ADDRESS = {Paderborn, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1099},
YEAR = {1996},
PAGES = {514--525},
}
@INPROCEEDINGS{Albers97a,
AUTHOR = {Albers, Susanne},
TITLE = {Better Bounds for Online Scheduling},
BOOKTITLE = {Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97)},
ORGANIZATION = {Association of Computing Machinery (ACM)},
PADDRESS = {New York},
ADDRESS = {El Paso, Texas},
PUBLISHER = {ACM Press},
YEAR = {1997},
PAGES = {130--139},
}
@ARTICLE{Albers97b,
AUTHOR = {Albers, Susanne},
JOURNAL = {Algorithmica},
TITLE = {On the Influence of Lookahead in Competitive Paging Algorithms},
NUMBER = {3},
VOLUME = {18},
YEAR = {1997},
PAGES = {283--305},
}
@INPROCEEDINGS{AlbersAroraKhanna1999,
AUTHOR = {Albers, Susanne and Arora, Sanjeev and Khanna, Sanjeev},
TITLE = {Page replacement for general caching problems},
BOOKTITLE = {Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99)},
PADDRESS = {New York, USA},
ADDRESS = {Baltimore, USA},
PUBLISHER = {ACM},
ISBN = {0-89871-434-6},
YEAR = {1999},
PAGES = {31--40},
}
@INPROCEEDINGS{AlbersCharikarMitzenmacher1998,
AUTHOR = {Albers, Susanne and Charikar, Moses and Mitzenmacher, Michael},
TITLE = {On delayed information and action in on-line algorithms},
BOOKTITLE = {Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS-98)},
PADDRESS = {Los Alamitos, USA},
ADDRESS = {Palo Alto, USA},
PUBLISHER = {IEEE},
YEAR = {1998},
PAGES = {71--80},
}
@INPROCEEDINGS{AlbersGargLeonardi1998,
AUTHOR = {Albers, Susanne and Garg, Naveen and Leonardi, Stefano},
TITLE = {Minimizing stall time in single and parallel disk systems},
BOOKTITLE = {Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98)},
PADDRESS = {New York, USA},
ADDRESS = {Dallas, USA},
PUBLISHER = {ACM Press},
YEAR = {1998},
PAGES = {454--462},
}
@ARTICLE{AlbersGargLeonardi2000,
AUTHOR = {Albers, Susanne and Garg, Naveen and Leonardi, Stefano},
JOURNAL = {Journal of the ACM},
TITLE = {Minimizing stall time in single and parallel disk systems},
ADDRESS = {New York, USA},
NUMBER = {6},
PUBLISHER = {ACM Press},
VOLUME = {47},
ISBN = {0004-5411},
YEAR = {2000},
PAGES = {969--986},
}
@ARTICLE{AlbersHagerup97,
AUTHOR = {Albers, Susanne and Hagerup, Torben},
JOURNAL = {Information and Computation},
TITLE = {Improved Parallel Integer Sorting without Concurrent Writing},
NUMBER = {1},
MONTH = {July},
VOLUME = {136},
YEAR = {1997},
PAGES = {25--51},
}
@INPROCEEDINGS{AlbersHenzinger97,
AUTHOR = {Albers, Susanne and Henzinger, Monika R.},
TITLE = {Exploring Unknown Environments},
BOOKTITLE = {Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97)},
ORGANIZATION = {Association of Computing Machinery (ACM)},
PADDRESS = {New York},
ADDRESS = {El Paso, Texas},
PUBLISHER = {ACM Press},
YEAR = {1997},
PAGES = {416--425},
}
@ARTICLE{AlbersKoga1998,
AUTHOR = {Albers, Susanne and Koga, Hisashi},
JOURNAL = {Journal of Algorithms},
TITLE = {New on-line algorithms for the page replication problem},
VOLUME = {27},
ISBN = {0196-6774},
YEAR = {1998},
PAGES = {75--96},
}
@INPROCEEDINGS{AlbersKursaweSchuierer1999,
AUTHOR = {Albers, Susanne and Kursawe, Klaus},
TITLE = {Exploring unknown environments with obstacles},
BOOKTITLE = {Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99)},
PADDRESS = {New York, USA},
ADDRESS = {Baltimore, USA},
PUBLISHER = {ACM},
YEAR = {1999},
PAGES = {842--843},
}
@ARTICLE{AlbersMitzenmacher1998a,
AUTHOR = {Albers, Susanne and Mitzenmacher, Michael},
JOURNAL = {Algorithmica},
TITLE = {Average case analyses of list update algorithms, with applications to data compression},
NUMBER = {3},
VOLUME = {21},
ISBN = {0178-4617},
YEAR = {1998},
PAGES = {312--329},
}
@INPROCEEDINGS{AlbersMitzenmacher1998b,
AUTHOR = {Albers, Susanne and Mitzenmacher, Michael},
TITLE = {Average case analyses of First-Fit and Random-Fit bin packing},
BOOKTITLE = {Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98)},
PADDRESS = {New York, USA},
ADDRESS = {San Francisco, USA},
PUBLISHER = {ACM Press / SIAM},
YEAR = {1998},
PAGES = {290--299},
}
@ARTICLE{AlbersMitzenmacher97,
AUTHOR = {Albers, Susanne and Mitzenmacher, Michael},
JOURNAL = {Information Processing Letters},
TITLE = {Revisiting the COUNTER algorithms for list update},
NUMBER = {3},
VOLUME = {64},
YEAR = {1997},
PAGES = {155--160},
}
@INCOLLECTION{AlbersWestbrook1998,
AUTHOR = {Albers, Susanne and Westbrook, Jeffery},
EDITOR = {Fiat, Amos and Woeginger, Gerhard J.},
TITLE = {Self-organizing data structures},
BOOKTITLE = {Online Algorithms: The State of the Art},
ADDRESS = {Berlin, Germany},
PUBLISHER = {Springer},
MONTH = {January},
SERIES = {Springer Lecture Notes in Computer Science},
VOLUME = {1442},
YEAR = {1998},
PAGES = {13--51},
}
@ARTICLE{Albers/Mitzenmacher/2000,
AUTHOR = {Albers, Susanne and Mitzenmacher, Michael},
JOURNAL = {Random Structures \& Algorithms},
TITLE = {Average-Case Analyses of First Fit and Random Fit Bin Packing},
ADDRESS = {New York, USA},
NUMBER = {3},
PUBLISHER = {Wiley},
MONTH = {May},
VOLUME = {16},
YEAR = {2000},
PAGES = {240 -- 259},
}
@INPROCEEDINGS{Alberts-et-al-98,
AUTHOR = {Alberts, David and Cattaneo, G and Italiano, Giuseppe and Nanni, Umberto and Zaroliagis, Christos},
EDITOR = {Battiti, R and Bertosi, A},
TITLE = {A Software Library of Dynamic Graph Algorithms},
BOOKTITLE = {Proceedings of Workshop on Algorithms and Experiments (ALEX-98)},
PADDRESS = {Trento, Italy},
ADDRESS = {Trento, Italy},
PUBLISHER = {University of Trento},
YEAR = {1998},
PAGES = {129--136},
ABSTRACT = {We report on a software library of dynamic graph algorithms.
It was written in \CC as an extension of LEDA, the library
of efficient data types and algorithms. It contains implementations
of simple data structures as well as of sophisticated data
structures for dynamic connectivity, dynamic minimum spanning trees,
dynamic single source shortest paths, and dynamic transitive
closure. All data structures are implemented by classes derived
from a common base class, thus they have a common interface.
Additionally, the base class is in charge of keeping all dynamic
data structures working on the same graph consistent.
It is possible to change the structure of a graph by a procedure
which is not aware of the dynamic data structures initialized for
this graph. The library is easily extendible.},
}
@PROCEEDINGS{Albrecht:1987:PAA,
EDITOR = {Albrecht, Andreas and Jung, Hermann and Mehlhorn, Kurt},
TITLE = {Parallel algorithms and architectures (WPAA-87) : international workshop},
PADDRESS = {Berlin, Germany},
ADDRESS = {Suhl, FRG},
PUBLISHER = {Akademie-Verlag},
SERIES = {Mathematical research / Mathematische Forschung},
VOLUME = {38},
ISBN = {3-05-500397-7},
YEAR = {1987},
PAGES = {205},
}
@PROCEEDINGS{Albrecht:1987:PAA,
EDITOR = {Albrecht, Andreas and Jung, Hermann and Mehlhorn, Kurt},
TITLE = {Parallel algorithms and architectures : International Workshop},
PADDRESS = {Berlin, Germany},
ADDRESS = {Suhl, FRG},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {269},
ISBN = {3-540-18099-0},
YEAR = {1987},
PAGES = {205},
}
@INPROCEEDINGS{Albrecht:1987:PAAa,
AUTHOR = {Alt, Helmut and Hagerup,Torben and Mehlhorn, Kurt and Preparata, Franco P.},
EDITOR = {Albrecht, Andreas and Jung, Hermann and Mehlhorn, Kurt},
TITLE = {Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones},
BOOKTITLE = {Parallel Algorithms and Architectures : International Workshop},
PADDRESS = {Berlin, Germany},
ADDRESS = {Suhl, FRG},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {269},
ISBN = {3-540-18099-0},
YEAR = {1987},
PAGES = {11--15},
}
@ARTICLE{AlcarayFKKMPB2012,
AUTHOR = {Alcaraz, Nicolas and Friedrich, Tobias and K{\"o}tzing, Timo and Krohmer, Anton and M{\"u}ller, Joachim and Pauling, Josch and Baumbach, Jan},
JOURNAL = {Integrative Biology},
TITLE = {Efficient key pathway mining: combining networks and {OMICS} data},
ADDRESS = {London},
NUMBER = {7},
PUBLISHER = {The Royal Society of Chemistry},
VOLUME = {4},
ISBN = {1757-9694},
DOI = {10.1039/C2IB00133K},
YEAR = {2012},
PAGES = {756--764},
}
@ARTICLE{ALGOR::FleischerMRWY1992,
AUTHOR = {Fleischer, Rudolf and Mehlhorn, Kurt and Rote, G{\"u}nter and Welzl, Emo and Yap, Chee-Keng},
JOURNAL = {Algorithmica},
TITLE = {Simultaneous Inner and Outer Approximation of Shapes},
ADDRESS = {Berlin, Germany},
NUMBER = {5/6},
PUBLISHER = {Springer},
VOLUME = {8},
YEAR = {1992},
PAGES = {365--389},
}
@ARTICLE{ALGOR::MehlhornN1990,
AUTHOR = {Mehlhorn, Kurt and N{\"a}her, Stefan},
JOURNAL = {Algorithmica},
TITLE = {Dynamic Fractional Cascading},
VOLUME = {5},
YEAR = {1990},
PAGES = {215--241},
}
@ARTICLE{ALGOR::MehlhornPS1986,
AUTHOR = {Mehlhorn, Kurt and Preparata, Franco P. and Sarrafzadeh, Maji},
JOURNAL = {Algorithmica},
TITLE = {Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs},
ADDRESS = {Berlin, Germany},
NUMBER = {2},
PUBLISHER = {Springer},
VOLUME = {1},
YEAR = {1986},
PAGES = {213--221},
}
@ARTICLE{ALKM2001,
AUTHOR = {Althaus, Ernst and Kohlbacher, Oliver and Lenhof, Hans-Peter and M{\"u}ller, Peter},
JOURNAL = {Journal of Computational Biology},
TITLE = {A combinatorial approach to protein docking with flexible side chains},
ADDRESS = {New York, USA},
NUMBER = {4},
PUBLISHER = {Liebert},
MONTH = {August},
VOLUME = {9},
ISBN = {1066-5277},
YEAR = {2002},
PAGES = {597--612},
}
@INPROCEEDINGS{ALNA2008,
AUTHOR = {Althaus, Ernst and Naujoks, Rouven},
EDITOR = {McGeoch, Catherine C.},
TITLE = {Reconstructing Phylogenetic Networks with One Recombination},
BOOKTITLE = {Experimental Algorithms, 7th International Workshop, {WEA} 2008},
PADDRESS = {Berlin, Germany},
ADDRESS = {Massachusetts, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5038},
ISBN = {978-3-540-68548-7},
YEAR = {2008},
PAGES = {275--288},
}
@INPROCEEDINGS{ALOH:08.soft,
AUTHOR = {Angelopoulos, Spyros and Lopez-Ortiz, Alejandro and Hamel,Angele},
TITLE = {Optimal Scheduling of Contract Algorithms with Soft Deadlines},
BOOKTITLE = {23rd National Conference on Artificial Intelligence (AAAI 2008)},
PADDRESS = {Menlo Park},
ADDRESS = {Chicago},
PUBLISHER = {AAAI press},
YEAR = {2008},
PAGES = {868--873},
}
@INPROCEEDINGS{AlPoVa2003-lpimprove,
AUTHOR = {Althaus, Ernst and Polzin, Tobias and Vahdati Daneshmand, Siavash},
EDITOR = {Jansen, Klaus and Margraf, Marian and Mastrolli, Monaldo and Rolim, Jos{\'e} D. P.},
TITLE = {Improving Linear Programming Approaches for the {Steiner} Tree Problem},
BOOKTITLE = {Experimental and efficient algorithms : Second International Workshop, WEA 2003},
PADDRESS = {Berlin, Germany},
ADDRESS = {Ascona, Switzerland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2647},
YEAR = {2003},
PAGES = {1--14},
NOTE = {Pages are not yet known},
ABSTRACT = {We present two theoretically interesting and empirically successful
techniques for improving the linear programming approaches, namely
graph transformation and local cuts, in the context of the
Steiner problem. We show the impact of these techniques on the
solution of the largest benchmark instances ever solved.},
}
@TECHREPORT{Alt02/87,
AUTHOR = {Alt, Helmut and Mehlhorn, Kurt and Wagener, Hubert and Welzl, Emo},
TITLE = {Congruence, similarity and symmetries of geometric objects},
INSTITUTION = {Universit{\"a}t des Saarlandes / Fachbereich Informatik},
TYPE = {Technischer Bericht},
ADDRESS = {Saarbr{\"u}cken},
NUMBER = {A 02/87},
YEAR = {1987},
PAGES = {17S.},
}
@INPROCEEDINGS{AltCan2008,
AUTHOR = {Althaus, Ernst and Canzar, Stefan},
TITLE = {LASA: A tool for non-heuristic alignment of multiple sequences},
BOOKTITLE = {Bioinformatics Research and Development (BIRD’08)},
PADDRESS = {Heidelberg},
ADDRESS = {Vienna, Austria},
PUBLISHER = {Springer},
YEAR = {2008},
PAGES = {489--498},
}
@ARTICLE{AltCanJOC08,
AUTHOR = {Althaus, Ernst and Canzar, Stefan},
JOURNAL = {Journal of Combinatorial Optimization},
TITLE = {A Lagrangian relaxation approach for the multiple sequence alignment problem},
VOLUME = {16},
YEAR = {2008},
PAGES = {127--154},
}
@INPROCEEDINGS{AltCanKar08,
AUTHOR = {Althaus, Ernst and Canzar, Stefan and Emmett, Mark and Karrenbauer, Andreas and Marshall, Alan and Meyer-B{\"a}se, Anke and Zhang, Huimin},
TITLE = {Computing H/D-exchange speeds of single residues from data of peptic fragments},
BOOKTITLE = {23rd Annual ACM Symposium on Applied Computing (SAC)},
PADDRESS = {New York},
ADDRESS = {Fortaleza, Brazil},
PUBLISHER = {ACM},
YEAR = {2008},
PAGES = {1273--1277},
}
@ARTICLE{AltGuibasMehlhornKarp96,
AUTHOR = {Alt, Helmut and Guibas, L. and Mehlhorn, Kurt and Karp, Richard M. and Wigderson, A.},
JOURNAL = {Algorithmica},
TITLE = {A Method for Obtaining Randomized Algorithms with Small Tail Probabilities},
ADDRESS = {New York, USA},
NUMBER = {4/5},
PUBLISHER = {Springer},
VOLUME = {16},
ISBN = {0178-4617},
DOI = {10.1007/BF01940879},
YEAR = {1996},
PAGES = {543--547},
ABSTRACT = {We study strategies for converting randomized algorithms of the Las Vegas type
into randomized algorithms with small tail probabilities.},
}
@INPROCEEDINGS{Althaus-et-al:experimental-curve,
AUTHOR = {Althaus, Ernst and Mehlhorn, Kurt and N{\"a}her, Stefan and Schirra, Stefan},
TITLE = {Experiments on curve reconstruction},
BOOKTITLE = {Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00)},
PADDRESS = {Albuquerque, USA},
ADDRESS = {San Francisco, USA},
PUBLISHER = {University of New Mexico},
MONTH = {January},
YEAR = {2000},
PAGES = {103--114},
}
@ARTICLE{althaus-mehlhorn98,
AUTHOR = {Althaus, Ernst and Mehlhorn, Kurt},
JOURNAL = {Information Processing Letters},
TITLE = {Maximum Network Flow with Floating Point Arithmetic},
NUMBER = {3},
VOLUME = {66},
ISBN = {0020-0190},
YEAR = {1998},
PAGES = {109--113},
ABSTRACT = {We discuss the implementation of network flow algorithms in floating point
arithmetic. We give an example to illustrate the difficulties that may arise
when floating point arithmetic is used without care. We describe an iterative
improvement scheme that can be put around any network flow algorithm for
integer capacities. The scheme carefully scales the capacities such that all
integers arising can be handled exactly using floating point arithmetic. Let n
and m be the number of nodes and edges of the network, respectively. For m 109
and with double precision floating point arithmetic, the number of iterations
is always bounded by three, and the relative error in the flow value is at most
2−19. For m 106 and with double precision arithmetic, the relative error after
the first iteration is bounded by 10−3. },
}
@MASTERSTHESIS{Althaus1998,
AUTHOR = {Althaus, Ernst},
TITLE = {{Berechnung optimaler Steinerb{\"a}ume in der Ebene}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {December},
YEAR = {1998},
}
@PHDTHESIS{Althaus2001d,
AUTHOR = {Althaus, Ernst},
TITLE = {Curve Reconstruction and the Traveling Salesman Problem},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
MONTH = {April},
YEAR = {2001},
}
@INPROCEEDINGS{Althaus2002,
AUTHOR = {Althaus, Ernst and Bockmayr, Alexander and Elf, Matthias and Kasper, Thomas and J{\"u}nger, Michael and Mehlhorn, Kurt},
EDITOR = {M{\"o}hring, Rolf and Raman, Rajeev},
TITLE = {{SCIL} - Symbolic Constraints in Integer Linear Programming.},
BOOKTITLE = {Algorithms - ESA 2002 : 10th Annual European Symposium},
PADDRESS = {Berlin, Germany},
ADDRESS = {Rom, Italy},
PUBLISHER = {Springer},
MONTH = {September},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2461},
ISBN = {3-540-44180-8},
YEAR = {2002},
PAGES = {75--87},
ABSTRACT = {We describe a new software system SCIL that introduces symbolic constraints
into branch-and-cut-and-price algorithms for integer linear programs. Symbolic
constraints are known from constraint programming and contribute significantly
to the expressive power, ease of use, and efficiency of constraint programming
systems.},
}
@INPROCEEDINGS{Althaus2002a,
AUTHOR = {Althaus, Ernst and Fink, Christian},
EDITOR = {Cook, William J. and Schulz, Andreas S.},
TITLE = {A Polyhedral Approach to Surface Reconstruction from Planar Contours.},
BOOKTITLE = {Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization},
PADDRESS = {Berlin, Germany},
ADDRESS = {Cambridge, USA},
PUBLISHER = {Springer},
MONTH = {May},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2337},
ISBN = {3-540-43676-6},
YEAR = {2002},
PAGES = {258--272},
ABSTRACT = {We investigate the problem of reconstruction a surface given its contours on
parallel slices. We present a branch-and-cut algorithm which computes the
surface with the minimal area. This surface is assumed to be the best
reconstruction since a long time. Nevertheless there were no algorithms to
compute this surface. Our experiments show that the running time of our
algorithm is very reasonable and that the computed surfaces are highly similar
to the original surfaces.},
}
@INPROCEEDINGS{Althaus2002b,
AUTHOR = {Althaus, Ernst and Caprara, Alberto and Lenhof, Hans-Peter and Reinert, Knut},
EDITOR = {Lengauer, Thomas},
TITLE = {Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics},
BOOKTITLE = {Proceedings of the European Conference on Computational Biology (ECCB 2002)},
PADDRESS = {Oxford, UK},
ADDRESS = {Saarbr{\"u}cken},
NUMBER = {Supplement 2},
PUBLISHER = {Oxford University Press},
MONTH = {October},
SERIES = {Bioinformatics},
VOLUME = {18},
YEAR = {2002},
PAGES = {S4--S16},
ABSTRACT = {Multiple sequence alignment is one of the dominant problems in computational
molecular biology. Numerous scoring functions and methods have been proposed,
most of which result in NP-hard problems. In this paper we propose for the
first time a general formulation for multiple alignment with arbitrary
gap-costs based on an integer linear program (ILP). In addition we describe a
branch-and-cut algorithm to effectively solve the ILP to optimality. We
evaluate the performances of our approach in terms of running time and quality
of the alignments using the BAliBase database of reference alignments. The
results show that our implementation ranks amongst the best programs developed
so far.},
}
@INPROCEEDINGS{Althaus2003,
AUTHOR = {Althaus, Ernst and Calinescu, Gruia and Mandoiu, Ion and Prasad, Sushil and Tchervenski, Nickolay and Zelikovsly, Alexander},
TITLE = {Power Efficient Range Assignment in Ad-hoc Wireless},
BOOKTITLE = {Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03)},
PADDRESS = {New Orleans, USA},
ADDRESS = {New Orleans, USA},
PUBLISHER = {IEEE},
MONTH = {March},
YEAR = {2003},
PAGES = {1889--1894},
}
@INPROCEEDINGS{Althaus2004,
AUTHOR = {Althaus, Ernst and Karamanis, Nikiforos and Koller, Alexander},
TITLE = {Computing Locally Coherent Discourses.},
BOOKTITLE = {Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics},
PADDRESS = {East Stroudsburg, USA},
ADDRESS = {Barcelona, Spain},
PUBLISHER = {ACL},
ISBN = {1-932432-34-5},
YEAR = {2004},
PAGES = {399--406},
ABSTRACT = {We present the first algorithm that computes optimal orderings of
sentences into a locally coherent discourse. The algorithm runs very
efficiently on a variety of coherence measures from the literature. We
also show that the discourse ordering problem is NP-complete and
cannot be approximated.},
}
@ARTICLE{Althaus2006,
AUTHOR = {Althaus, Ernst and Calinescu, Gruia and Mandoiu, Ion and Prasad, Sushil and Tchervenski, Nickolay and Zelikovsly, Alexander},
JOURNAL = {Wireless Networks},
TITLE = {Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks},
NUMBER = {3},
VOLUME = {12},
YEAR = {2006},
PAGES = {287--299},
}
@ARTICLE{Althaus2006,
AUTHOR = {Althaus, Ernst and Caprara, Alberto and Lenhof, Hans-Peter and Reinert, Knut},
JOURNAL = {Mathematical Programming},
TITLE = {Aligning multiple sequences by cutting planes},
VOLUME = {2006},
YEAR = {2006},
PAGES = {387--425},
}
@ARTICLE{Althaus2006a,
AUTHOR = {Althaus, Ernst and Calinescu, Gruia and Mandoiu, Ion and Prasad, Sushil and Tchervenski, Nickolay and Zelikovsly, Alexander},
JOURNAL = {Wireless Networks},
TITLE = {Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks},
NUMBER = {3},
VOLUME = {12},
YEAR = {2006},
PAGES = {287--299},
}
@INPROCEEDINGS{Althaus2007,
AUTHOR = {Althaus, Ernst and Canzar, Stefan},
EDITOR = {Dress, Andreas and Xu, Yinfeng and Zhu, Binhai},
TITLE = {A Lagrangian relaxation approach for the multiple sequence alignment problem},
BOOKTITLE = {Combinatorial Optimization and Applications : First International Conference, COCOA 2007},
PADDRESS = {New York, USA},
ADDRESS = {Xi'an, Shaanxi, China},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4616},
DOI = {10.1007/978-3-540-73556-4_29},
YEAR = {2007},
PAGES = {267--278},
}
@INPROCEEDINGS{Althaus2007a,
AUTHOR = {Althaus, Ernst and Baumann, Tobias and Sch{\"o}mer, Elmar and Werth, Kai},
TITLE = {Trunk Packing Revisited},
BOOKTITLE = {Experimental Algorithms, 6th International Workshop},
PADDRESS = {New York, USA},
ADDRESS = {Rome, Italy},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4525},
YEAR = {2007},
PAGES = {420--432},
}
@INPROCEEDINGS{Althaus2011,
AUTHOR = {Althaus, Ernst and Kupilas, Joschka and Naujoks, Rouven},
EDITOR = {Ogihara, Mitsunori and Tarui, Jun},
TITLE = {On the Low-Dimensional {Steiner} Minimum Tree Problem in {Hamming} Metric},
BOOKTITLE = {Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011},
PADDRESS = {Heidelberg},
ADDRESS = {Tokyo, Japan},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6648},
ISBN = {978-3-642-20876-8},
DOI = {10.1007/978-3-642-20877-5_31},
YEAR = {2011},
PAGES = {308--319},
NOTE = {to appear},
}
@INPROCEEDINGS{AlthausD09,
AUTHOR = {Althaus, Ernst and Dumitriu, Daniel},
EDITOR = {Vahrenhold, Jan},
TITLE = {Fast and Accurate Bounds on Linear Programs},
BOOKTITLE = {Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009)},
PADDRESS = {Berlin},
ADDRESS = {Dortmund, Germany},
PUBLISHER = {Springer},
MONTH = {June},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5526},
ISBN = {978-3-642-02010-0},
DOI = {10.1007/978-3-642-02011-7_6},
YEAR = {2009},
PAGES = {40--50},
}
@INPROCEEDINGS{AlthausMehlhorn1999,
AUTHOR = {Althaus, Ernst and Mehlhorn, Kurt},
TITLE = {TSP-Based Curve Reconstruction in Polynomial Time},
BOOKTITLE = {Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00)},
ORGANIZATION = {ACM Special Interest Group on Algorithms and Computation Theory and SIAM Activity Group on Discrete Mathematics},
PADDRESS = {New York, USA},
ADDRESS = {San Francisco, USA},
PUBLISHER = {ACM},
ISBN = {0-89871-453-2},
YEAR = {2000},
PAGES = {686--695},
ABSTRACT = {An instance of the curve reconstruction problem is a finite sample set $V$ of an
unknown curve $\gamma$. The task is to connect the points in $V$ in the
order in which they lie on $\gamma$. Giesen~\cite{SCG99*207} showed recently
that the Traveling Salesman tour of $V$ solves the reconstruction problem under
fairly week assumptions on $\gamma$ and $V$. We extend his result along three
dimensions. We weaken the assumptions, give an alternate proof, and
show that in the context of curve reconstruction,
the Traveling Salesman tour can be constructed in polynomial time.},
}
@ARTICLE{AltMeh2001j,
AUTHOR = {Althaus, Ernst and Mehlhorn, Kurt},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Traveling Salesman-Based Curve Reconstruction in Polynomial Time},
ADDRESS = {Philadelphia, USA},
NUMBER = {1},
PUBLISHER = {SIAM},
VOLUME = {31},
ISBN = {0097-5397},
YEAR = {2001},
PAGES = {27--66},
ABSTRACT = {An instance of the curve reconstruction problem is a finite sample set $V$ of an
unknown curve $\gamma$. The task is to connect the points in $V$ in the
order in which they lie on $\gamma$. Giesen~\cite{Giesen:TSP} showed recently
that the Traveling Salesman tour of $V$ solves the reconstruction problem under
fairly week assumptions on $\gamma$ and $V$. We extend his result along three
dimensions. We weaken the assumptions, give an alternate proof, and
show that in the context of curve reconstruction,
the Traveling Salesman tour can be constructed in polynomial time. },
}
@INPROCEEDINGS{AlvarezBCS12,
AUTHOR = {Alvarez, Victor and Bringmann, Karl and Curticapean, Radu and Ray, Saurabh},
EDITOR = {Dey, Tamal K. and Whitesides, Sue},
TITLE = {Counting Crossing Free Structures},
BOOKTITLE = {Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12)},
ORGANIZATION = {ACM},
PADDRESS = {New York, NY},
ADDRESS = {Chapel Hill, NC, USA},
PUBLISHER = {ACM},
ISBN = {978-1-4503-1299-8},
DOI = {10.1145/2261250.2261259},
YEAR = {2012},
PAGES = {61--68},
ABSTRACT = {Let P be a set of n points in the plane. A crossing-free structure on P is a
straight-edge planar graph with vertex set in P. Examples of crossing-free
structures include triangulations of P, and spanning cycles of P, also known as
polygonalizations of P, among others. There has been a large amount of research
trying to bound the number of such structures. In particular, bounding the
number of triangulations spanned by P has received considerable attention. It
is currently known that every set of n points has at most O(30^n) and at least Ω
(2.43^n) triangulations. However, much less is known about the algorithmic
problem of counting crossing-free structures of a given set P. For example, no
algorithm for counting triangulations is known that, on all instances, performs
faster than enumerating all triangulations. In this paper we develop a general
technique for computing the number of crossing-free structures of an input set
P. We apply the technique to obtain algorithms for computing the number of
triangulations and spanning cycles of P. The running time of our algorithms is
upper bounded by n^O(k), where k is the number of onion layers of P. In
particular, we show that our algorithm for counting triangulations is not
slower than O(3.1414^n). Given that there are several well-studied
configurations of points with at least Ω(3.464^n) triangulations, and some even
with Ω(8^n) triangulations, our algorithm is the first to asymptotically
outperform any enumeration algorithm for such instances. In fact, it is widely
believed that any set of n points must have at least Ω(3.464^n) triangulations.
If this is true, then our algorithm is strictly sub-linear in the number of
triangulations counted. We also show that our techniques are general enough to
solve the restricted triangulation counting problem, which we prove to be
W[2]-hard in the parameter k. This implies a “no free lunch” result: In order
to be fixed-parameter tractable, our general algorithm must rely on additional
properties that are specific to the considered class of structures. },
}
@INPROCEEDINGS{AlvarezBRS13,
AUTHOR = {Alvarez, Victor and Bringmann, Karl and Ray, Saurabh and Seidel, Raimund},
TITLE = {Counting Triangulations Approximately},
BOOKTITLE = {25th Canadian Conference on Computational Geometry (CCCG-13)},
PADDRESS = {Waterloo, Ontario, Canada},
ADDRESS = {Waterloo, Ontario, Canada},
YEAR = {2013},
PAGES = {85--89},
}
@INPROCEEDINGS{AmaldiIulianoetal009,
AUTHOR = {Amaldi, Edoardo and Iuliano, Claudio and Jurkiewicz, Tomasz and Mehlhorn, Kurt and Rizzi, Romeo},
EDITOR = {Fiat, Amos and Sanders, Peter},
TITLE = {Breaking the {$O(m^2n)$} Barrier for Minimum Cycle Bases},
BOOKTITLE = {Algorithms - ESA 2009 : 17th Annual European Symposium},
PADDRESS = {Berlin, Germany},
ADDRESS = {Copenhagen, Denmark},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5757},
ISBN = {978-3-642-04127-3},
DOI = {10.1007/978-3-642-04128-0_28},
YEAR = {2009},
PAGES = {301--312},
}
@INPROCEEDINGS{AmbalathBalasundaramHKoppulaMisraPhilipRamanujan2010,
AUTHOR = {Ambalath, Abhimanyu M. and Balasundaram, Radheshyam and H., Chintan Rao and Koppula, Venkata and Misra, Neeldhara and Philip, Geevarghese and Ramanujan, M. S.},
EDITOR = {Raman, Venkatesh and Saurabh, Saket},
TITLE = {On the Kernelization Complexity of Colorful Motifs},
BOOKTITLE = {Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings},
PADDRESS = {Berlin},
ADDRESS = {Chennai, India},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6478},
ISBN = {978-3-642-17492-6},
DOI = {10.1007/978-3-642-17493-3},
YEAR = {2010},
PAGES = {14--25},
ABSTRACT = {The {\sc Colorful Motif} problem asks if, given a vertex-colored
graph $G$, there exists a subset $S$ of vertices of $G$ such
that the graph induced by $G$ on $S$ is connected and contains
every color in the graph exactly once. The problem is motivated
by applications in computational biology and is also
well-studied from the theoretical point of view. In particular,
it is known to be NP-complete even on trees of maximum degree
three~[Fellows et al, ICALP 2007]. In their pioneering paper
that introduced the color-coding technique, Alon et al.~[STOC
1995] show, {\em inter alia}, that the problem is FPT on general
graphs. More recently, Cygan et al.~[WG 2010] showed that {\sc
Colorful Motif} is NP-complete on {\em comb graphs}, a special
subclass of the set of trees of maximum degree three. They also
showed that the problem is not likely to admit polynomial
kernels on forests.
We continue the study of the kernelization
complexity of the {\sc Colorful Motif} problem restricted to
simple graph classes. Surprisingly, the infeasibility of
polynomial kernelization persists even when the input is
restricted to comb graphs. We demonstrate this by showing a
simple but novel composition algorithm. Further, we show that
the problem restricted to comb graphs admits polynomially many
polynomial kernels. To our knowledge, there are very few
examples of problems with many polynomial kernels known in the
literature. We also show hardness of polynomial kernelization
for certain variants of the problem on trees; this rules out a
general class of approaches for showing many polynomial kernels
for the problem restricted to trees. Finally, we show that the
problem is unlikely to admit polynomial kernels on another
simple graph class, namely the set of all graphs of diameter
two. As an application of our results, we settle the classical complexity of
\cds{} on graphs of diameter two --- specifically, we show that it is \NPC.},
}
@ARTICLE{AmGoRa01,
AUTHOR = {Ramos, Edgar A. and Amato, Nancy M. and Goodrich, Michael T.},
JOURNAL = {Discrete and Computational Geometry},
TITLE = {A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time},
ADDRESS = {New York, USA},
NUMBER = {2},
PUBLISHER = {Springer},
MONTH = {September},
VOLUME = {26},
ISBN = {0179-5376},
YEAR = {2001},
PAGES = {246--265},
}
@ARTICLE{Amini2009a,
AUTHOR = {Amini, Omid and P{\'e}rennes, St{\'e}phane and Sau, Ignasi},
JOURNAL = {Theoretical Computer Science},
TITLE = {Hardness and approximation of traffic grooming},
ADDRESS = {Amsterdam, The Netherland},
NUMBER = {38-40},
PUBLISHER = {Elsevier},
VOLUME = {410},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2009.04.028},
YEAR = {2009},
PAGES = {3751--3760},
}
@INPROCEEDINGS{Aminietal2009,
AUTHOR = {Amini, Omid and Peleg, David and P{\'e}rennes, St{\'e}phane and Sau, Ignasi and Saurabh, Saket},
EDITOR = {Bampis, Evripidis and Skutella, Martin},
TITLE = {Degree-Constrained Subgraph Problems: Hardness and Approximation Results},
BOOKTITLE = {Approximation and Online Algorithms : 6th International Workshop, WAOA 2008},
PADDRESS = {Berlin, Germany},
ADDRESS = {Karlsruhe, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5426},
ISBN = {978-3-540-93979-5},
DOI = {10.1007/978-3-540-93980-1_3},
YEAR = {2009},
PAGES = {29--42},
}
@INPROCEEDINGS{AMM2005,
AUTHOR = {Arya, Sunil and Malamatos, Theocharis and Mount, David M.},
TITLE = {Space-Time Tradeoffs for Approximate Spherical Range Counting},
BOOKTITLE = {Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05)},
PADDRESS = {Philadelphia, USA},
ADDRESS = {Vancouver, Canada},
PUBLISHER = {SIAM},
ISBN = {0-89871-585-7},
YEAR = {2005},
PAGES = {535--544},
}
@INPROCEEDINGS{AMM2006a,
AUTHOR = {Arya, Sunil and Malamatos, Theocharis and Mount, David M.},
TITLE = {On the Importance of Idempotence},
BOOKTITLE = {Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06},
PADDRESS = {New York, NY, USA},
ADDRESS = {Seattle, Washington, USA},
PUBLISHER = {ACM},
ISBN = {1-59593-134-1},
YEAR = {2006},
PAGES = {564--573},
ABSTRACT = {Range searching is among the most fundamental problems in computational
geometry. An n-element point set in Rd is given along with an assignment of
weights to these points from some commutative semigroup. Subject to a fixed
space of possible range shapes, the problem is to preprocess the points so that
the total semigroup sum of the points lying within a given query range η can be
determined quickly. In the approximate version of the problem we assume that η
is bounded, and we are given an approximation parameter $\varepsilon$ > 0. We are to
determine the semigroup sum of all the points contained within η and may
additionally include any of the points lying within distance $\varepsilon$ • diam(η) of η's
boundar.In this paper we contrast the complexity of range searching based on
semigroup properties. A semigroup (S,+) is idempotent if x + x = x for all x ∈
S, and it is integral if for all k ≥ 2, the k-fold sum x + ... + x is not equal
to x. For example, (R, min) and (0,1, ∨) are both idempotent, and (N, +) is
integral. To date, all upper and lower bounds hold irrespective of the
semigroup. We show that semigroup properties do indeed make a difference for
both exact and approximate range searching, and in the case of approximate
range searching the differences are dramatic.First, we consider exact halfspace
range searching. The assumption that the semigroup is integral allows us to
improve the best lower bounds in the semigroup arithmetic model. For example,
assuming O(n) storage in the plane and ignoring polylog factors, we provide an
Ω*(n2/5) lower bound for integral semigroups, improving upon the best lower
bound of Ω*(n1/3), thus closing the gap with the O(n1/2) upper bound.We also
consider approximate range searching for Euclidean ball ranges. We present
lower bounds and nearly matching upper bounds for idempotent semigroups. We
also present lower bounds for range searching for integral semigroups, which
nearly match existing upper bounds. These bounds show that the advantages
afforded by idempotency can result in major improvements. In particular,
assuming roughly linear space, the exponent in the $\varepsilon$-dependencies is smaller by
a factor of nearly 1/2. All our results are presented in terms of space-time
tradeoffs, and our lower and upper bounds match closely throughout the entire
spectrum.To our knowledge, our results provide the first proof that semigroup
properties affect the computational complexity of range searching in the
semigroup arithmetic model. These are the first lower bound results for any
approximate geometric retrieval problems. The existence of nearly matching
upper bounds, throughout the range of space-time tradeoffs, suggests that we
are close to resolving the computational complexity of both idempotent and
integral approximate spherical range searching in the semigroup arithmetic
model.},
}
@INPROCEEDINGS{AMM2006b,
AUTHOR = {Arya, Sunil and Malamatos, Theocharis and Mount, David M.},
EDITOR = {Amenta, Nina and Cheong, Otfried},
TITLE = {The Effect of Corners on the Complexity of Approximate Range Searching},
BOOKTITLE = {Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06},
PADDRESS = {New York, USA},
ADDRESS = {Sedona, Arizona, USA},
PUBLISHER = {ACM},
ISBN = {1-58113-340-9
},
YEAR = {2006},
PAGES = {11--20},
}
@ARTICLE{AMTZ03,
AUTHOR = {Arge, Lars and Meyer, Ulrich and Toma, Laura and Zeh, Norbert},
JOURNAL = {Journal of Graph Algorithms and Applications},
TITLE = {On external-memory planar depth first search},
ADDRESS = {Helsinki, Finland},
NUMBER = {2},
PUBLISHER = {European Mathematical Society (EMS)},
VOLUME = {7},
ISBN = {1526-1719},
YEAR = {2003},
PAGES = {105--129},
}
@INPROCEEDINGS{Anagnostopoulos2013,
AUTHOR = {Anagnostopoulos, Aris and Grandoni, Fabrizio and Leonardi, Stefano and Wiese, Andreas},
TITLE = {Constant Integrality Gap LP formulations of Unsplittable Flow on a Path},
BOOKTITLE = {Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013)},
PADDRESS = {Heidelberg, Germany},
ADDRESS = {Valpara{\'i}so, Chile},
PUBLISHER = {Springer},
YEAR = {2013},
}
@INPROCEEDINGS{AnandBFGK13,
AUTHOR = {Anand, S and Bringmann, Karl and Friedrich, Tobias and Garg, Naveen and Kumar, Amit},
EDITOR = {Fomin, Fedor V. and Freivalds, Rūsiņ{\v{s}} and Kwiatkowska, Marta and Peleg, David},
TITLE = {Minimizing maximum (weighted) flow-time on related and unrelated machines},
BOOKTITLE = {Automata, Languages, and Programming - 40th International Colloquium (ICALP-13)},
ORGANIZATION = {European Association for Theoretical Computer Science (EATCS)},
PADDRESS = {Heidelberg},
ADDRESS = {Riga, Latvia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7965},
ISBN = {978-3-642-39205-4},
YEAR = {2013},
PAGES = {13--24},
}
@ARTICLE{AnderssonHagerupetal2000,
AUTHOR = {Andersson, Arne and Hagerup, Torben and Hastad, Johan and Petersson, Ola},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Tight bounds for searching a sorted array of strings},
NUMBER = {5},
PUBLISHER = {SIAM},
VOLUME = {30},
ISBN = {0097-5397},
YEAR = {2000},
PAGES = {1552--1578},
}
@INPROCEEDINGS{Angelopoulos2007SODA1,
AUTHOR = {Angelopoulos, Spyros},
TITLE = {Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry},
BOOKTITLE = {Proceedings of the Eighteenth Annual {ACM}-{SIAM} Symposium on Discrete Algorithms, {SODA} 2007},
ORGANIZATION = {Association for Computing Machinery (ACM) and Society for Industrial and Applied Mathematics (SIAM)},
PADDRESS = {Philadelphia, USA},
ADDRESS = {New Orleans, Louisiana, USA},
PUBLISHER = {SIAM},
MONTH = {January},
YEAR = {2007},
PAGES = {248--257},
ABSTRACT = {In this paper we consider the Online Steiner Tree problem in weighted directed
graphs of bounded edge-asymmetry $\alpha$. The edge-asymmetry of a directed graph is
defined as the maximum ratio of the cost (weight) of antiparallel edges in the
graph. The problem has applications in multicast routing over a network with
non-symmetric links. We improve the previously known upper and lower bounds on
the competitive ratio of any deterministic algorithm due to Faloutsos et al. In
particular, we show that a better analysis of a simple greedy algorithm yields
a competitive ratio of O (min {k, $\alpha$ log k/log log $\alpha$}), where k denotes the
number of terminals requested. On the negative side, we show a lower bound of Ω
(min{k1-$\varepsilon$, $\alpha$ log k/log log k}) on the competitive ratio of every deterministic
algorithm for the problem, for any arbitrarily small constant $\varepsilon$.},
}
@INPROCEEDINGS{Angelopoulos2007SODA2,
AUTHOR = {Angelopoulos, Spyros and Dorrigiv, Reza and L{\'o}pez-Ortiz, Alejandro},
TITLE = {On the separation and equivalence of paging strategies},
BOOKTITLE = {Proceedings of the Eighteenth Annual {ACM}-{SIAM} Symposium on Discrete Algorithms, {SODA} 2007},
ORGANIZATION = {Association for Computing Machinery (ACM), Society for Industrial and Applied Mathematics (SIAM)},
PADDRESS = {Philadelphia, USA},
ADDRESS = {New Orleans, Louisiana, USA},
PUBLISHER = {SIAM},
MONTH = {January},
YEAR = {2007},
PAGES = {229--237},
ABSTRACT = {It has been experimentally observed that LRU and variants thereof are the
preferred strategies for on-line paging. However, under most proposed
performance measures for on-line algorithms the performance of LRU is the same
as that of many other strategies which are inferior in practice. In this paper
we first show that any performance measure which does not include a partition
or implied distribution of the input sequences of a given length is unlikely to
distinguish between any two lazy paging algorithms as their performance is
identical in a very strong sense. This provides a theoretical justification for
the use of a more refined measure. Building upon the ideas of concave analysis
by Albers et al. [AFG05], we prove strict separation between LRU and all other
paging strategies. That is, we show that LRU is the unique optimum strategy for
paging under a deterministic model. This provides full theoretical backing to
the empirical observation that LRU is preferable in practice.},
}
@ARTICLE{Angelopoulos.Borodin:randomized.2010,
AUTHOR = {Angelopoulos, Spyros and Borodin, Allan},
JOURNAL = {Theoretical Computer Science},
TITLE = {Randomized Priority Algorithms},
ADDRESS = {Amsterdam},
NUMBER = {26-28},
PUBLISHER = {Elsevier},
VOLUME = {411},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2010.03.014},
YEAR = {2010},
PAGES = {2542--2558},
}
@INPROCEEDINGS{Angelopoulos:wads2009,
AUTHOR = {Angelopoulos, Spyros},
EDITOR = {Dehne, Frank and Gavrilova, Marina and Sack, J{\"o}rg-R{\"u}diger and T{\'o}th, Csaba D.},
TITLE = {Online {Priority} {Steiner} Tree Problems},
BOOKTITLE = {Algorithms and Data Structures : 11th International Symposium, WADS 2009},
PADDRESS = {Berlin},
ADDRESS = {Banff, Canada},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5664},
ISBN = {978-3-642-03366-7},
DOI = {10.1007/978-3-642-03367-4_4},
YEAR = {2009},
PAGES = {37--48},
}
@INPROCEEDINGS{Angelopoulos:waoa2009,
AUTHOR = {Angelopoulos, Spyros},
EDITOR = {Bampis, Evripidis and Jansen, Klaus},
TITLE = {On the Competitiveness of the Online Asymmetric and {Euclidean} {Steiner} Tree Problems},
BOOKTITLE = {Approximation and Online Algorithms : 7th International Workshop, WAOA 2009},
PADDRESS = {Berlin},
ADDRESS = {Copenhagen, Denmark},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5893},
ISBN = {978-3-642-12449-5},
DOI = {10.1007/978-3-642-12450-1_1},
YEAR = {2010},
PAGES = {1--12},
}
@INPROCEEDINGS{AngLop:ijcai09,
AUTHOR = {Angelopoulos, Spyros and Lopez-Ortiz, Alejandro},
TITLE = {Intertruptible Algorithms for Multi Problem Solving},
BOOKTITLE = {Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 09)},
PADDRESS = {Menlo Park, California},
ADDRESS = {Pasadena, California},
PUBLISHER = {AAAI Press},
ISBN = {978-1-57735-426-0},
YEAR = {2009},
PAGES = {380--386},
}
@INPROCEEDINGS{AngSch:2009.bijective,
AUTHOR = {Angelopoulos, Spyros and Schweitzer, Pascal},
EDITOR = {Mathieu, Claire},
TITLE = {Paging and List Update under Bijective Analysis},
BOOKTITLE = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009)},
ORGANIZATION = {ACM-SIAM},
PADDRESS = {New York, NY},
ADDRESS = {New York, NY},
PUBLISHER = {ACM},
YEAR = {2009},
PAGES = {1136--1145},
}
@INPROCEEDINGS{Ang:08.steiner,
AUTHOR = {Angelopoulos, Spyros},
TITLE = {A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry},
BOOKTITLE = {16th Annual European Symposium on Algorithms (ESA 2008)},
PADDRESS = {New York},
ADDRESS = {Karlsruhe},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5193},
YEAR = {2008},
PAGES = {76--87},
}
@INPROCEEDINGS{AnshelevichBH2013,
AUTHOR = {Anshelevich, Elliot and Bhardwaj, Onkar and Hoefer, Martin},
EDITOR = {Bodlaender, Hans and Italiano, Giuseppe},
TITLE = {Friendship and Stable Matching.},
BOOKTITLE = {21st European Symposium on Algorithms (ESA-13)},
PADDRESS = {New York, USA},
ADDRESS = {Sophia Antipolis, France},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8125},
YEAR = {2013},
PAGES = {49--60},
}
@INPROCEEDINGS{AntGECCO07,
AUTHOR = {Doerr, Benjamin and Neumann, Frank and Sudholt, Dirk and Witt, Carsten},
EDITOR = {Thierens, Dirk},
TITLE = {On the Runtime Analysis of the {1-ANT} {ACO} algorithm},
BOOKTITLE = {Genetic and Evolutionary Computation Conference 2007},
PADDRESS = {New York, USA},
ADDRESS = {London, UK},
PUBLISHER = {ACM},
ISBN = {978-1-59593-697-4},
YEAR = {2007},
PAGES = {33--40},
NOTE = {Best paper award},
}
@INPROCEEDINGS{approxMestre2010,
AUTHOR = {Hajiaghayi, MohammadTaghi and Khandekar, Rohit and Kortsarz, Guy and Mestre, Julian},
EDITOR = {Serna, Maria and Shaltiel, Ronen and Jansen, Klaus and Rolim, Jos{\'e}},
TITLE = {The Checkpoint Problem},
BOOKTITLE = {Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010},
PADDRESS = {Berlin},
ADDRESS = {Barcelona, Spain},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6302},
ISBN = {978-3-642-15368-6},
DOI = {10.1007/978-3-642-15369-3_17},
YEAR = {2010},
PAGES = {219--231},
}
@ARTICLE{Arikati-Chaudhuri-Zaroliagis-98,
AUTHOR = {Arikati, Srinivasa Rao and Chaudhuri, Shiva and Zaroliagis, Christos},
JOURNAL = {Journal of Algorithms},
TITLE = {All-Pairs Min-Cut in Sparse Networks},
VOLUME = {29},
ISBN = {0196-6774},
YEAR = {1998},
PAGES = {82--110},
ABSTRACT = {Algorithms are presented for the all-pairs min-cut problem in bounded
tree-width, planar and sparse networks. The approach used
is to preprocess the input $n$-vertex network so that, afterwards, the
value of a min-cut between any two vertices can be efficiently
computed. A tradeoff is shown between the preprocessing time and the time
taken to compute min-cuts subsequently. In particular, after
an $O(n\log n)$ preprocessing of a bounded tree-width network,
it is possible to find the value of a
min-cut between any two vertices in constant time. This implies that
for such networks the all-pairs min-cut problem can be solved
in time $O(n^2)$.
This algorithm is used in conjunction with a graph
decomposition technique of Frederickson to obtain algorithms for
sparse and planar networks. The running times depend upon a
topological property, $\gamma$, of the input network.
The parameter $\gamma$ varies between
1 and $\Theta(n)$; the algorithms perform well when $\gamma = o(n)$.
The value of a min-cut can be found in time $O(n + \gamma^2 \log
\gamma)$ and all-pairs min-cut can be solved in time $O(n^2 + \gamma^4
\log \gamma)$ for sparse networks. The corresponding running times
for planar networks are $O(n+\gamma \log \gamma)$ and $O(n^2 + \gamma^3
\log \gamma)$, respectively. The latter bounds depend on a result
of independent interest: outerplanar networks have small
``mimicking'' networks which are also outerplanar.},
}
@INPROCEEDINGS{Arikati-et-al95,
AUTHOR = {Arikati, Srinivasa Rao and Chaudhuri, Shiva and Zaroliagis, Christos},
EDITOR = {Thiagarajan, P. S.},
TITLE = {All-Pairs Min-Cut in Sparse Networks},
BOOKTITLE = {Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference},
PADDRESS = {Berlin, Germany},
ADDRESS = {Bangalore, India},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1026},
YEAR = {1995},
PAGES = {363--376},
}
@INPROCEEDINGS{Arikati-et-al96,
AUTHOR = {Arikati, Srinivasa Rao and Dessmark, Anders and Lingas, Andrzej and Marathe, Madhav V.},
EDITOR = {Hirschberg, Dan and Myers, Gene},
TITLE = {Approximation algorithms for maximum two-dimensional pattern matching},
BOOKTITLE = {Combinatorial Pattern Matching: 7th Annual Symposium, CPM96},
PADDRESS = {Berlin},
ADDRESS = {Laguna Beach, California, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1075},
YEAR = {1996},
PAGES = {348--360},
}
@ARTICLE{Arikati-Maheshwari96,
AUTHOR = {Arikati, Srinivasa Rao and Maheshwari, Anil},
JOURNAL = {SIAM Journal of Computing},
TITLE = {Realizing degree sequences in parallel},
NUMBER = {2},
PUBLISHER = {Society for Industrial and Applied Mathematics},
VOLUME = {9},
ISBN = {0097-5397},
YEAR = {1996},
PAGES = {317--338},
}
@ARTICLE{Arikati-Mehlhorn,
AUTHOR = {Arikati, Srinivasa Rao and Mehlhorn, Kurt},
JOURNAL = {Information Processing Letters},
TITLE = {A correctness certificate for the {Stoer-Wagner} min-cut algorithm},
NUMBER = {5},
PUBLISHER = {Elesevier},
VOLUME = {70},
DOI = {10.1016/S0020-0190(99)00071-X},
YEAR = {1999},
PAGES = {251--254},
ABSTRACT = {The Stoer–Wagner algorithm computes a minimum cut in a weighted undirected
graph. The algorithm works in n−1 phases, where n is the number of nodes of G.
Each phase takes time O(m+nlogn), where m is the number of edges of G, and
computes a pair of vertices s and t and a minimum cut separating s and t. We
show how to extend the algorithm such that each phase also computes a maximum
flow from s to t. The flow is computed in O(m) additional time and certifies
the cut computed in the phase.},
}
@ARTICLE{ArikatiDessmarketal2001,
AUTHOR = {Arikati, Srinivasa Rao and Dessmark, Anders and Lingas, Andrzej and Marathe, Madhav V.},
JOURNAL = {Theoretical Computer Science},
TITLE = {Approximation algorithms for maximum two-dimensional pattern matching},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {1/2},
PUBLISHER = {Elsevier},
MONTH = {March},
VOLUME = {255},
ISBN = {0304-3975},
YEAR = {2001},
PAGES = {51--62},
}
@ARTICLE{ArikatiMaheshwariZaroliagis97,
AUTHOR = {Arikati, Srinivasa Rao and Maheshwari, Anil and Zaroliagis, Christos},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Efficient Computation of implicit representations of sparse graphs},
NUMBER = {1-3},
VOLUME = {78},
YEAR = {1997},
PAGES = {1--16},
}
@ARTICLE{AritProg2001,
AUTHOR = {Doerr, Benjamin and Srivastav, Anand},
JOURNAL = {Electronic Notes in Discrete Mathematics},
TITLE = {Multi-Color Discrepancy of Arithmetic Progressions},
ADDRESS = {Amsterdam, The Netherlands},
PUBLISHER = {Elsevier},
VOLUME = {8},
ISBN = {1571-0653},
YEAR = {2001},
PAGES = {27--30},
}
@INPROCEEDINGS{ArMeTo04,
AUTHOR = {Arge, Lars and Meyer, Ulrich and Toma, Laura},
EDITOR = {Diaz, Josep and Karhum{\"a}ki, Juhani and Lepist{\"o}, Arto and Sannella, Donald},
TITLE = {External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs},
BOOKTITLE = {Automata, languages and programming : 31st International Colloquium, ICALP 2004},
PADDRESS = {Berlin, Germany},
ADDRESS = {Turku, Finland},
PUBLISHER = {Springer},
MONTH = {July},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3142},
ISBN = {0302-9743},
YEAR = {2004},
PAGES = {146--157},
}
@INPROCEEDINGS{ArMeToZe2001,
AUTHOR = {Arge, Lars and Meyer, Ulrich and Toma, Laura and Zeh, Norbert},
EDITOR = {Dehne, Frank and Sack, J{\"o}rg-R{\"u}diger and Tamassia, R.},
TITLE = {On External-Memory Planar Depth First Search},
BOOKTITLE = {Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Providence, Rhode Island, USA},
PUBLISHER = {Springer},
MONTH = {August},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2125},
ISBN = {3-540-42423-7},
YEAR = {2001},
PAGES = {471--482},
ABSTRACT = {Even though a large number of I/O-efficient graph algorithms
have been developed, a number of fundamental problems still
remain open. For example, no space- and I/O-efficient algorithms
are known for depth-first search or breadth-first search in sparse
graphs. In this paper we present two new results on I/O-efficient
depth-first search in an important class of sparse graphs, namely
undirected embedded planar graphs. We develop a new efficient
depth-first search algorithm and show how planar depth-first search
in general can be reduced to planar breadth-first search. As part
of the first result we develop the first I/O-efficient algorithm
for finding a simple cycle separator of a biconnected planar graph.
Together with other recent reducibility results, the second result
provides further evidence that external memory breadth-first search
is among the hardest problems on planar graphs.},
}
@INPROCEEDINGS{arumugamchandrasekarmisraphilipsaurabh2011,
AUTHOR = {Arumugam, S. and Chandrasekar, K. Raja and Misra, Neeldhara and Philip, Geevarghese and Saurabh, Saket},
EDITOR = {Iliopoulos, Costas S. and Smyth, William F.},
TITLE = {Algorithmic Aspects of Dominator Colorings in Graphs},
BOOKTITLE = {Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers},
TYPE = {Revised Selected Paper},
PADDRESS = {Berlin},
ADDRESS = {Victoria, Canada},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7056},
ISBN = {978-3-642-25010-1},
DOI = {10.1007/978-3-642-25011-8},
YEAR = {2011},
PAGES = {19--30},
ABSTRACT = {In this paper we initiate a systematic study of a problem that
has the flavor of two classical problems, namely {\sc Coloring}
and {\sc Domination}, from the perspective of algorithms and
complexity. A {\it dominator coloring} of a graph $G$ is an
assignment of colors to the vertices of $G$ such that it is a
proper coloring and every vertex dominates all the vertices of
at least one color class. The minimum number of colors required
for a dominator coloring of $G$ is called the {\it dominator
chromatic number} of $G$ and is denoted by $\chi_d(G).$ In the
{\sc Dominator Coloring (DC)} problem, a graph $G$ and a
positive integer $k$ are given as input and the objective is to
check whether $\chi_d(G)\leq k$. We first show that unless P=NP,
DC cannot be solved in polynomial time on bipartite, planar, or
split graphs.
This resolves an open problem posed by Chellali and Maffray
[{\it Dominator Colorings in Some Classes of Graphs, Graphs and
Combinatorics, 2011}] about the polynomial time solvability of
DC on chordal graphs.
We then complement these hardness results by showing that the
problem is fixed parameter tractable (FPT) on chordal graphs and
in graphs which exclude a fixed apex graph as a
minor.},
}
@INPROCEEDINGS{Arya-Mount-Narayan95,
AUTHOR = {Arya, Sunil and Mount, David M. and Narayan, Oruttom},
TITLE = {Accounting for boundary effects in nearest neighbor searching},
BOOKTITLE = {11th Annual ACM Symposium on Computational Geometry (SCG95)},
PADDRESS = {New York},
ADDRESS = {Vancouver, British Columbia, Canada},
PUBLISHER = {acm-Press},
YEAR = {1995},
PAGES = {336--344},
}
@ARTICLE{Arya-Mount-Narayan96,
AUTHOR = {Arya, Sunil and Mount, David M. and Narayan, Oruttom},
JOURNAL = {Discrete \& Computational Geometry},
TITLE = {Accounting for boundary effects in nearest neighbor searching},
NUMBER = {2},
PUBLISHER = {Springer},
VOLUME = {16},
ISBN = {0179-5376},
YEAR = {1996},
PAGES = {155--176},
}
@INPROCEEDINGS{Arya-Mount95,
AUTHOR = {Arya, Sunil and Mount, David M.},
TITLE = {Approximate range searching},
BOOKTITLE = {11th Annual ACM Symposium on Computational Geometry (SCG95)},
PADDRESS = {New York},
ADDRESS = {Vancouver, British Columbia, USA},
PUBLISHER = {acm-Press},
YEAR = {1995},
PAGES = {172--181},
}
@INPROCEEDINGS{Arya-Smid95,
AUTHOR = {Arya, Sunil and Das, Gautam and Mount, David M. and Salowe, Jeffrey S. and Smid, Michiel},
TITLE = {Euclidean spanners: short, thin, and lanky},
BOOKTITLE = {27th Annual ACM Symposium on Theory of Computing (STOC95)},
PADDRESS = {New York},
ADDRESS = {Las Vegas, Nevada, USA},
PUBLISHER = {acm-Press},
YEAR = {1995},
PAGES = {489--498},
}
@ARTICLE{Arya-Smid96,
AUTHOR = {Arya, Sunil and Smid, Michiel},
JOURNAL = {Algorithmica},
TITLE = {Efficient construction of a bounded degree spanner with low weight},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {17},
ISBN = {0178-4617},
YEAR = {1997},
PAGES = {33--54},
}
@ARTICLE{AryaMount2000,
AUTHOR = {Arya, Sunil and Mount, David M.},
JOURNAL = {Computational Geometry},
TITLE = {Approximate range searching},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {3/4},
PUBLISHER = {Elsevier},
VOLUME = {17},
ISBN = {0925-7721},
YEAR = {2000},
PAGES = {135--152},
ABSTRACT = {The range searching problem is a fundamental problem in computational geometry,
with numerous important applications. Most research has focused on solving this
problem exactly, but lower bounds show that if linear space is assumed, the
problem cannot be solved in polylogarithmic time, except for the case of
orthogonal ranges. In this paper we show that if one is willing to allow
approximate ranges, then it is possible to do much better. In particular, given
a bounded range Q of diameter w and >0, an approximate range query treats the
range as a fuzzy object, meaning that points lying within distance w of the
boundary of Q either may or may not be counted. We show that in any fixed
dimension d, a set of n points in can be preprocessed in O(n+logn) time and
O(n) space, such that approximate queries can be answered in O(logn(1/)d) time.
The only assumption we make about ranges is that the intersection of a range
and a d-dimensional cube can be answered in constant time (depending on
dimension). For convex ranges, we tighten this to O(logn+(1/)d-1) time. We also
present a lower bound for approximate range searching based on partition trees
of (logn+(1/)d-1), which implies optimality for convex ranges (assuming fixed
dimensions). Finally, we give empirical evidence showing that allowing small
relative errors can significantly
improve query execution times. },
}
@MASTERSTHESIS{Ashoff2000,
AUTHOR = {Ashoff, Oliver},
TITLE = {{Agorithmen der modularen Arithmetik}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {January},
YEAR = {2000},
}
@ARTICLE{ASS12,
AUTHOR = {Agrawal, Manindra and Saha, Chandan and Saxena, Nitin},
JOURNAL = {arXiv},
TITLE = {Quasi-polynomial Hitting-set for Set-depth-Delta Formulas},
ADDRESS = {Ithaca, NY},
PUBLISHER = {Cornell University Library},
VOLUME = {abs/1209.2333},
YEAR = {2012},
PAGES = {1--13},
ABSTRACT = {We call a depth-$4$ formula $C$ {\em set-depth-$4$} if there exists a (unknown)
partition $X_1\sqcup\cdots\sqcup X_d$ of the variable indices $[n]$ that the
top product layer respects, i.e.~$C(\term{x})=\sum_{i=1}^k \prod_{j=1}^{d}$
$f_{i,j}(\term{x}_{X_j})$, where $f_{i,j}$ is a {\em sparse} polynomial in
$\F[\term{x}_{X_j}]$. Extending this definition to any depth - we call a
depth-$\D$ formula $C$ (consisting of alternating layers of $\Sigma$ and $\Pi$
gates, with a $\Sigma$-gate on top) a \emph{set-depth-$\D$} formula if every
$\Pi$-layer in $C$ respects a (unknown) partition on the variables; if $\D$ is
even then the product gates of the bottom-most $\Pi$-layer are allowed to
compute arbitrary monomials.
In this work, we give a hitting-set generator for set-depth-$\D$ formulas (over
\emph{any} field) with running time polynomial in $\exp((\D^2\log s)^{ \Delta -
1})$, where $s$ is the size bound on the input set-depth-$\D$ formula. In other
words, we give a {\em quasi}-polynomial time \emph{blackbox} polynomial
identity test for such constant-depth formulas. Previously, the very special
case of $\D=3$ (also known as {\em set-multilinear} depth-$3$ circuits) had no
known sub-exponential time hitting-set generator. This was declared as an open
problem by Shpilka \& Yehudayoff (FnT-TCS 2010); the model being first studied
by Nisan \& Wigderson (FOCS 1995) and recently by Forbes \& Shpilka (STOC 2012
\& ECCC TR12-115). Our work settles this question, not only for depth-$3$ but,
up to depth $\epsilon\log s / \log \log s$, for a fixed constant $\epsilon <
1$.
The technique is to investigate depth-$\D$ formulas via depth-$(\D-1)$ formulas
over a {\em Hadamard algebra}, after applying a `shift' on the variables. We
propose a new algebraic conjecture about the \emph{low-support
rank-concentration} in the latter formulas, and manage to prove it in the case
of set-depth-$\D$ formulas. },
}
@INPROCEEDINGS{ASSS12,
AUTHOR = {Agrawal, Manindra and Saha, Chandan and Saptharishi, Ramprasad and Saxena, Nitin},
TITLE = {Jacobian hits circuits: hitting-sets, lower bounds for {depth-D} occur-k formulas \& depth-3 transcendence degree-k circuits},
BOOKTITLE = {STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing},
PADDRESS = {New York, NY},
ADDRESS = {New York, NY},
PUBLISHER = {ACM},
ISBN = {978-1-4503-1245-5},
DOI = {10.1145/2213977.2214033},
YEAR = {2012},
PAGES = {599--614},
ABSTRACT = { We present a single common tool to strictly subsume \emph{all} known cases
of polynomial time blackbox polynomial identity testing (PIT), that have been
hitherto solved using diverse tools and techniques, over fields of zero or
large characteristic. In particular, we show that polynomial time hitting-set
generators for identity testing of the two seemingly different and
well studied models - depth-$3$ circuits with bounded top fanin, and
constant-depth constant-read multilinear formulas - can be constructed using
one common algebraic-geometry theme: \emph{Jacobian} captures algebraic
independence. By exploiting the Jacobian, we design the {\em first} efficient
hitting-set generators for broad generalizations of the bove-mentioned models,
namely: \begin{itemize} \item depth-$3$ ($\Sigma \Pi \Sigma$) circuits with
constant \emph{transcendence degree} of the polynomials computed by the
product gates (\emph{no} bounded top fanin restriction), and \item
constant-depth constant-\emph{occur} formulas (\emph{no} multilinear
restriction). \end{itemize}
Constant-\emph{occur} of a variable, as we define it, is a much more
general concept than constant-read. Also, earlier work on the latter model
assumed that the formula is multilinear. Thus, our work goes further beyond
the related results obtained by Saxena \& Seshadhri (STOC 2011), Saraf \&
Volkovich (STOC 2011), Anderson et al.\ (CCC 2011), Beecken et al.\ (ICALP
2011) and Grenet et al.\ (FSTTCS 2011), and brings them under one unifying
technique.
In addition, using the same Jacobian based approach, we prove exponential
lower bounds for the immanant (which includes permanent and determinant) on
the \emph{same} depth-$3$ and depth-$4$ models for which we give efficient
PIT algorithms. Our results reinforce the intimate
connection between identity testing and lower bounds by exhibiting a concrete
mathematical tool - the Jacobian - that is equally effective in solving both
the problems on certain interesting and previously well-investigated (but not
well understood) models of computation.},
}
@BOOK{AugerD11,
EDITOR = {Auger, Anne and Doerr, Benjamin},
TITLE = {Theory of Randomized Search Heuristics},
ADDRESS = {Singapore},
PUBLISHER = {World Scientific Publishing},
SERIES = {Series on Theoretical Computer Science},
VOLUME = {1},
ISBN = {978-981-4282-66-6},
YEAR = {2011},
PAGES = {382},
}
@ARTICLE{AulettaDinitzNutuvDomenico1999,
AUTHOR = {Auletta, Vincenzo and Dinitz, Yefim and Nutov, Zeev and Parente, Domenico},
JOURNAL = {Journal of Algorithms},
TITLE = {A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph},
NUMBER = {1},
PUBLISHER = {Academic Press},
VOLUME = {32},
YEAR = {1999},
PAGES = {21--30},
}
@UNPUBLISHED{avgFPTsubmitted,
AUTHOR = {Fountoulakis, Nikolaos and Friedrich, Tobias and Hermelin, Danny},
TITLE = {Average Case Parameterized Complexity},
YEAR = {2011},
NOTE = {Submitted},
}
@MASTERSTHESIS{BachBecker2012,
AUTHOR = {Becker, Ruben},
TITLE = {The {Bolzano} Method to Isolate the Roots of a Bitstream Polynomial},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Bachelor thesis},
MONTH = {May},
YEAR = {2012},
}
@MASTERSTHESIS{BachCaroli06,
AUTHOR = {Caroli, Manuel},
TITLE = {{Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Bachelor thesis},
MONTH = {April},
YEAR = {2006},
}
@MASTERSTHESIS{BachEbert05,
AUTHOR = {Ebert, Franziska},
TITLE = {Benchmark Data Sets for Conic Arrangements},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Bachelor thesis},
MONTH = {November},
YEAR = {2005},
NOTE = {1.7},
}
@MASTERSTHESIS{BachFouz06,
AUTHOR = {Fouz, Mahmoud},
TITLE = {Hereditary Discrepancy in Different Numbers of Colors},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Bachelor thesis},
MONTH = {October},
YEAR = {2006},
}
@ARTICLE{BachrachEl-YanivReinstaedtler2002,
AUTHOR = {Bachrach, Ran and El-Yaniv, Ran and Reinst{\"a}dtler, Martin},
JOURNAL = {Algorithmica},
TITLE = {On the competitive theory and practice of online list accessing algorithms},
ADDRESS = {Berlin, Germany},
NUMBER = {2},
PUBLISHER = {Springer},
MONTH = {February},
VOLUME = {32},
ISBN = {0178-4617},
YEAR = {2002},
PAGES = {201--246},
}
@MASTERSTHESIS{BachSchmitt06,
AUTHOR = {Schmitt, Daniel},
TITLE = {{Implementierung einer {\"U}berlagerungvon konvexen Arrangements der Kugeloberfl{\"a}che}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Bachelor thesis},
MONTH = {August},
YEAR = {2006},
}
@MASTERSTHESIS{BachSteurer06,
AUTHOR = {Steurer, David},
TITLE = {Tight Bounds on the Min-Max Boundary Decomposition Cost of Weighted Graphs},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Bachelor thesis},
MONTH = {May},
YEAR = {2006},
}
@INPROCEEDINGS{Bacik-Mahajan95,
AUTHOR = {Bacik, Roman and Mahajan, Sanjeev},
EDITOR = {Du, Ding-Zhu and Li, Ming},
TITLE = {Semidefinite programming and its applications to NP problems},
BOOKTITLE = {Computing and Combinatorics: 1st Annual International Conference (COCOON95)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Xi'an, China},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {959},
YEAR = {1995},
PAGES = {566--575},
}
@MASTERSTHESIS{Backes1998Diplom,
AUTHOR = {Backes, Werner},
TITLE = {Berechnung k{\"u}rzester Gittervektoren},
SCHOOL = {Univesit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1998},
}
@INPROCEEDINGS{BaGiePa2007,
AUTHOR = {Miklos, Balint and Giesen, Joachim and Pauly, Mark},
TITLE = {Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool},
BOOKTITLE = {Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07)},
ORGANIZATION = {Association for Computing Machinery (ACM)},
TYPE = {Video/Multimedia Submission},
PADDRESS = {New York, NY, USA},
ADDRESS = {Gyeongju, South Korea},
PUBLISHER = {ACM},
ISBN = {978-1-59593-705-6},
DOI = {10.1145/1247069.1247090},
YEAR = {2007},
PAGES = {123--124},
ABSTRACT = {We illustrate a simple algorithm for approximating the medial axis of a 2D
shape with smooth boundary from a sample of this boundary. The algorithm is
compared to a more general approximation method that builds on the same idea,
namely, to approximate the shape by a union of balls. While not as general, our
algorithm is simpler, faster and numerically more stable. Both algorithms are
visualized using the Mesecina tool, which is also described.},
}
@INPROCEEDINGS{Banderier-LNCS1853-2000,
AUTHOR = {Banderier, Cyril},
TITLE = {Planar Maps and Airy Phenomena,},
BOOKTITLE = {Proceedings of ICALP'00},
PADDRESS = {Heidelberg},
ADDRESS = {Geneva},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1853},
YEAR = {2000},
PAGES = {388--402},
}
@MISC{Banderier1999a,
AUTHOR = {Banderier, Cyril},
TITLE = {An Introduction to Analytic Number Theory},
HOWPUBLISHED = {Lecture Notes Proceedings},
ISBN = {ISSN 0249-6399},
YEAR = {1999},
}
@INPROCEEDINGS{Banderier1999b,
AUTHOR = {Banderier, Cyril},
TITLE = {On Generating Functions of Generating Trees},
BOOKTITLE = {Proceedings of FPSAC'99},
PADDRESS = {Barcelona},
ADDRESS = {Barcelona},
PUBLISHER = {Universitat Polit{\`e}cnica de Catalunya},
YEAR = {1999},
PAGES = {40--52},
}
@INPROCEEDINGS{Banderier2000,
AUTHOR = {Banderier, Cyril},
TITLE = {A Generalized Cover Time for Random Walks on Graphs},
BOOKTITLE = {Proceedings of FPSAC'00},
PADDRESS = {Heidelberg},
ADDRESS = {Moscow},
PUBLISHER = {Springer},
ISBN = {3-540-67247-8},
YEAR = {2000},
PAGES = {113--124},
}
@ARTICLE{Banderier2001_2,
AUTHOR = {Banderier, Cyril},
JOURNAL = {Random Structures \& Algorithms},
TITLE = {Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena},
ADDRESS = {New York, USA},
NUMBER = {3-4},
PUBLISHER = {Wiley},
VOLUME = {19},
ISBN = {1042-9832},
YEAR = {2001},
PAGES = {194--246},
}
@ARTICLE{Banderier2001_3,
AUTHOR = {Banderier, Cyril and Bousquet-M{\'e}lou, Mireille and Denise, Alain and Flajolet, Philippe and Gardy, Dani{\`e}le and Gouyou-Beauchamps, Dominique},
JOURNAL = {Discrete Mathematics},
TITLE = {Generating Functions for Generating Trees},
ADDRESS = {Amsterdam, The Netherlands},
PUBLISHER = {Elsevier},
VOLUME = {246},
ISBN = {0012-365X},
YEAR = {2002},
PAGES = {29--55},
}
@PHDTHESIS{Banderier2001_T,
AUTHOR = {Banderier, Cyril},
TITLE = {Combinatoire Analytique des chemins et des cartes},
SCHOOL = {Universit{\'e} de Paris 6},
TYPE = {Doctoral dissertation},
MONTH = {June},
YEAR = {2001},
}
@ARTICLE{Banderier2002,
AUTHOR = {Banderier, Cyril and Flajolet, Philippe},
JOURNAL = {Theoretical Computer Science},
TITLE = {Basic analytic combinatorics of directed lattice paths},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {1-2},
PUBLISHER = {Elsevier},
VOLUME = {281},
ISBN = {0304-3975},
YEAR = {2002},
PAGES = {37--80},
}
@INPROCEEDINGS{Bansal2010,
AUTHOR = {Bansal, Nikhil and Gupta, Anupam and Li, Jian and Mestre, Juli{\'a}n and Nagarajan, Viswanath and Rudra, Atri},
EDITOR = {de Berg, Mark and Meyer, Ulrich},
TITLE = {When {LP} Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Extended Abstract)},
BOOKTITLE = {Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II},
PADDRESS = {Berlin},
ADDRESS = {Liverpool, UK},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6347},
ISBN = {978-3-642-15780-6},
DOI = {10.1007/978-3-642-15781-3_19},
YEAR = {2010},
PAGES = {218--229},
}
@ARTICLE{Bar-YehudaHermelinRawitz2011,
AUTHOR = {Bar-Yehuda, Reuven and Hermelin, Danny and Rawitz, Dror},
JOURNAL = {Computational Geometry},
TITLE = {Minimum vertex cover in rectangle graphs},
ADDRESS = {Amsterdam},
NUMBER = {6-7},
PUBLISHER = {Elsevier},
VOLUME = {44},
ISBN = {0925-772},
DOI = {10.1016/j.comgeo.2011.03.002},
YEAR = {2011},
PAGES = {356--364},
}
@MASTERSTHESIS{BaraqueDipl02,
AUTHOR = {Baraque, Raef},
TITLE = {{Effiziente Multiplikationsverfahren: ein numerischer Vergleich}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {November},
YEAR = {2002},
}
@ARTICLE{BarnesEdmondsSIAMJCOMPUT1998,
AUTHOR = {Barnes, Greg and Edmonds, Jeff A.},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models},
NUMBER = {4},
PUBLISHER = {SIAM},
MONTH = {August},
VOLUME = {27},
ISBN = {0097-5397},
YEAR = {1998},
PAGES = {1190--1202},
}
@ARTICLE{Baruah:2010,
AUTHOR = {Baruah, Sanjoy and Bonifaci, Vincenzo and Marchetti-Spaccamela, Alberto and Stiller, Sebastian},
JOURNAL = {Real-Time Systems},
TITLE = {Improved Multiprocessor Global Schedulability Analysis},
ADDRESS = {New York, NY},
NUMBER = {1},
PUBLISHER = {Springer},
MONTH = {September},
VOLUME = {46},
ISBN = {0922-6443},
DOI = {10.1007/s11241-010-9096-3},
YEAR = {2010},
PAGES = {3--24},
ABSTRACT = {A new technique was recently introduced by Bonifaci et al. for the analysis of
real-time systems scheduled on multiprocessor platforms by the global Earliest
Deadline First (EDF) scheduling algorithm. In this paper, this technique is
generalized so that it is applicable to the schedulability analysis of
real-time systems scheduled on multiprocessor platforms by any work-conserving
algorithm. The resulting analysis technique is applied to obtain a new
sufficient global Deadline Monotonic (DM) schedulability test. It is shown that
this new test is quantitatively superior to pre-existing DM schedulability
analysis tests; in addition, the degree of its deviation from any hypothetical
optimal scheduler (that may be clairvoyant) is quantitatively bounded. A new
global EDF schedulability test is also proposed here that builds on the results
of Bonifaci et al. This new test is shown to be less pessimistic and more
widely applicable than the earlier result was, while retaining the strong
theoretical properties of the earlier result. },
}
@ARTICLE{Basit2010,
AUTHOR = {Basit, Abdul and Mustafa, Nabil H. and Ray, Saurabh and Raza, Sarfraz},
JOURNAL = {Computational Geometry},
TITLE = {Centerpoints and {Tverberg's} technique},
ADDRESS = {Amsterdam},
NUMBER = {6-7},
PUBLISHER = {Elsevier},
VOLUME = {43},
ISBN = {0925-7721},
DOI = {10.1016/j.comgeo.2010.03.002},
YEAR = {2010},
PAGES = {593--600},
}
@ARTICLE{Bast-Hagerup95,
AUTHOR = {Bast, Hannah and Hagerup, Torben},
JOURNAL = {Information and Computation},
TITLE = {Fast Parallel Space Allocation, Estimation, and Integer Sorting},
NUMBER = {1},
PUBLISHER = {Academic Press},
VOLUME = {123},
ISBN = {0890-5401},
YEAR = {1995},
PAGES = {72--110},
}
@INPROCEEDINGS{bast04selfstar,
AUTHOR = {Bast, Holger},
EDITOR = {Babaoglu, Ozalp and Jelasity, M{\'a}rk and Montresor, Alberto and van Steen, Maarten and van Moorsel, Aad and Fetzer, Christof and Leonardi, Stefano},
TITLE = {Dimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data},
BOOKTITLE = {International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR 2004)},
PADDRESS = {Bologna, Italy},
ADDRESS = {Bertinoro, Italy},
PUBLISHER = {University of Bologna},
YEAR = {2004},
PAGES = {113--116},
ABSTRACT = {Dimension reduction techniques have been a successful
avenue for automatically extracting the
“concepts” underlying unstructured data, a task
that naturally arises in fields as diverse as information
retrieval, image processing, social science,
etc. It is surprising how much can be achieved for
this task using only the raw data itself, without resorting
to any additional knowledge or intelligence.
We will survey the most important schemes contributed
from the various communities to date, by
commenting on the following aspects: optimization
techniques, the role of normalizations, setting the
parameters, computing time, quality of results, and
the integration of external knowledge.},
}
@INPROCEEDINGS{bast04stacs,
AUTHOR = {Bast, Holger and Mehlhorn, Kurt and Sch{\"a}fer, Guido and Tamaki, Hisao},
EDITOR = {Diekert, Volker and Habib, Michel},
TITLE = {Matching Algorithms Are Fast in Sparse Random Graphs},
BOOKTITLE = {21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Montpellier, France},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2996},
ISBN = {3-540-21236-1},
DOI = {10.1007/b96012},
YEAR = {2004},
PAGES = {81--92},
ABSTRACT = {We present an improved average case analysis of the maximum cardinality
matching problem. We show that in a bipartite or general random graph on n
vertices, with high probability every nonmaximum matching has an augmenting
path of length O(log n). This implies that augmenting path algorithms like the
Hopcroft Karp algorithm for bipartite graphs and the Micali Vazirani algorithm
for general graphs, which have a worst case running time of O(mpn), run in time
O(mlog n) with high probability, where m is the number of edges in the graph.
Motwani proved these results for random graphs when the average degree is at
least ln(n) [Average Case Analysis of Algorithms for Matchings and Related
Problems, Journal of the ACM, 41(6), 1994]. Our results hold, if only the
average degree is a large enough constant. At the same time we simplify the
analysis of Motwani.},
}
@ARTICLE{bast05hz,
AUTHOR = {Bast, Holger},
JOURNAL = {Hom{\"o}opathie-Zeitschrift},
TITLE = {{Pr{\"a}zisionssuche im hom{\"o}opathischen Netz}},
ADDRESS = {Gauting, Germany},
PUBLISHER = {Hom{\"o}opathie-Forum e.V.},
VOLUME = {I/05},
ISBN = {0943-6839},
YEAR = {2005},
PAGES = {119--122},
}
@INPROCEEDINGS{Bast1998,
AUTHOR = {Bast, Hannah},
TITLE = {Dynamic Scheduling with Incomplete Information},
BOOKTITLE = {Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-98)},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Puerto Vallarta, Mexico},
PUBLISHER = {ACM Press},
MONTH = {June},
ISBN = {0-89791-989-0},
YEAR = {1998},
PAGES = {182--191},
ABSTRACT = {We consider the following scheduling problem:
Our goal is to execute a given amount of
arbitrarily decomposable work on a distributed machine
as quickly as possible.
The work is maintained by a central scheduler
that can assign chunks of work of an arbitrary size
to idle processors.
The difficulty is that the processing time required for
a chunk is not exactly predictable---usually the less, the
larger the chunk---and that processors suffer a
delay for each assignment.
Our objective is to minimize the total wasted time of the schedule,
that is, the sum of all delays plus the idle times of processors
waiting for the last processor to finish.
We introduce a new deterministic model for this setting,
based on estimated ranges $[\alpha(w),\beta(w)]$ for processing times
of chunks of size $w$.
Depending on $\alpha$, $\beta$, and a measure for the overall
deviation from these estimates, we can prove matching
upper and lower bounds on the wasted time, the former being
achieved by our new \emph{balancing} strategy.
This is in sharp contrast with previous work that,
even under the strong assumption of independent,
approximately normally distributed chunk processing times,
proposed only heuristic scheduling schemes supported
merely by empirical evidence.
Our model naturally subsumes this stochastic setting, and
our generic analysis is valid for
most of the existing schemes too, proving them to be non-optimal.},
}
@ARTICLE{Bast2000b,
AUTHOR = {Bast, Hannah},
JOURNAL = {Theory of Computing Systems},
TITLE = {On Scheduling Parallel Tasks at Twilight},
ADDRESS = {New York, USA},
NUMBER = {5},
PUBLISHER = {Springer},
MONTH = {November},
VOLUME = {33},
ISBN = {1432-4350},
YEAR = {2000},
PAGES = {489--563},
ABSTRACT = { We consider the problem of processing a given number of tasks on a given
number of processors as quickly as possible when only vague information
about the processing time of a task is available before it is completed.
Whenever a processor is idle, it can be assigned, at the price of a certain
overhead, a
portion, called a chunk, of the unassigned tasks. The goal is to
minimize the makespan, that is, the time that passes until all the tasks are
completed. The
difficulty then is to find the optimal tradeoff between the processors'
load balance, which is favoured by having small, and therefore many, chunks, and
the total scheduling overhead, which is lower when there are fewer
chunks. This scheduling problem has been the subject of intensive research in
the
past, and a large variety of heuristics have been proposed. Its
mathematical analysis, however, turned out to be difficult even for simplistic
models of the
vague-information issue, and little theoretical work has been presented
to date. In this work we present a novel theoretical model that covers a
multitude of natural vague-information scenarios, and for which we can
prove general upper and lower bounds on the achievable makespan. From
this we derive optimal bounds and algorithms for a whole variety of
specific scenarios, including the modelling of task processing times as
independent,
identically distributed random variables, which guided the design of
most of the previously existing heuristics. Unlike traditional approaches, our
model
neither ignores a priori knowledge of the input (the processing times)
nor does it restrict the distribution of the input, but instead works with the
concepts
of an a priori estimate of the processing times, which is implicit in
every algorithm, and a measure for the deviation of this estimate from the
actual
processing times, which is not known until all the tasks are completed.},
}
@INPROCEEDINGS{Bast2002a,
AUTHOR = {Bast, Hannah},
EDITOR = {Ferreira, Afonso and Alt, Helmut},
TITLE = {Scheduling at Twilight the Easy Way},
BOOKTITLE = {STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science},
PADDRESS = {Berlin, Germany},
ADDRESS = {Antibes, Juan-Les-Pins, France},
PUBLISHER = {Springer},
MONTH = {March},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2285},
ISBN = {3-540-43283-3},
YEAR = {2002},
PAGES = {166--178},
ABSTRACT = {We investigate particularly simple algorithms for optimizing the tradeoff
between load imbalance and assignment overheads in dynamic multiprocessor
scheduling scenarios, when the information that is available about the
processing time of a task before it is completed is vague.
We describe a simple and elegant generic algorithm that, in a very
general model, always comes surprisingly close to the theoretical optimum,
and the performance of which we can analyze exactly with respect to constant
factors. In contrast, we prove that algorithms that assign tasks
in equal-sized portions
perform far from optimal in general. In fact, we give evidence that the
performance of our generic scheme cannot be improved by any constant factor
without sacrificing the simplicity of the algorithm. We also give lower
bounds on the performance of the various decreasing-size heuristics that
have typically been used so far in concrete applications.},
}
@ARTICLE{Bast2006b,
AUTHOR = {Bast, Holger},
JOURNAL = {MPG Jahrbuch},
TITLE = {{Intelligente Suche mit garantiert schnellen Antwortzeiten}},
YEAR = {2006},
}
@INCOLLECTION{Bast2009,
AUTHOR = {Bast, Hannah},
EDITOR = {Albers, Susanne and Alt, Helmut and N{\"a}her, Stefan},
TITLE = {Car or Public Transport -- Two Worlds},
BOOKTITLE = {Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday},
ADDRESS = {Berlin, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5760},
ISBN = {978-3-642-03455-8},
YEAR = {2009},
PAGES = {355--367},
}
@MASTERSTHESIS{Bast94,
AUTHOR = {Bast, Hannah},
TITLE = {Fast Parallel Space Allocation, Estimation and Integer Sorting},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1994},
}
@INPROCEEDINGS{bastcelikik2009sac,
AUTHOR = {Celikik, Marjan and Bast, Holger},
EDITOR = {Shin, Dongwan},
TITLE = {Fast Error-Tolerant Search on Very Large Texts},
BOOKTITLE = {The 24th Annual ACM Symposium on Applied Computing},
PADDRESS = {New York, NY},
ADDRESS = {Honolulu, Hawaii, USA},
PUBLISHER = {ACM},
MONTH = {March},
ISBN = {978-1-60558-166-8},
DOI = {10.1145/1529282.1529669},
YEAR = {2009},
PAGES = {1724--1731},
ABSTRACT = { We consider the following spelling variants clustering problem: Given a list
of distinct words, called lexicon, compute (possibly overlapping) clusters of
words which are spelling variants of each other. This problem naturally
arises
in the context of error-tolerant full-text search of the following kind: For
a given query, return not only documents matching the query words exactly but
also those matching their spelling variants. This is the inverse of the
well-known "Did you mean: ... ?" web search engine feature, where the error
tolerance is on the side of the query, and not on the side of the documents.
We combine various ideas from the large body of literature on approximate
string searching and spelling correction techniques to a new algorithm for the
spelling variants clustering problem that is both accurate and very efficient
in time and space. Our largest lexicon, containing roughly 10 million words,
can be processed in about 16 minutes on a standard PC using 10 MB of
additional space. This beats the previously best scheme by a factor of two in
running time and by a factor of more than ten in space usage. We have
integrated our algorithms into the CompleteSearch engine in a way that
achieves error-tolerant search without significant blowup in neither index
size
nor query processing time.},
}
@UNPUBLISHED{bastcelikikmanolache2009-snippets,
AUTHOR = {Celikik, Marjan and Bast, Holger and Manolache, Gabriel},
TITLE = {Efficient Index-Based Snippet Generation},
YEAR = {2011},
NOTE = {unpublished},
ABSTRACT = { Ranked result lists with query-dependent snippets have become state of the art
in text search. They are typically implemented by searching, at query time,
for occurrences of the query words in the top-ranked documents. This
\emph{document-based} approach has three inherent problems: (i) when a
document is indexed by terms which it does not contain literally (e.g.,
related words or spelling variants), localization of the corresponding
snippets becomes problematic; (ii) each query operator (e.g., phrase or
proximity search) has to be implemented twice, on the index side in order to
compute the correct result set, and on the snippet generation side to generate
the appropriate snippets; and (iii) in a worst case, the whole document needs
to be scanned for occurrences of the query words, which is problematic for
very long documents.
We present a new \emph{index-based} method that localizes snippets by
information solely computed from the index, and that overcomes all three
problems. Unlike previous index-based methods, we show how to achieve this at
essentially no extra cost in query processing time, by a technique we call
\emph{query rotation}. We also show how our index-based method allows the
caching of individual segments instead of complete documents, which enables a
significantly larger cache hit ratio as compared to the document-based
approach. We have fully integrated our implementation with the CompleteSearch
engine.},
}
@INPROCEEDINGS{BastDH92,
AUTHOR = {Bast, Holger and Dietzfelbinger, Martin and Hagerup, Torben},
TITLE = {A Perfect Parallel Dictionary},
BOOKTITLE = {17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92)},
PADDRESS = {New York, NY, USA},
ADDRESS = {Prague, Czechoslovakia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {629},
YEAR = {1992},
PAGES = {133--141},
ABSTRACT = {We describe new randomized parallel algorithms for the problems
of interval allocation, construction of static dictionaries,
and maintenance of dynamic dictionaries.
All of our algorithms run optimally in constant time
with high probability.
Our main result is the construction of
what we call a \emph{perfect dictionary}, a scheme that
allows $p$ processors implementing a set $M$
in space proportional to $|M|$
to process batches of $p$ \emph{insert}, \emph{delete},
and \emph{lookup} instructions on $M$ in
constant time per batch.
Our best results are obtained for a new variant of
the CRCW PRAM model of computation called the
OR PRAM.
For other variants of the CRCW PRAM we show slightly
weaker results, with some resource bounds
increased by a factor of $\Theta(\log^k n)$,
where $k\in\IN$ is fixed but arbitrarily large.},
}
@INPROCEEDINGS{BastDMP06,
AUTHOR = {Bast, Holger and Dupret, Georges and Majumdar, Debapriyo and Piwowarski, Benjamin},
EDITOR = {Ackermann, Markus and Berendt, Bettina and Grobelnik, Marko and Hotho, Andreas and Mladenic, Dunja and Semeraro, Giovanni and Spiliopoulou, Myra and Stumme, Gerd and Svatek, Vojtech and van Someren, Maarten W.},
TITLE = {Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis},
BOOKTITLE = {Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005},
PADDRESS = {Berlin, Germany},
ADDRESS = {Porto, Portugal},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4289},
ISBN = {978-3-540-47697-9},
YEAR = {2006},
PAGES = {103--120},
ABSTRACT = {We show that eigenvector decomposition can be used to extract a term taxonomy
from a given collection of text documents. So far, methods based on eigenvector
decomposition, such as latent semantic indexing (LSI) or principal component
analysis (PCA), were only known to be useful for extracting symmetric relations
between terms. We give a precise mathematical criterion for distinguishing
between four kinds of relations of a given pair of terms of a given collection:
unrelated (car - fruit), symmetrically related (car - automobile),
asymmetrically related with the first term being more specific than the second
(banana - fruit), and asymmetrically related in the other direction (fruit -
banana). We give theoretical evidence for the soundness of our criterion, by
showing that in a simplified mathematical model the criterion does the
apparently right thing. We applied our scheme to the reconstruction of a
selected part of the open directory project (ODP) hierarchy, with promising
results. },
}
@INPROCEEDINGS{bastetal06spire,
AUTHOR = {Bast, Holger and Mortensen, Christian Worm and Weber, Ingmar},
EDITOR = {Crestani, Fabio and Ferragina, Paolo and Sanderson, Mark},
TITLE = {Output-Sensitive Autocompletion Search},
BOOKTITLE = {String Processing and Information Retrieval : 13th International Conference, SPIRE 2006},
PADDRESS = {Berlin, Germany},
ADDRESS = {Glasgow, GB},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4209},
ISBN = {978-3-540-45774-9},
YEAR = {2006},
PAGES = {150--162},
ABSTRACT = {We consider the following autocompletion search scenario: imagine a user of a
search engine typing a query; then with every keystroke display those
completions of the last query word that would lead to the best hits, and also
display the best such hits. The following problem is at the core of this
feature: for a fixed document collection, given a set D of documents, and an
alphabetical range W of words, compute the set of all word-in-document pairs (w
,d) from the collection such that w ∈W and d∈D. We present a new data structure
with the help of which such autocompletion queries can be processed, on the
average, in time linear in the input plus output size, independent of the size
of the underlying document collection. At the same time, our data structure
uses no more space than an inverted index. Actual query processing times on a
large test collection correlate almost perfectly with our theoretical bound.},
}
@INPROCEEDINGS{bastetal07sigir,
AUTHOR = {Bast, Holger and Chitea, Alexandru and Suchanek, Fabian and Weber, Ingmar},
EDITOR = {Clarke, Charlie and Fuhr, Norbert and Kando, Noriko},
TITLE = {ESTER: Efficient Search in Text, Entities, and Relations},
BOOKTITLE = {30th International Conference on Research and Development in Information Retrieval (SIGIR'07)},
PADDRESS = {New York, USA},
ADDRESS = {Amsterdam, Netherlands},
PUBLISHER = {ACM},
YEAR = {2007},
PAGES = {671--678},
}
@INPROCEEDINGS{BastFM06,
AUTHOR = {Bast, Holger and Funke, Stefan and Matijevic, Domagoj},
EDITOR = {Demetrescu, Camil and Goldberg, Andrew and Johnson, David},
TITLE = {TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing},
BOOKTITLE = {9th DIMACS Implementation Challenge --- Shortest Path},
PADDRESS = {Piscataway, New Jersey},
ADDRESS = {Piscataway, New Jersey},
PUBLISHER = {DIMACS},
YEAR = {2006},
}
@INPROCEEDINGS{BastFMSS07,
AUTHOR = {Bast, Holger and Funke, Stefan and Matijevic, Domagoj and Sanders, Peter and Schultes, Dominik},
EDITOR = {Applegate, David and Brodal, Gerth},
TITLE = {In Transit to Constant Time Shortest-Path Queries in Road Networks},
BOOKTITLE = {9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07)},
PADDRESS = {Philadelphia, USA},
ADDRESS = {New Orleans, USA},
PUBLISHER = {SIAM},
YEAR = {2007},
PAGES = {46--59},
}
@INCOLLECTION{BastFunkeMatjevic2009,
AUTHOR = {Bast, Holger and Funke, Stefan and Matijevic, Domagoj},
EDITOR = {Demetrescu, Camil and Goldberg, Andrew V. and Johnson, David S.},
TITLE = {Ultrafast shortest-path queries via transit nodes},
BOOKTITLE = {The shortest path problem : ninth DIMACS implemenation challenge},
ADDRESS = {Providence, RI},
PUBLISHER = {AMS},
SERIES = {DIMACS Series on Disrecte Mathematics and Theoretical Computer Science},
VOLUME = {74},
ISBN = {978-0-8218-4383-3},
YEAR = {2009},
PAGES = {175--192},
}
@INPROCEEDINGS{BastH91,
AUTHOR = {Bast, Holger and Hagerup, Torben},
TITLE = {Fast and Reliable Parallel Hashing},
BOOKTITLE = {3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91)},
PADDRESS = {New York, NY, USA},
ADDRESS = {Hilton Head Island, South Carolina, USA},
PUBLISHER = {ACM},
YEAR = {1991},
PAGES = {50--61},
ABSTRACT = {A perfect hash function for a (multi)set $X$ of
$n$ integers is an injective function $h:X\to\{1,\ldots,s\}$,
where $s=O(n)$, that can be stored in $O(n)$ space
and evaluated in constant time by a single processor.
We show that a perfect hash function for a given
multiset of $n$ integers can be constructed
optimally in $O(\log^* n)$ time using
$O(n/\log^* n)$ processors.
Our algorithm is faster than all previously published
methods.
More significantly, it is highly
reliable:
Whereas analyses of previous fast parallel
hashing schemes provided bounds on the expected
resource requirements only, our algorithm is
guaranteed to stay within the bounds given
with overwhelming probability.},
}
@INPROCEEDINGS{bastmajumdar05sigir,
AUTHOR = {Bast, Holger and Majumdar, Debapriyo},
EDITOR = {Marchionini, Gary and Moffat, Alistair and Tait, John and Baeza-Yates, Ricardo and Ziviani, Nivio},
TITLE = {Why Spectral Retrieval Works},
BOOKTITLE = {28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05)},
PADDRESS = {New York, USA},
ADDRESS = {Salvador, Brazil},
PUBLISHER = {ACM},
MONTH = {August},
ISBN = {1-58113-881-4},
YEAR = {2005},
PAGES = {11--18},
ABSTRACT = { We introduce the \emph{synonymy graph} as a new angle of looking at spectral
retrieval techniques, including latent semantic indexing (LSI) and its many
successors. The synonymy graph is defined for each pair of terms in the
collection, and our findings suggest that it is at the heart of what makes
spectral retrieval work in practice.
%
We show that LSI and many of its variants can be equivalently viewed as a
particular document expansion (not query expansion) process, where each term
effects the insertion of some other term if and only if the synonymy graph for
that term pair has a certain characteristic shape. We provide a simple,
parameterless algorithm for detecting that shape.
%
We point out inherent problems of every algorithm that bases its expansion
decisions merely on individual values of the synonymy graph, as done by almost
all existing methods. Our new algorithm overcomes these limitations, and it
consistently outperforms previous methods on a number of test collections.
%
Our synonymy graphs also shed light on the effectiveness of three fundamental
types of variations of the basic LSI scheme.},
}
@INPROCEEDINGS{BastMSTW2006a,
AUTHOR = {Bast, Holger and Majumdar, Debapriyo and Schenkel, Ralf and Theobald, Martin and Weikum, Gerhard},
EDITOR = {Dayal, Umeshwar and Whang, Kyu-Young and Lomet, David B. and Alonso, Gustavo and Lohman, Guy M. and Kersten, Martin L. and Cha, Sang Kyun and Kim, Young-Kuk},
TITLE = {{IO-Top-k}: Index-Access Optimized Top-k Query Processing},
BOOKTITLE = {Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006},
PADDRESS = {New York, USA},
ADDRESS = {Seoul, Korea},
PUBLISHER = {ACM},
ISBN = {1-59593-385-9},
YEAR = {2006},
PAGES = {475--486},
ABSTRACT = {Top-$k$ query processing is an important building block for ranked retrieval,
with applications ranging from text and data integration to distributed
aggregation of network logs and sensor data.
Top-$k$ queries operate on index lists for a query's elementary conditions
and aggregate scores for result candidates. One of the best implementation
methods in this setting is the family of threshold algorithms, which aim
to terminate the index scans as early as possible based on lower and upper
bounds for the final scores of result candidates. This procedure
performs sequential disk accesses for sorted index scans, but also has the
option
of performing random accesses to resolve score uncertainty. This entails
scheduling for the two kinds of accesses: 1) the prioritization of different
index lists in the sequential accesses, and 2) the decision on when to perform
random accesses and for which candidates.
The prior literature has studied some of these scheduling issues, but only for
each of the two access types in isolation.
The current paper takes an integrated view of the scheduling issues and develops
novel strategies that outperform prior proposals by a large margin.
Our main contributions are new, principled, scheduling methods based on a
Knapsack-related
optimization for sequential accesses and a cost model for random accesses.
The methods can be further boosted by harnessing probabilistic estimators for
scores,
selectivities, and index list correlations.
In performance experiments with three different datasets (TREC Terabyte, HTTP
server logs, and IMDB),
our methods achieved significant performance gains compared to the best
previously known methods.},
}
@INPROCEEDINGS{BastMSTW2006trec,
AUTHOR = {Bast, Holger and Majumdar, Debapriyo and Schenkel, Ralf and Theobald, Martin and Weikum, Gerhard},
EDITOR = {Voorhees, Ellen M. and Buckland, Lori Phillips},
TITLE = {IO-Top-k at TREC 2006: Terabyte Track},
BOOKTITLE = {The Fifteenth Text Retrieval Conference Proceedings, TREC 2006},
ORGANIZATION = {NIST},
PADDRESS = {Gaithersburg, Maryland, USA},
ADDRESS = {Gaithersburg, Maryland, USA},
PUBLISHER = {National Institute of Standards and Technology (NIST)},
MONTH = {November},
YEAR = {2006},
PAGES = {1--5},
}
@INPROCEEDINGS{BastMW07,
AUTHOR = {Bast, Holger and Majumdar, Debapriyo and Weber, Ingmar},
EDITOR = {M{\'a}rio J. Silva and Alberto H. F. Laender and Ricardo A. Baeza-Yates and Deborah L. McGuinness and Bj{\o}rn Olstad and {\O}ystein Haug Olsen and Andr{\'e} O. Falc{\~a}o},
TITLE = {Efficient interactive query expansion with CompleteSearch},
BOOKTITLE = {16th Conference on Information and Knowledge Management (CIKM'07)},
PADDRESS = {New York, USA},
ADDRESS = {Lisboa, Portugal},
PUBLISHER = {ACM},
DOI = {10.1145/1321440.1321560},
YEAR = {2007},
PAGES = {857--860},
ABSTRACT = {We present an efficient realization of the following interactive search engine
feature: as the user is typing the query, words that are related to the last
query word and that would lead to good hits are suggested, as well as selected
such hits. The realization has three parts: (i) building clusters of related
terms, (ii) adding this information as artificial words to the index such that
(iii) the described feature reduces to an instance of prefix search and
completion. An efficient solution for the latter is provided by the
CompleteSearch engine, with which we have integrated the proposed feature. For
building the clusters of related terms we propose a variant of latent semantic
indexing that, unlike standard approaches, is completely transparent to the
user. By experiments on two large test-collections, we demonstrate that the
feature is provided at only a slight increase in query processing time and
index size.},
}
@PHDTHESIS{BastPhD2000,
AUTHOR = {Bast, Hannah},
TITLE = {Provably Optimal Scheduling of Similar Tasks},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
MONTH = {February},
YEAR = {2000},
ABSTRACT = {We consider the problem of processing a given number of tasks on
a given number of processors as quickly as possible when the
processing times of the tasks are variable and not known in advance.
The tasks are assigned to the processors in chunks consisting
of several tasks at a time, and the difficulty lies in finding
the optimal tradeoff between the processors' load balance, which
is favoured by having small chunks, and the total scheduling overhead,
which will be the lower the fewer chunks there are.
Our studies are motivated by a practical problem from
high-performance computing, namely parallel-loop scheduling,
for which a large variety of heuristics have been proposed
in the past, but hardly any rigorous analysis has been presented to date.
Our work is based on a generic approach that covers
the whole spectrum of processing time irregularity.
This approach does not make any assumptions about task processing times,
but instead works with estimated ranges for processing times,
one for each chunk size, and a measure for the overall deviation of
the actual processing times from these estimates.
Our analysis provides a general upper bound applicable
for every conceivable setting of these parameters, together with lower
bounds showing that no algorithm can do significantly better than
the ones we propose.
Our general result implies optimal bounds for a
whole variety of specific settings, including the modelling of
task processing times as independent, identically
distributed random variables, which underlies most of the
previously existing heuristics.
Our results confirm the practicability of certain
well-established techniques for parallel-loop scheduling,
while, on the other hand, revealing major flaws in other approaches.},
}
@INPROCEEDINGS{bastweber05wea,
AUTHOR = {Bast, Holger and Weber, Ingmar},
EDITOR = {Nikoletseas, Sotiris},
TITLE = {Don't Compare Averages},
BOOKTITLE = {4th International Workshop on Efficient and Experimental Algorithms (WEA'05)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Santorini Island, Greece},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3503},
YEAR = {2005},
PAGES = {67--76},
}
@INPROCEEDINGS{bastweber05wiri,
AUTHOR = {Bast, Holger and Weber, Ingmar},
EDITOR = {Adachi, Jun and Shan, Wang and Vakali, Athena},
TITLE = {Insights from Viewing Ranked Retrieval as Rank Aggregation},
BOOKTITLE = {Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05)},
PADDRESS = {Washington, USA},
ADDRESS = {Tokyo, Japan},
PUBLISHER = {IEEE},
MONTH = {April},
YEAR = {2005},
PAGES = {243--248},
}
@INPROCEEDINGS{bastweber06faceted,
AUTHOR = {Bast, Holger and Weber, Ingmar},
EDITOR = {Broder, Andrei and Maarek, Yoelle},
TITLE = {When You're Lost For Words: Faceted Search With Autocompletion},
BOOKTITLE = {SIGIR'06 Workshop on Faceted Search},
PADDRESS = {New York, USA},
ADDRESS = {Seattle, USA},
PUBLISHER = {ACM},
MONTH = {August},
YEAR = {2006},
PAGES = {31--35},
}
@INPROCEEDINGS{bastweber06sigir,
AUTHOR = {Bast, Holger and Weber, Ingmar},
EDITOR = {Efthimiadis, Efthimis N. and Dumais, Susan and Hawking, David and J{\"a}rvellin, Kalervo},
TITLE = {Type Less, Find More: Fast Autocompletion Search with a Succinct Index},
BOOKTITLE = {SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Seattle, USA},
PUBLISHER = {ACM},
ISBN = {1-59593-369-7},
YEAR = {2006},
PAGES = {364--371},
ABSTRACT = {We consider the following full-text search autocompletion feature. Imagine a
user of a search engine typing a query. Then with every letter being typed, we
would like an instant display of completions of the last query word which would
lead to good hits. At the same time, the best hits for any of these completions
should be displayed. Known indexing data structures that apply to this problem
either incur large processing times for a substantial class of queries, or they
use a lot of space. We present a new indexing data structure that uses no more
space than a state-of-the-art compressed inverted index, but with 10 times
faster query processing times. Even on the large TREC Terabyte collection,
which comprises over 25 million documents, we achieve, on a single machine and
with the index on disk, average response times of one tenth of a second. We
have built a full-fledged, interactive search engine that realizes the proposed
autocompletion feature combined with support for proximity search,
semi-structured (XML) text, subword and phrase completion, and semantic tags.},
}
@INPROCEEDINGS{bastweber07cidr,
AUTHOR = {Bast, Holger and Weber, Ingmar},
EDITOR = {Weikum, Gerhard},
TITLE = {The CompleteSearch Engine: Interactive, Efficient, and Towards IR \& DB integration},
BOOKTITLE = {CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research},
PADDRESS = {WWW},
ADDRESS = {Asilomar, CA, USA},
PUBLISHER = {VLDB Endowment},
YEAR = {2007},
PAGES = {88--95},
ABSTRACT = {We describe CompleteSearch, an interactive search engine that offers the user a
variety of complex features, which at first glance have little in common, yet
are all provided via one and the same highly optimized core mechanism. This
mechanism answers queries for what we call context-sensitive prefix search and
completion: given a set of documents and a word range, compute all words from
that range which are contained in one of the given documents, as well as those
of the given documents which contain a word from the given range.
Among the supported features are: (i) automatic query completion, for example,
find all completions of the prefix “seman” that occur in the context of the
word “ontology”, as well as the best hits for any such completion; (ii)
semi-structured (XML) retrieval, for example, find all emailmessages with
“dbworld” in the subject line; (iii) semantic search, for example, find all
politicians which had a private audience with the pope; (iv) DB-style joins and
grouping, for example, find the most prolific authors with at least one paper
in both “SIGMOD” and “SIGIR”; and (v) arbitrary combinations of these.
The prefix search and completion mechanism of Complete- Search is realized via
a novel kind of index data structure, which enables subsecond query processing
times for collections up to a terabyte of data, on a single PC. We report on a
number of lessons learned in the process of building the system and on our
experience with a number of publicly used deployments.},
}
@INPROCEEDINGS{bastweber07gwem,
AUTHOR = {Bast, Holger and Weber, Ingmar},
EDITOR = {Gronau, Norbert},
TITLE = {Managing Helpdesk Tasks with CompleteSearch: A Case Study},
BOOKTITLE = {4th Conference on Professional Knowledge Management (WM'07)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Potsdam, Germany},
PUBLISHER = {GITO},
VOLUME = {2},
ISBN = {978-3-936771-98-5},
YEAR = {2007},
PAGES = {101--108},
ABSTRACT = {CompleteSearch is a highly interactive search engine, which, instantly after
every single keystroke, offers to the user various kinds of feedback, like
promising query completions or refinements by category. We combined
CompleteSearch with our institute's helpdesk system and carried out a small
user study with some of the staff operating the helpdesk. Participants were
asked to process ten typical helpdesk requests, alternatingly using
CompleteSearch and the off-the-shelf Google Desktop Search. All participants
preferred CompleteSearch over Google Desktop, mainly because of its speed, the
feeling of being in power, and the enhanced search facilities. },
}
@INCOLLECTION{Baswana2004b,
AUTHOR = {Baswana, Surender and Sen, Sandeep},
EDITOR = {Sahni, Sartaj and Mehta, Dinesh},
TITLE = {Randomized graph data-structures for approximate shortest path problem},
BOOKTITLE = {Handbook of Data Structures and Applications},
CHAPTER = {38},
ADDRESS = {Boca Raton, USA},
PUBLISHER = {Chapman \& Hall/CRC},
EDITION = {1},
MONTH = {October},
SERIES = {Chapman \& Hall/CRC Computer \& Information Science Series},
VOLUME = {4},
ISBN = {1584884355},
YEAR = {2004},
PAGES = {38.1--38.19},
}
@INPROCEEDINGS{BaswanaEtal2005,
AUTHOR = {Baswana, Surender and Telikepalli, Kavitha and Mehlhorn, Kurt and Pettie, Seth},
TITLE = {New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners},
BOOKTITLE = {Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05)},
ORGANIZATION = {ACM-SIAM},
PADDRESS = {Philadelphia, USA},
ADDRESS = {Vancouver, Canada},
PUBLISHER = {SIAM},
ISBN = {0-89871-585-7},
YEAR = {2005},
PAGES = {672--681},
}
@ARTICLE{BaswanaSen2007,
AUTHOR = {Baswana, Surender and Sen, Sandeep},
JOURNAL = {Random Structures \& Algorithms},
TITLE = {A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs},
ADDRESS = {New York, NY, USA},
NUMBER = {4},
PUBLISHER = {Wiley},
MONTH = {July},
VOLUME = {30},
ISBN = {1042-9832},
DOI = {10.1002/rsa.20130},
YEAR = {2007},
PAGES = {532--563},
ABSTRACT = {Let G = (V,E) be an undirected weighted graph on |V | = n vertices and |E| = m
edges. A t-spanner of the graph G, for any t 1, is a subgraph (V,ES), ES E,
such that the distance between any pair of vertices in the subgraph is at most
t times the distance between them in the graph G. Computing a t-spanner of
minimum size (number of edges) has been a widely studied and well-motivated
problem in computer science. In this paper we present the first linear time
randomized algorithm that computes a t-spanner of a given weighted graph.
Moreover, the size of the t-spanner computed essentially matches the worst case
lower bound implied by a 43-year old girth lower bound conjecture made
independently by Erds, Bollob{\'a}s, and Bondy \& Simonovits.Our algorithm uses a
novel clustering approach that avoids any distance computation altogether. This
feature is somewhat surprising since all the previously existing algorithms
employ computation of some sort of local or global distance information, which
involves growing either breadth first search trees up to (t)-levels or full
shortest path trees on a large fraction of vertices. The truly local approach
of our algorithm also leads to equally simple and efficient algorithms for
computing spanners in other important computational environments like
distributed, parallel, and external memory. © 2006 Wiley Periodicals, Inc.
Random Struct. Alg., 2007 },
}
@ARTICLE{BatraSharma2010,
AUTHOR = {Batra, Prashant and Sharma, Vikram},
JOURNAL = {Journal of Symbolic Computation},
TITLE = {Bounds on absolute positiveness of multivariate polynomials},
ADDRESS = {Amsterdam},
NUMBER = {6},
PUBLISHER = {Elsevier},
VOLUME = {45},
ISBN = {0747-7171},
DOI = {10.1016/j.jsc.2010.01.012},
YEAR = {2010},
PAGES = {617--628},
}
@INPROCEEDINGS{Baumann2004,
AUTHOR = {Baumann, Nadine and K{\"o}hler, Ekkehard},
EDITOR = {Fiala, Jiri and Koubek, Vaclav and Kratochvil, Jan},
TITLE = {Approximating Earliest Arrival Flows with Flow-Dependent Transit Times},
BOOKTITLE = {Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004},
ORGANIZATION = {Mathematical Foundations of Computer Science (MFCS)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Prague, Czech Republic},
PUBLISHER = {Springer},
MONTH = {August},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3153},
ISBN = {3-540-22823-3},
YEAR = {2004},
PAGES = {599--610},
ABSTRACT = {For the earliest arrival flow problem one is given a network $G=(V,
A)$ with capacities $u(a)$ and transit times $\tau(a)$ on its arcs $a
\in A$, together with a source and a sink vertex $s, t \in V$. The
objective is to send flow from $s$ to $t$ that moves through the
network over time, such that for each point in time $\theta \in
[0,T)$ the maximum possible amount of flow reaches $t$. If, for
each $\theta \in [0,T)$ this flow is a maximum flow for time horizon
$\theta$, then it is called \emph{earliest arrival flow}. In
practical applications a higher congestion of an arc in the network
often implies a considerable increase in transit time. Therefore,
in this paper we study the earliest arrival problem for the case
that the transit time of each arc in the network at each time
$\theta$ depends on the flow on this particular arc at that time
$\theta$.
For constant transit times it has been shown by Gale that earliest
arrival flows exist for any network. We give examples, showing that
this is no longer true for flow-dependent transit times. For that
reason we define an optimization version of this problem where the
objective is to find flows that are almost earliest arrival flows.
In particular, we are interested in flows that, for each $\theta \in
[0,T)$, need only $\alpha$-times longer to send the maximum flow to
the sink. We give both constant lower and upper bounds on $\alpha$;
furthermore, we present a constant factor approximation algorithm
for this problem. Finally, we give some computational results to
show the practicability of the designed approximation algorithm.},
}
@INPROCEEDINGS{BaumbachFKKMP2011,
AUTHOR = {Baumbach, Jan and Friedrich, Tobias and K{\"o}tzing, Timo and Krohmer, Anton and M{\"u}ller, Joachim and Pauling, Josch},
TITLE = {Efficient algorithms for extracting biological key pathways with global constraints},
BOOKTITLE = {GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation},
PADDRESS = {New York, NY},
ADDRESS = {Philadelphia, PA, USA},
PUBLISHER = {ACM},
ISBN = {978-1-4503-1177-9},
DOI = {10.1145/2330163.2330188},
YEAR = {2012},
PAGES = {169--176},
}
@MASTERSTHESIS{BausDipl05,
AUTHOR = {Baus, Andreas},
TITLE = {Symbolic Constraints in Linear Integer Programming},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {March},
YEAR = {2005},
}
@MASTERSTHESIS{Baus/Diplom04,
AUTHOR = {Baus, Andreas},
TITLE = {Symbolic Constraints in Linear Integer Programming},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {November},
YEAR = {2004},
}
@INPROCEEDINGS{BBDFKN09,
AUTHOR = {Baswana, Surender and Biswas, Somenath and Doerr, Benjamin and Friedrich, Tobias and Kurur, Piyush P. and Neumann, Frank},
EDITOR = {Jansen, Thomas and Garibay, Ivan and Wiegand, R.Paul and Wu, Annie S.},
TITLE = {Computing Single Source Shortest Paths using Single-Objective Fitness Functions},
BOOKTITLE = {FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X},
PADDRESS = {New York, NY},
ADDRESS = {Orlando, USA},
PUBLISHER = {ACM},
ISBN = {978-1-60558-414-0},
DOI = {10.1145/1527125.1527134},
YEAR = {2009},
PAGES = {59--66},
}
@INPROCEEDINGS{BBP:SCG98,
AUTHOR = {Br{\"o}nnimann, Herv{\'e} and Burnikel, Christoph and Pion, Sylvain},
TITLE = {Interval analysis yields efficient dynamic filters for computational geometry},
BOOKTITLE = {Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98)},
ORGANIZATION = {Association Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Minneapolis, Minnesota},
NUMBER = {14},
PUBLISHER = {ACM Press},
MONTH = {June},
ISBN = {0-89791-973-4},
YEAR = {1998},
PAGES = {165--174},
ABSTRACT = {We discuss interval techniques for speeding up the exact evaluation of
geometric predicates and describe an efficient implementation of interval
arithmetic that is strongly influenced by the rounding modes of the
widely used IEEE 754 standard. Using this approach we engineer an
efficient floating
point filter for the computation of the sign of a determinant that works
for arbitrary dimensions. Furthermore we show how to use our interval
techniques for exact linear optimization problems of low dimension as
they arise in geometric computing. We validate our approach
experimentally, comparing it with other static, dynamic and semi-static
filters.},
}
@INPROCEEDINGS{BCMP1999,
AUTHOR = {Brengel, Klaus and Crauser, Andreas and Meyer, Ulrich and Ferragina, Paolo},
EDITOR = {Vitter, Jeffrey S. and Zaroliagis, Christos D.},
TITLE = {An Experimental Study of Priority Queues in External Memory},
BOOKTITLE = {Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99},
PADDRESS = {Berlin},
ADDRESS = {London, UK},
PUBLISHER = {Springer},
MONTH = {July},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1668},
ISBN = {3-540-66427-0},
YEAR = {1999},
PAGES = {345--359},
}
@INPROCEEDINGS{BCT03:SweepSynchro,
AUTHOR = {Beldiceanu, Nicolas and Carlsson, Mats and Thiel, Sven},
TITLE = {Sweep Synchronization as a Global Propagation Mechanism},
BOOKTITLE = {Fifth International Workshop on Integration of AI and OR Techniques
in Constraint Programming for Combinatorial Optimization Problems},
PADDRESS = {Montreal, Canada},
ADDRESS = {Montreal, Canada},
PUBLISHER = {Centre for Research on Transportation},
MONTH = {May},
YEAR = {2003},
PAGES = {139--152},
}
@TECHREPORT{BCT2002:SumOfWeights,
AUTHOR = {Beldiceanu, Nicolas and Carlsson, Mats and Thiel, Sven},
TITLE = {Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint},
INSTITUTION = {Swedish Institute of Computer Science},
TYPE = {Technical Report},
ADDRESS = {Uppsala, Sweden},
NUMBER = {SICS-T-2002:14-SE},
MONTH = {October},
ISBN = {1100-3154},
YEAR = {2002},
PAGES = {46},
ABSTRACT = {This article introduces the sum of weights of distinct values
constraint, which can be seen as a generalization of the number of
distinct values as well as of the alldifferent, and the relaxed
alldifferent constraints. This constraint holds if a cost variable is
equal to the sum of the weights associated to the distinct values taken
by a given set of variables. For the first aspect, which is related to
domination, we present four filtering algorithms. Two of them lead to
perfect pruning when each domain variable consists of one set of
consecutive values, while the two others take advantage of holes in the
domains. For the second aspect, which is connected to maximum matching
in a bipartite graph, we provide a complete filtering algorithm for the
general case. Finally we introduce several generic deduction rules,
which link both aspects of the constraint. These rules can be applied to
other optimization constraints such as the minimum weight alldifferent
constraint or the global cardinality constraint with costs. They also
allow taking into account external constraints for getting enhanced
bounds for the cost variable. In practice, the sum of weights of
distinct values constraint occurs in assignment problems where using a
resource once or several times costs the same. It also captures
domination problems where one has to select a set of vertices in order
to control every vertex of a graph.},
}
@INPROCEEDINGS{BCW-ECARC2007,
AUTHOR = {Berberich, Eric and Caroli, Manuel and Wolpert, Nicola},
TITLE = {Exact Computation of Arrangements of Rotated Conics},
BOOKTITLE = {Proceedings of 23rd European Workshop on Computational Geometry},
PADDRESS = {Graz, Austria},
ADDRESS = {Graz, Austria},
PUBLISHER = {Technische Universitaet Graz},
MONTH = {March},
ISBN = {978-3-902465-62-7},
YEAR = {2007},
PAGES = {231--234},
ABSTRACT = {Transformations of geometric objects, like translation and rotation,
are fundamental operations in CAD-systems. Rotations trigger
the need to deal with trigonometric functions, which is hard to
achieve when aiming for exact and robust implementation.
We show how we efficiently compute the planar arrangement
of conics rotated by angles that can be constructed
with straightedge and compass. Well-known examples are multiples of
$45{^{\circ}}$, $30{^{\circ}}$, and $15{^{\circ}}$.
The main problem one has to solve is root-isolation of univariate
polynomials $p(x)\in \mathbb{Q}(\sqrt{c_1})\ldots(\sqrt{c_d})[x]$, for which
we use a modified version of the Descartes method.
For $d=1$,
%In the case $p(x)\in \mathbb{Q}(\sqrt{c})[x]$
we additionally present a new method that isolates the real roots
of $p$ by using root isolation for polynomials $q(x)\in\mathbb{Q}[x]$ only.
We show results of our benchmark experiences comparing both
methods.},
}
@INPROCEEDINGS{BDN2010,
AUTHOR = {B{\"o}ttcher, S{\"u}ntje and Doerr, Benjamin and Neumann, Frank},
EDITOR = {Schaefer, Robert and Cotta, Carlos and Kolodziej, Joanna and Rudolph, G{\"u}nter},
TITLE = {Optimal fixed and adaptive mutation rates for the {LeadingOnes} problem},
BOOKTITLE = {Parallel Problem Solving from Nature - PPSN XI. - Pt. 1},
PADDRESS = {Berlin},
ADDRESS = {Krakow, Poland},
PUBLISHER = {Springer},
MONTH = {September},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6238},
ISBN = {978-3-642-15843-8},
DOI = {10.1007/978-3-642-15844-5_1},
YEAR = {2010},
PAGES = {1--10},
}
@INPROCEEDINGS{Becchetti2003,
AUTHOR = {Becchetti, Luca and Leonardi, Stefano and Marchetti-Spaccamela, Alberto and Sch{\"a}fer, Guido},
TITLE = {Scheduling to minimize flow time metrics},
BOOKTITLE = {International Parallel and Distributed Processing Symposium (IPDPS-03)},
ORGANIZATION = {IEEE},
PADDRESS = {Los Alamitos, USA},
ADDRESS = {Nice, France},
PUBLISHER = {IEEE},
ISBN = {0-7695-1926-1},
YEAR = {2003},
PAGES = {223b--CDROM},
}
@INPROCEEDINGS{Becker2011,
AUTHOR = {Christodoulou, George and Mehlhorn, Kurt and Pyrga, Evangelia},
EDITOR = {Demetrescu, Camil and Halld{\'o}rsson, Magn{\'u}s M.},
TITLE = {Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms},
BOOKTITLE = {Algorithms - ESA 2011 : 19th Annual European Symposium},
PADDRESS = {Berlin},
ADDRESS = {Saarbr{\"u}cken, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6942},
ISBN = {978-3-642-23718-8},
DOI = {10.1007/978-3-642-23719-5_11},
YEAR = {2011},
PAGES = {119--130},
}
@MASTERSTHESIS{Becker96,
AUTHOR = {Becker, J{\"o}rg},
TITLE = {{Allgemeine approximative Kongruenz zweier Punktmengen im R³}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1996},
}
@TECHREPORT{beef-ecscaca-04,
AUTHOR = {Berberich, Eric and Eigenwillig, Arno and Emiris, Ioannis and Fogel, Efraim and Hemmer, Michael and Halperin, Dan and Kakargias, Athanasios and Kettner, Lutz and Mehlhorn, Kurt and Pion, Sylvain and Sch{\"o}mer, Elmar and Teillaud, Monique and Wein, Ron and Wolpert, Nicola},
TITLE = {An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs},
INSTITUTION = {Effective Computational Geometry for Curves and Surfaces},
TYPE = {Report},
ADDRESS = {Sophia Antipolis, France},
NUMBER = {ECG-TR-361200-01},
YEAR = {2004},
PAGES = {11},
}
@INPROCEEDINGS{behhms-cbcabocp-2002,
AUTHOR = {Berberich, Eric and Eigenwillig, Arno and Hemmer, Michael and Hert, Susan and Mehlhorn, Kurt and Sch{\"o}mer, Elmar},
EDITOR = {M{\"o}hring, Rolf and Raman, Rajeev},
TITLE = {A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons},
BOOKTITLE = {Algorithms - ESA 2002 : 10th Annual European Symposium},
PADDRESS = {Berlin, Germany},
ADDRESS = {Rome, Italy},
PUBLISHER = {Springer},
MONTH = {September},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2461},
ISBN = {3-540-44180-8},
YEAR = {2002},
PAGES = {174--186},
ABSTRACT = {We give an exact geometry kernel for conic arcs, algorithms for exact
computation with low-degree algebraic numbers, and an algorithm for
computing the arrangement of conic arcs that immediately leads to
a realization of regularized boolean operations on conic polygons. A conic
polygon, or polygon for short, is anything that can be obtained from
linear or conic halfspaces (= the set of points where a linear or quadratic
function is non-negative) by regularized boolean operations. The algorithm and
its implementation are complete (they can handle all cases), exact (they give
the mathematically correct result), and efficient (they can handle inputs with
several hundred primitives).},
}
@INPROCEEDINGS{Behle2007,
AUTHOR = {Behle, Markus},
EDITOR = {Dress, Andreas and Xu, Yinfeng and Zhu, Binhai},
TITLE = {On threshold BDDs and the optimal variable ordering problem},
BOOKTITLE = {Combinatorial Optimization and Applications : First International Conference, COCOA 2007},
PADDRESS = {Berlin, Germany},
ADDRESS = {Xi’an, China},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4616},
ISBN = {3-540-73555-7},
DOI = {10.1007/978-3-540-73556-4_15},
YEAR = {2007},
PAGES = {124--135},
}
@INPROCEEDINGS{Behle2007A,
AUTHOR = {Behle, Markus and J{\"u}nger, Michael and Liers, Frauke},
EDITOR = {Demetrescu, Camil},
TITLE = {A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem},
BOOKTITLE = {Experimental Algorithms : 6th International Workshop, WEA 2007},
PADDRESS = {Berlin, Germany},
ADDRESS = {Rome, Italy},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4525},
ISBN = {3-540-72844-3},
DOI = {10.1007/978-3-540-72845-0_29},
YEAR = {2007},
PAGES = {379--392},
}
@MASTERSTHESIS{Behrens2000,
AUTHOR = {Behrens, Christian},
TITLE = {{Solid Modeling durch Boolesche Operationen}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {January},
YEAR = {2000},
}
@INPROCEEDINGS{Bei2015,
AUTHOR = {Bei, Xiaohui},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M. and Iwama, Kazuo and Kobayashi, Naoki and Speckmann, Bettina},
TITLE = {Solving Linear Programming with Constraints Unknown},
BOOKTITLE = {Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I.},
ORGANIZATION = {European Association for Theoretical Computer Science (EATCS)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Kyoto, Japan},
PUBLISHER = {Springer},
MONTH = {July},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1},
ISBN = {978-3-662-47671-0},
DOI = {10.1007/978-3-662-47672-7_11},
YEAR = {2015},
PAGES = {129--142},
}
@MASTERSTHESIS{Beier2000,
AUTHOR = {Beier, Rene},
TITLE = {{Eine Heuristik f{\"u}r das Gossiping-Problem}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {August},
YEAR = {2000},
}
@INPROCEEDINGS{Beier2003,
AUTHOR = {Beier, Rene and V{\"o}cking, Berthold},
TITLE = {Random Knapsack in Expected Polynomial Time},
BOOKTITLE = {Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03)},
ORGANIZATION = {Association of Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {San Diego, USA},
PUBLISHER = {ACM},
ISBN = {1-58113-674-9},
YEAR = {2003},
PAGES = {232--241},
ABSTRACT = {In this paper, we present the first average-case analysis proving an expected
polynomial running time for an exact algorithm for the 0/1 knapsack problem.
In particular, we prove, for various input distributions, that the number of
{\em dominating solutions\/} (i.e., Pareto-optimal knapsack fillings)
to this problem is polynomially bounded in the number of available items.
An algorithm by Nemhauser and Ullmann can enumerate these solutions very
efficiently so that a polynomial upper bound on the number of dominating
solutions
implies an algorithm with expected polynomial running time.
The random input model underlying our analysis is very general
and not restricted to a particular input distribution. We assume adversarial
weights and randomly drawn profits (or vice versa). Our analysis covers general
probability
distributions with finite mean, and, in its most general form, can even
handle different probability distributions for the profits of different items.
This feature enables us to study the effects of correlations between profits
and weights. Our analysis confirms and explains practical studies showing
that so-called {\em strongly correlated\/} instances are harder to solve than
{\em weakly correlated\/} ones.},
}
@INPROCEEDINGS{Beier2003a,
AUTHOR = {Banderier, Cyril and Beier, Rene and Mehlhorn, Kurt},
EDITOR = {Rovan, Branislav and Vojtas, Peter},
TITLE = {Smoothed Analysis of Three Combinatorial Problems},
BOOKTITLE = {Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003},
ORGANIZATION = {European Association for Theoretical Computer Science},
PADDRESS = {Berlin, Germany},
ADDRESS = {Bratislava, Slovak Republic},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2747},
ISBN = {3-540-40671-9},
DOI = {10.1007/b11836},
YEAR = {2003},
PAGES = {198--207},
ABSTRACT = { Smoothed analysis combines elements over worst-case and
average case analysis. For an instance $x$, the smoothed complexity is the
average complexity of an instance obtained from $x$ by a perturbation. The
smoothed complexity of a problem is the worst smoothed complexity of any
instance. Spielman and Teng introduced this notion for
continuous problems. We apply the concept to combinatorial problems and study
the smoothed complexity of three classical discrete problems: quicksort,
left-to-right maxima counting, and shortest paths.},
}
@INPROCEEDINGS{Beier2004a,
AUTHOR = {Beier, Rene and V{\"o}cking, Berthold},
TITLE = {Probabilistic Analysis of {Knapsack} Core Algorithms},
BOOKTITLE = {Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04)},
ORGANIZATION = {Association of Computing Machinery (ACM) and SIAM},
PADDRESS = {New York, USA},
ADDRESS = {New Orleans, USA},
PUBLISHER = {ACM},
ISBN = {0-89871-558-X},
YEAR = {2004},
PAGES = {461--470},
ABSTRACT = {We study the average-case performance of algorithms for the binary knapsack
problem.
Our focus lies on the analysis of so-called {\em core algorithms}, the
predominant
algorithmic concept used in practice.
These algorithms start with the computation of an optimal fractional solution
that has only one fractional item and then they exchange items until an optimal
integral solution is found.
The idea is that in many cases the optimal integral solution should be close to
the fractional
one such that only a few items need to be exchanged.
Despite the well known hardness of the knapsack problem on worst-case instances,
practical studies show that knapsack core algorithms can solve large scale
instances very efficiently.
For example, they exhibit almost linear running time on purely random inputs.
In this paper, we present the first theoretical result on the running time of
core algorithms that comes close to the results observed in practical
experiments.
We prove an upper bound of
$O(n \, \polylog(n))$ on the expected running time of a core algorithm on
instances with $n$ items whose profits and weights are drawn independently,
uniformly at random.
A previous analysis on the average-case complexity of the knapsack problem
proves
a running time of $O(n^4)$, but for a different kind of algorithms.
The previously best known upper bound on the running time of core
algorithms is polynomial as well. The degree of this polynomial, however, is
at least a large three digit number. In addition to uniformly random instances,
we
investigate harder instances in which profits and weights are pairwise
correlated.
For this kind of instances, we can prove a tradeoff describing how the degree of
correlation influences the running time.},
}
@INPROCEEDINGS{Beier2004b,
AUTHOR = {Beier, Rene and Krysta, Piotr and Czumaj, Artur and V{\"o}cking, Berthold},
TITLE = {Computing Equilibria for Congestion Games with (Im)perfect Information},
BOOKTITLE = {Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04)},
ORGANIZATION = {Association of Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {New Orleans, USA},
PUBLISHER = {ACM},
ISBN = {0-89871-558-X},
YEAR = {2004},
PAGES = {739--748},
ABSTRACT = {We study algorithmic questions concerning a basic
microeconomic congestion game in which there is a single provider
that offers a service to a set of potential customers. Each
customer has a particular demand of service and the behavior of
the customers is determined by utility functions that are
non-increasing in the congestion. Customers decide whether to join
or leave the service based on the experienced congestion and the
offered prices. Following standard game theory, we
assume each customer behaves in the most rational way. If the
prices of service are fixed, then such a customer behavior leads
to a pure, not necessarily unique Nash equilibrium among the
customers. In order to evaluate marketing strategies, the service
provider is interested in estimating its revenue under the best and
worst customer equilibria. We study the complexity of this problem
under different models of information available to the provider.
%
\begin{itemize}
\item We first consider the classical model in which the provider
has perfect knowledge of the behavior of all customers. We present
a complete characterization of the \emph{complexity of computing
optimal pricing strategies} and of \emph{computing best and worst
equilibria}. Basically, we show that most of these problems are
inapproximable in the worst case but admit an
``average-case FPAS.'' Our average case analysis covers general
distributions for customer demands and utility thresholds.
We generalize our analysis to robust equilibria
in which players change their strategies only when this promises
a significant utility improvement.
%
\item We extend our analysis to a more realistic model in which
the provider has \emph{incomplete information}. Following the game
theoretic framework of Bayesian games introduced by Harsanyi, we
assume that the provider is aware of probability distributions
describing the behavior of the customers and aims at estimating
its expected revenue under best and worst equilibria. Somewhat
counterintuitive, we obtain an FPRAS for the equilibria problem
in the model with imperfect information although the problem with
perfect information is inapproximable under the worst case measures.
In particular, the worst case complexity of the considered
stochastic equilibria problems increases with the precision of the
available knowledge.
\end{itemize}},
}
@INPROCEEDINGS{Beier2004c,
AUTHOR = {Beier, Rene and V{\"o}cking, Berthold},
TITLE = {Typical Properties of Winners and Losers in Discrete Optimization},
BOOKTITLE = {Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04)},
ORGANIZATION = {Association of Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Chicago, USA},
PUBLISHER = {ACM},
MONTH = {June},
ISBN = {1-58113-852-0},
YEAR = {2004},
PAGES = {343--352},
ABSTRACT = {We present a probabilistic analysis for a large class of combinatorial
optimization problems containing, e.g., all {\em binary optimization
problems} defined by linear constraints and a linear objective
function over $\{0,1\}^n$. By parameterizing which constraints are of
stochastic and which are of adversarial nature, we obtain a
semi-random input model that enables us to do a general average-case
analysis for a large class of optimization problems while at the same
time taking care for the combinatorial structure of individual
problems. Our analysis covers various probability distributions for
the choice of the stochastic numbers and includes {\em smoothed
analysis} with Gaussian and other kinds of perturbation models as a
special case. In fact, we can exactly characterize the smoothed
complexity of optimization problems in terms of their random
worst-case complexity.
\begin{center}
\begin{minipage}{0.42\textwidth}
A binary optimization problem has a {\em polynomial smoothed complexity}
if and only if it has a pseudopolynomial complexity.
\end{minipage}
\end{center}
Our analysis is centered around structural properties of binary optimization
problems, called {\em winner}, {\em loser}, and {\em feasibility gaps}. We
show, when the coefficients of the objective function and/or some of the
constraints are stochastic, then there usually exist a polynomial
$n^{-\Omega(1)}$ gap between the best and the second best solution as well as
a polynomial slack to the boundary of the constraints. Similar to the
condition number for linear programming, these gaps describe the sensitivity
of the optimal solution to slight perturbations of the input and
can be used to bound the necessary accuracy as well as the complexity
for solving an instance. We exploit the gaps in form of an
adaptive rounding scheme increasing the accuracy of calculation until the
optimal solution is found. The strength of our techniques is illustrated by
applications to various \npc-hard optimization problems from mathematical
programming, network design, and scheduling for which we obtain the the first
algorithms with polynomial average-case/smoothed complexity.},
}
@ARTICLE{Beier2004e,
AUTHOR = {Beier, Ren{\'e} and V{\"o}cking, Berthold},
JOURNAL = {Journal of Computer and System Sciences},
TITLE = {Random knapsack in expected polynomial time},
NUMBER = {3},
PUBLISHER = {Elsevier},
MONTH = {June},
VOLUME = {69},
YEAR = {2004},
PAGES = {306--329},
ABSTRACT = {We present the first average-case analysis proving a polynomial upper bound
on the expected running time of an exact algorithm for the 0/1 knapsack problem.
In particular, we prove for various input distributions, that the number of
Pareto-optimal knapsack fillings is polynomially bounded in the number of availa
ble items.
An algorithm by Nemhauser and Ullmann can enumerate these solutions very
efficiently so that a polynomial upper bound on the number of Pareto-optimal sol
utions
implies an algorithm with expected polynomial running time.
The random input model underlying our analysis is quite general
and not restricted to a particular input distribution. We assume adversarial
weights and randomly drawn profits (or vice versa). Our analysis covers general
probability
distributions with finite mean and, in its most general form, can even
handle different probability distributions for the profits of different items.
This feature enables us to study the effects of correlations between profits
and weights. Our analysis confirms and explains practical studies showing
that so-called {\em strongly correlated\/} instances are harder to solve than
{\em weakly correlated\/} ones.},
}
@ARTICLE{Beier2006,
AUTHOR = {Beier, Ren{\'e} and V{\"o}cking, Berthold},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Typical Properties of Winners and Losers in Discrete Optimization},
ADDRESS = {Philadelphia, PA, USA},
NUMBER = {4},
PUBLISHER = {SIAM},
MONTH = {February},
VOLUME = {35},
YEAR = {2006},
PAGES = {855--881},
ABSTRACT = {We present a probabilistic analysis of a large class of combinatorial
optimization problems containing all {\em binary optimization problems}
defined by linear constraints and a linear objective function over $\{0,1\}^n$.
Our analysis is based on a semirandom input model that preserves the
combinatorial structure of the underlying optimization problem by
parameterizing which input numbers are of a stochastic and which are of an
adversarial nature. This input model covers various probability distributions
for the choice of the stochastic numbers and includes {\em smoothed analysis}
with Gaussian and other kinds of perturbation models as a special case. In
fact, we can exactly characterize the smoothed complexity of binary optimization
problems in terms of their worst-case complexity: A binary optimization
problem has polynomial smoothed complexity if and only if it admits a
(possibly randomized) algorithm with pseudo-polynomial worst-case complexity.
Our analysis is centered around structural properties of binary optimization
problems, called {\em winner}, {\em loser}, and {\em feasibility gap}. We show
that if the coefficients of the objective function are stochastic, then the
gap between the best and second best solution is likely to be of order
$\Omega(1/n)$. Furthermore, we show that if the coefficients of the constraints
are stochastic, then the slack of the optimal solution with respect to this
constraint is typically of order $\Omega(1/n^2)$. We exploit these properties
in an adaptive rounding scheme that increases the accuracy of calculation
until the optimal solution is found. The strength of our techniques is
illustrated by applications to various \npc-hard optimization problems from
mathematical programming, network design, and scheduling for which we obtain
the first algorithms with polynomial smoothed/average-case complexity.},
}
@ARTICLE{Beier2006b,
AUTHOR = {Beier, Ren{\'e} and V{\"o}cking, Berthold},
JOURNAL = {Algorithmica},
TITLE = {An Experimental Study of Random Knapsack Problems},
ADDRESS = {New York, USA},
NUMBER = {1},
PUBLISHER = {Springer},
MONTH = {February},
VOLUME = {45},
ISBN = {0178-4617},
YEAR = {2006},
PAGES = {121--136},
ABSTRACT = {The size of the Pareto curve for the bicriteria version of the knapsack
problem is polynomial on average. This has been shown for various random input
distributions. We experimentally investigate the number of Pareto points for
knapsack instances over $n$ elements whose profits and weights are chosen at
random according to various classes of input distributions. The numbers
observed in our experiments are significantly smaller than the known upper
bounds. For example, the upper bound for so-called uniform instances is
$O(n^3)$. Based on our experiments, we conjecture that the number of Pareto
points for these instances is only $\Theta(n^2)$. We also study other
structural properties for random knapsack instances that have been used in
theoretical studies to bound the average-case complexity of the knapsack
problem.
Furthermore, we study advanced algorithmic techniques for the knapsack
problem. In particular, we review several ideas that originate from theory as
well as from practice. Most of the concepts that we use are simple and have
been known since at least 20 years, but apparently have not been used in this
combination. Surprisingly, the result of our study is a very competitive code
that outperforms the best previous implementation \emph{Combo} by orders of
magnitude for various classes of random instances, including harder random
knapsack instances in which profits and weights are chosen in a correlated
fashion.},
}
@ARTICLE{Beier2006c,
AUTHOR = {Beier, Ren{\'e} and Czumaj, Artur and Krysta, Piotr and V{\"o}cking, Berthold},
JOURNAL = {ACM Transactions on Algorithms},
TITLE = {Computing Equilibria for a Service Provider Game with (Im)perfect Information},
ADDRESS = {New York, USA},
NUMBER = {4},
PUBLISHER = {ACM},
MONTH = {October},
VOLUME = {2},
ISBN = {1549-6325},
YEAR = {2006},
PAGES = {679--706},
ABSTRACT = { We study fundamental algorithmic questions concerning the complexity of market
equilibria under perfect and imperfect information by means of a basic
microeconomic game. Suppose a provider offers a service to a set of potential
customers. Each customer has a particular demand of service and her behavior is
determined by a utility function that is nonincreasing in the sum of demands
that are served by the provider.
Classical game theory assumes complete information: the provider has full
knowledge of the behavior of all customers. We present a complete
characterization of the complexity of computing optimal pricing strategies and
of computing best/worst equilibria in this model. Basically, we show that most
of these problems are inapproximable in theworst case but admit an FPASin the
average case. Our average case analysis covers large classes of distributions
for customer utilities. We generalize our analysis to robust equilibria in
which players change their strategies only when this promises a significant
utility improvement.},
}
@INPROCEEDINGS{Beier2007,
AUTHOR = {Beier, Ren{\'e} and R{\"o}glin, Heiko and V{\"o}cking, Berthold},
EDITOR = {Fischettim, Matteo and Williamson, David P.},
TITLE = {The Smoothed Number of {Pareto} Optimal Solutions in Bicriteria Integer Optimization},
BOOKTITLE = {Integer Programming and Combinatorial Optimization : 12th International IPCO Conference},
PADDRESS = {Berlin, Germany},
ADDRESS = {Ithaca, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4513},
ISBN = {3-540-72791-0},
DOI = {10.1007/978-3-540-72792-7_5},
YEAR = {2007},
PAGES = {53--67},
NOTE = {To Appear},
}
@ARTICLE{Beier2011,
AUTHOR = {Beier, Rene and Funke, Stefan and Matijevic, Domagoj and Sanders, Peter},
JOURNAL = {Algorithmica},
TITLE = {Energy-Efficient Paths in Radio Networks},
ADDRESS = {Berlin},
NUMBER = {2},
PUBLISHER = {Springer},
VOLUME = {61},
ISBN = {0178-4617},
DOI = {10.1007/s00453-010-9414-0},
YEAR = {2011},
PAGES = {298--319},
}
@PHDTHESIS{BeierDiss04,
AUTHOR = {Beier, Rene},
TITLE = {Probabilistic Analysis of Discrete Optimization Problems},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
MONTH = {September},
YEAR = {2004},
}
@INPROCEEDINGS{BeierSibeyn00,
AUTHOR = {Beier, Rene and Sibeyn, Jop F.},
EDITOR = {Flammini, Michele and Nardelli, Enrico and Proietti, Guido and Spirakis, Paul},
TITLE = {A powerful heuristic for telephone gossiping},
BOOKTITLE = {Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00)},
PADDRESS = {Waterloo, Canada},
ADDRESS = {L'Aquila, Italy},
PUBLISHER = {Carleton Scientific},
MONTH = {August},
SERIES = {Proceedings in Informatics},
VOLUME = {7},
ISBN = {1-894145-06-2},
YEAR = {2000},
PAGES = {17--36},
}
@ARTICLE{BeinFleischerLarmore2000,
AUTHOR = {Bein, Wolfgang W. and Fleischer, Rudolf and Larmore, Lawrence L.},
JOURNAL = {Information Processing Letters},
TITLE = {Limited bookmark randomized online algorithms for the paging problem},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {4-6},
PUBLISHER = {Elsevier},
VOLUME = {76},
YEAR = {2000},
PAGES = {155--162},
}
@ARTICLE{BEKS:GEOTOP:2011,
AUTHOR = {Berberich, Eric and Emeliyanenko, Pavel and Kobel, Alexander and Sagraloff, Michael},
JOURNAL = {arXiv},
TITLE = {Exact Symbolic-Numeric Computation of Planar Algebraic Curves},
ADDRESS = {Ithaca, NY},
PUBLISHER = {Cornell University Library},
MONTH = {January},
VOLUME = {abs/1201.1548v1},
YEAR = {2012},
PAGES = {1--46},
NOTE = {Submitted to Theoretical Computer Science, corresponding conference versions
have been published in the proceedings of ALENEX 2011 and SNC 2011},
}
@INPROCEEDINGS{beks:snc:2011,
AUTHOR = {Berberich, Eric and Emeliyanenko, Pavel and Kobel, Alexander and Sagraloff, Michael},
EDITOR = {Moreno Maza, Marc},
TITLE = {Arrangement Computation for Planar Algebraic Curves},
BOOKTITLE = {Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation},
ORGANIZATION = {ACM},
PADDRESS = {New York, NY, USA},
ADDRESS = {San Jose, USA},
PUBLISHER = {ACM},
MONTH = {June},
ISBN = {978-1-4503-0515-0},
DOI = {10.1145/2331684.2331698},
YEAR = {2011},
PAGES = {88--98},
NOTE = {An extended version has been submitted to Theoretical Computer Science},
}
@ARTICLE{beks:snc:2011a,
AUTHOR = {Berberich, Eric and Emeliyanenko, Pavel and Kobel, Alexander and Sagraloff, Michael},
JOURNAL = {arXiv},
TITLE = {Arrangement Computation for Planar Algebraic Curves},
ADDRESS = {Ithaca, NY},
PUBLISHER = {Cornell University Library},
VOLUME = {abs/1103.4697},
YEAR = {2011},
}
@TECHREPORT{BeldiceanuKatrielThiel2004,
AUTHOR = {Beldiceanu, Nicolas and Katriel, Irit and Thiel, Sven},
TITLE = {Filtering algorithms for the {S}ame and {U}sed{B}y constraints},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
TYPE = {Research Report},
ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-2004-1-001},
PUBLISHER = {AG 1 - Mehlhorn},
MONTH = {February},
ISBN = {0946-011X},
YEAR = {2004},
PAGES = {36},
ABSTRACT = {We define the \Same\ and \UsedBy\ constraints. \UsedBy\ takes
two sets of variables $X$ and $Z$ such that $|X|\ge |Z|$ and
assigns values to them such that the multiset of values assigned
to the variables in $Z$ is contained in the multiset of values
assigned to the variables in $X$. \Same\ is the special case of
\UsedBy\ in which $|X|=|Z|$.
We show algorithms that achieve arc consistency and bound
consistency for these constraints.},
}
@ARTICLE{Ben-Asher-Schuster-Sibeyn95,
AUTHOR = {Ben-Asher, Y. and Schuster, Assaf and Sibeyn, Jop F.},
JOURNAL = {International Journal on High-Speed Computing},
TITLE = {Load balancing: A programmer's approach or the impact of task-length parameter on the load balancing performance of parallel programs},
NUMBER = {2},
VOLUME = {7},
YEAR = {1995},
PAGES = {303--326},
}
@ARTICLE{BenZwiHermelinLokshtanovNewman2011,
AUTHOR = {Ben-Zwi, Oren and Hermelin, Danny and Lokshtanov, Daniel and Newman, Ilan},
JOURNAL = {Discrete Optimization},
TITLE = {Treewidth governs the complexity of target set selection},
ADDRESS = {Amsterdam},
NUMBER = {1},
PUBLISHER = {Elsevier},
VOLUME = {8},
ISBN = {1572-5286},
DOI = {10.1016/j.disopt.2010.09.007},
YEAR = {2011},
PAGES = {87--96},
}
@INPROCEEDINGS{Berberich05,
AUTHOR = {Berberich, Eric and Eigenwillig, Arno and Hemmer, Michael and Hert, Susan and Kettner, Lutz and Mehlhorn, Kurt and Reichel, Joachim and Schmitt, Susanne and Sch{\"o}mer, Elmar and Wolpert, Nicola},
EDITOR = {Brodal, Gerth S. and Leonardi, Stefano},
TITLE = {EXACUS: Efficient and exact algorithms for curves and surfaces},
BOOKTITLE = {13th Annual European Symposium on Algorithms (ESA 2005)},
ORGANIZATION = {European Association for Theoretical Computer Science (EATCS)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Palma de Mallorca, Spain},
PUBLISHER = {Springer},
MONTH = {October},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3669},
ISBN = {3-540-29118-0},
DOI = {10.1007/11561071_16},
YEAR = {2005},
PAGES = {155--166},
ABSTRACT = {We present the first open-source release of the
C\texttt{++} libraries of the \textsc{Exacus} project
of the Max-Planck-Institut f{\"u}r Informatik. Our
software computes arrangements of curves and curve
segments, and boolean operations on polygons bounded
by curve segments. We pursued the goals efficiency,
correctness, and completeness for all input cases,
implying robustness. We present the structure of the
libraries and their generic design. With our work we
contribute one milestone on the way towards a
systematic support of non-linear geometry in software
libraries.},
}
@PHDTHESIS{Berberich2008,
AUTHOR = {Berberich, Eric},
TITLE = {Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
MONTH = {December},
YEAR = {2008},
}
@ARTICLE{Berberich20131,
AUTHOR = {Berberich, Eric and Emeliyanenko, Pavel and Kobel, Alexander and Sagraloff, Michael},
JOURNAL = {Theoretical Computer Science},
TITLE = {Exact symbolic–numeric computation of planar algebraic curves},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
MONTH = {June},
VOLUME = {491},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2013.04.014},
YEAR = {2013},
PAGES = {1--32},
ABSTRACT = {We present a certified and complete algorithm to compute arrangements of real
planar algebraic curves. It computes the decomposition of the plane induced by
a finite number of algebraic curves in terms of a cylindrical algebraic
decomposition. From a high-level perspective, the overall method splits into
two main subroutines, namely an algorithm denoted BiSolve to isolate the real
solutions of a zero-dimensional bivariate system, and an algorithm denoted
GeoTop to compute the topology of a single algebraic curve.
Compared to existing approaches based on elimination techniques, we
considerably improve the corresponding lifting steps in both subroutines. As a
result, generic position of the input system is never assumed, and thus our
algorithm never demands for any change of coordinates. In addition, we
significantly limit the types of symbolic operations involved, that is, we only
use resultant and gcd computations as purely symbolic operations. The latter
results are achieved by combining techniques from different fields such as
(modular) symbolic computation, numerical analysis and algebraic geometry.
We have implemented our algorithms as prototypical contributions to the
C++-project CGAL. We exploit graphics hardware to expedite the remaining
symbolic computations. We have also compared our implementation with the
current reference implementations, that is, LGP and Maple’s Isolate for
polynomial system solving, and CGAL’s bivariate algebraic kernel for analyses
and arrangement computations of algebraic curves. For various series of
challenging instances, our exhaustive experiments show that the new
implementations outperform the existing ones.},
}
@INPROCEEDINGS{Berenbrink2011,
AUTHOR = {Berenbrink, Petra and Hoefer, Martin and Sauerwald, Thomas},
EDITOR = {Randall, Dana},
TITLE = {Distributed Selfish Load Balancing on Networks},
BOOKTITLE = {22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11)},
PADDRESS = {Philadelphia, USA},
ADDRESS = {San Francisco, CA},
PUBLISHER = {SIAM},
YEAR = {2011},
PAGES = {1487--1497},
}
@INPROCEEDINGS{Berenbrink2011b,
AUTHOR = {Berenbrink, Petra and Cooper, Colin and Friedetzky, Tom and Friedrich, Tobias and Sauerwald, Thomas},
EDITOR = {Randall, Dana},
TITLE = {Randomized Diffusion for Indivisible Loads},
BOOKTITLE = {22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11)},
PADDRESS = {Philadelphia, USA},
ADDRESS = {San Francisco, CA},
PUBLISHER = {SIAM},
YEAR = {2011},
PAGES = {429--439},
}
@INPROCEEDINGS{BerenbrinkEFNS11,
AUTHOR = {Berenbrink, Petra and Friedetzky, Tom and Elsaesser, Robert and Nagel, Lars and Sauerwald, Thomas},
EDITOR = {Murlak, Filip and Sankowski, Piotr},
TITLE = {Faster Coupon Collecting via Replication with Applications in Gossiping},
BOOKTITLE = {36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Warsaw, Poland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6907},
YEAR = {2011},
PAGES = {72--83},
}
@INPROCEEDINGS{Berman2003+,
AUTHOR = {Berman, Piotr and Krysta, Piotr},
TITLE = {Optimizing Misdirection},
BOOKTITLE = {Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03)},
PADDRESS = {New York, USA},
ADDRESS = {Baltimore, USA},
PUBLISHER = {ACM},
YEAR = {2003},
PAGES = {192--201},
}
@ARTICLE{BernasconiPanagiotouSteger2009,
AUTHOR = {Panagiotou, Konstantinos},
JOURNAL = {Combinatorics, Probability and Computing},
TITLE = {The Degree Sequence of Random Graphs from Subcritical Classes},
NUMBER = {5},
VOLUME = {18},
YEAR = {2009},
PAGES = {647--681},
}
@INPROCEEDINGS{bes-bisolve-2011,
AUTHOR = {Berberich, Eric and Emeliyanenko, Pavel and Sagraloff, Michael},
EDITOR = {M{\"u}ller-Hannemann, Matthias and Werneck, Renato},
TITLE = {An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks},
BOOKTITLE = {2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX)},
ORGANIZATION = {Society for Industrial and Applied Mathematics (SIAM)},
TYPE = {Extended Abstract},
PADDRESS = {Philadelphia, PA},
ADDRESS = {San Francisco, CA},
PUBLISHER = {SIAM},
MONTH = {January},
YEAR = {2011},
PAGES = {35--47},
}
@ARTICLE{bes-bisolve-arxiv-2010,
AUTHOR = {Berberich, Eric and Emeliyanenko, Pavel and Sagraloff, Michael},
JOURNAL = {CoRR},
TITLE = {An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks},
ADDRESS = {Ithaca, NY},
PUBLISHER = {Cornell University Library},
MONTH = {October},
VOLUME = {abs/1010.1386},
DOI = {arXiv:1010.1386v1},
YEAR = {2010},
PAGES = {1--16},
}
@INPROCEEDINGS{BF08,
AUTHOR = {Bringmann, Karl and Friedrich, Tobias},
EDITOR = {Hong, Seok-Hee and Nagamochi, Hiroshi and Fukunaga, Takuro},
TITLE = {Approximating the volume of unions and intersections of high-dimensional geometric objects.},
BOOKTITLE = {Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008)},
PADDRESS = {New York, USA},
ADDRESS = {Gold Coast, Australia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5369},
ISBN = {978-3-540-92181-3},
YEAR = {2008},
PAGES = {436--447},
}
@INPROCEEDINGS{BF09a,
AUTHOR = {Bringmann, Karl and Friedrich, Tobias},
EDITOR = {Jansen, Thomas and Garibay, Ivan and Paul, Wiegand R. and Wu, Annie S.},
TITLE = {Don't be greedy when calculating hypervolume contributions},
BOOKTITLE = {FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms {X}},
PADDRESS = {New York, NY},
ADDRESS = {Orlando, USA},
PUBLISHER = {ACM},
ISBN = {978-1-60558-414-0},
DOI = {10.1145/1527125.1527139},
YEAR = {2009},
PAGES = {103--112},
}
@INPROCEEDINGS{BF09b,
AUTHOR = {Bringmann, Karl and Friedrich, Tobias},
EDITOR = {Ehrgott, Matthias and Fonseca, Carlos M. and Gandibleux, Xavier and Hao, Kin-Kao and Sevaux, Marc},
TITLE = {Approximating the least hypervolume contributor: {NP}-hard in general, but fast in practice},
BOOKTITLE = {Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009},
PADDRESS = {Berlin},
ADDRESS = {Nantes, France},
PUBLISHER = {Springer},
VOLUME = {5467},
ISBN = {978-3-642-01019-4},
DOI = {10.1007/978-3-642-01020-0_6},
YEAR = {2009},
PAGES = {6--20},
}
@INPROCEEDINGS{BF2010GECCO,
AUTHOR = {Bringmann, Karl and Friedrich, Tobias},
TITLE = {The Maximum Hypervolume Set Yields Near-optimal Approximation},
BOOKTITLE = {12th annual conference on Genetic and evolutionary computation (GECCO 2010)},
PADDRESS = {New York, USA},
ADDRESS = {Portland, USA},
PUBLISHER = {ACM},
DOI = {10.1145/1830483.1830576},
YEAR = {2010},
PAGES = {511--518},
}
@INPROCEEDINGS{BF2010PPSN,
AUTHOR = {Bringmann, Karl and Friedrich, Tobias},
EDITOR = {Schaefer, Robert and Cotta, Carlos and Kolodziej, Joanna and Rudolph, G{\"u}nter},
TITLE = {Tight Bounds for the Approximation Ratio of the Hypervolume Indicator},
BOOKTITLE = {Parallel Problem Solving from Nature - PPSN XI. - Pt. 1},
PADDRESS = {Berlin},
ADDRESS = {Krakow, Poland},
PUBLISHER = {Springer},
MONTH = {September},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6238},
ISBN = {978-3-642-15843-8},
DOI = {10.1007/978-3-642-15844-5_61},
YEAR = {2010},
PAGES = {607--616},
}
@TECHREPORT{BFFMSS04,
AUTHOR = {Funke, Stefan and Mehlhorn, Kurt and Schmitt, Susanne and Burnikel, Christoph and Fleischer, Rudolf and Schirra, Stefan},
TITLE = {The LEDA class real number -- extended version},
INSTITUTION = {Effective Computational Geometry for Curves and Surfaces},
TYPE = {Report},
ADDRESS = {Sophia Antipolis, FRANCE},
NUMBER = {ECG-TR-363110-01},
YEAR = {2004},
PAGES = {2},
}
@ARTICLE{bfhks-aos2-2010,
AUTHOR = {Berberich, Eric and Fogel, Efi and Halperin, Dan and Kerber, Michael and Setter, Ophir},
JOURNAL = {Mathematics in Computer Science},
TITLE = {Arrangements on Parametric Surfaces {II}: {Concretizations} and Applications},
ADDRESS = {Heidelberg, Germany},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {4},
ISBN = {1661-8270},
DOI = {10.1007/s11786-010-0043-4},
YEAR = {2010},
PAGES = {67--91},
}
@ARTICLE{bfhmw-aos1-2010,
AUTHOR = {Berberich, Eric and Fogel, Efi and Halperin, Dan and Mehlhorn, Kurt and Wein, Ron},
JOURNAL = {Mathematics in Computer Science},
TITLE = {Arrangements on Parametric Surfaces {I}: {General} Framework and Infrastructure},
ADDRESS = {Berlin},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {4},
ISBN = {1661-8270},
DOI = {10.1007/s11786-010-0042-5},
YEAR = {2010},
PAGES = {45--66},
}
@INPROCEEDINGS{bfhmw-samtdaosafs-07,
AUTHOR = {Berberich, Eric and Fogel, Efi and Halperin, Dan and Mehlhorn, Kurt and Wein, Ron},
EDITOR = {Arge, Lars and Hoffmann, Michael and Welzl, Emo},
TITLE = {Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step},
BOOKTITLE = {Algorithms - ESA 2007, 15th Annual European Symposium},
TYPE = {Extended Abstract},
PADDRESS = {Berlin / Heidelberg, Germany},
ADDRESS = {Eilat, Israel},
PUBLISHER = {Springer},
MONTH = {October},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4698},
ISBN = {978-3-540-75519-7},
DOI = {10.1007/978-3-540-75520-3_57},
YEAR = {2007},
PAGES = {645--656},
}
@INPROCEEDINGS{BFHW-SMTDAS2007,
AUTHOR = {Berberich, Eric and Fogel, Efi and Halperin, Dan and Wein, Ron},
TITLE = {Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces},
BOOKTITLE = {Proceedings of 23rd European Workshop on Computational Geometry},
PADDRESS = {Graz, Austria},
ADDRESS = {Graz, Austria},
PUBLISHER = {Technische Universitaet Graz},
MONTH = {March},
ISBN = {978-3-902465-62-7},
YEAR = {2007},
PAGES = {223--226},
ABSTRACT = {We introduce a general framework for processing a set of curves
defined on a continuous two-dimensional parametric surface, while
sweeping the parameter space. A major goal of our work is to
maximize code reuse in implementing algorithms that employ the
prevalent sweep-line paradigm, and consequently to minimize the
effort needed to extend the implementation of the paradigm to
various surfaces and families of curves embedded on them. We show
how the sweep-line paradigm is used to construct an arrangement of
curves embedded on an orientable parametric surface, and explain how
the arrangement package of {\sc cgal}, which previously handled only
arrangements of bounded planar curves, is extended to handle curves
embedded on a general surface. To the best of our knowledge, this
is the first software implementation of generic algorithms that can
handle arrangements on general parametric surfaces.},
}
@INPROCEEDINGS{BFMS1999,
AUTHOR = {Burnikel, Christoph and Fleischer, Rudolf and Mehlhorn, Kurt and Schirra, Stefan},
TITLE = {Efficient exact geometric computation made easy},
BOOKTITLE = {Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99)},
ORGANIZATION = {ACM},
PADDRESS = {New York, USA},
ADDRESS = {Miami Beach, USA},
PUBLISHER = {ACM},
MONTH = {June},
ISBN = {1581130686},
DOI = {http://doi.acm.org/10.1145/304893.304988},
YEAR = {1999},
PAGES = {341--350},
ABSTRACT = {We show that the combination of the CGAL framework
for geometric computation and the number type
leda-real yields easy-to-write, correct
and efficient geometric programs.},
}
@ARTICLE{BFMS2000,
AUTHOR = {Burnikel, Christoph and Fleischer, Rudolf and Mehlhorn, Kurt and Schirra, Stefan},
JOURNAL = {Algorithmica},
TITLE = {A strong and easily computable separation bound for arithmetic expressions involving radicals},
ADDRESS = {New York, USA},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {27},
ISBN = {0178-4617},
YEAR = {2000},
PAGES = {87--99},
ABSTRACT = {We consider arithmetic expressions over operators + , - , * , / , and
$\sqrt[k]$ , with integer operands. For an expression E having value $\xi$ , a
separation bound sep (E) is a positive real number with the property that
$\xi\neq$ 0 implies $|\xi | \geq$ sep (E) . We propose a new separation bound
that is easy to compute and stronger than previous bounds.},
}
@INPROCEEDINGS{BFMSS2001,
AUTHOR = {Burnikel, Christoph and Funke, Stefan and Mehlhorn, Kurt and Schirra, Stefan and Schmitt, Susanne},
EDITOR = {Meyer auf der Heide, Friedhelm},
TITLE = {A Separation Bound for Real Algebraic Expressions},
BOOKTITLE = {Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Aarhus, Denmark},
PUBLISHER = {Springer},
MONTH = {August},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2161},
ISBN = {3-540-42493-8},
YEAR = {2001},
PAGES = {254--265},
}
@INPROCEEDINGS{BFMZ04,
AUTHOR = {Brodal, Gerth St{\o}lting and Fagerberg, Rolf and Meyer, Ulrich and Zeh, Norbert},
EDITOR = {Hagerup, Torben and Katajainen, Jyrki},
TITLE = {Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths},
BOOKTITLE = {Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humleb{\ae}k, Denmark, July 8-10, 2004 ; proceedings},
PADDRESS = {Berlin, Germany},
ADDRESS = {Humlebaek, Denmark},
PUBLISHER = {Springer},
MONTH = {July},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3111},
ISBN = {3-540-22339-8},
YEAR = {2004},
PAGES = {480--492},
}
@INPROCEEDINGS{BFN2010,
AUTHOR = {Berghammer, Rudolf and Friedrich, Tobias and Neumann, Frank},
EDITOR = {Pelikan, Martin and Branke, J{\"u}rgen},
TITLE = {Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles},
BOOKTITLE = {Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010)},
PADDRESS = {New York, NY},
ADDRESS = {Portland, USA},
PUBLISHER = {ACM},
ISBN = {978-1-4503-0072-5},
DOI = {10.1145/1830483.1830574},
YEAR = {2010},
PAGES = {495--502},
}
@ARTICLE{BFSS07,
AUTHOR = {Bast, Holger and Funke, Stefan and Sanders, Peter and Schultes, Dominik},
JOURNAL = {Science},
TITLE = {Fast Routing in Road Networks using Transit Nodes},
ADDRESS = {Washington, USA},
NUMBER = {5824},
PUBLISHER = {Science/AAAS},
MONTH = {April},
VOLUME = {316},
ISBN = {0036-8075},
DOI = {10.1126/science.1137521},
YEAR = {2007},
PAGES = {566},
}
@INPROCEEDINGS{BGS2005,
AUTHOR = {Baswana, Surender and Goyal, Vishrut and Sen, Sandeep},
EDITOR = {Diekert, Volker and Durand, Bruno},
TITLE = {All-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm{ polylog } n)$ time},
BOOKTITLE = {STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science},
PADDRESS = {Berlin, Germany},
ADDRESS = {Stuttgart, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3404},
ISBN = {3-540-24998-2},
YEAR = {2005},
PAGES = {666--679},
ABSTRACT = {Let $G=(V,E)$ be an unweighted undirected graph on $n$ vertices.
Let $\delta(u,v)$ denote the distance between vertices $u,v\inV$.
An algorithm is said to compute all-pairs $t$-approximate shortest
-paths/distances, for some $t\ge 1$, if for each pair of vertices
$u,v\in V$, the path/distance reported by the algorithm is not longer/greater
than $t\delta(u,v)$.\\
This paper presents two randomized algorithms for computing all-pairs nearly
2-approximate shortest distances.
The first algorithm takes expected $O(m^{2/3}n\log n + n^2)$ time, and for any
$u,v\in V$ reports distance no greater than $2\delta(u,v)+1$.
Our second algorithm requires expected $O(n^2\log^{3/2} n)$
time, and for any $u,v\in V$, reports distance bounded by $2\delta(u,v) + 3$.\\
This paper also presents the first expected $O(n^2)$ time algorithm to compute
all-pairs 3-approximate distances. },
}
@INPROCEEDINGS{BGT01:non-overlap,
AUTHOR = {Beldiceanu, Nicolas and Guo, Qi and Thiel, Sven},
EDITOR = {Walsh, Toby},
TITLE = {Non-overlapping Constraints between Convex Polytopes},
BOOKTITLE = {Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Paphos, Cyprus},
PUBLISHER = {Springer},
MONTH = {November},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2239},
ISBN = {3-540-42863-1},
YEAR = {2001},
PAGES = {392--407},
}
@INPROCEEDINGS{bh-app-00,
AUTHOR = {Bast, Hannah and Hert, Susan},
EDITOR = {Bremner, David},
TITLE = {The Area Partitioning Problem},
BOOKTITLE = {Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00)},
PADDRESS = {Fredericton, Canada},
ADDRESS = {Fredericton, New Brunswick, Canada},
PUBLISHER = {University of New Brunswick},
MONTH = {August},
YEAR = {2000},
PAGES = {163--171},
ABSTRACT = {Given an arbitrary polygon with $n$ vertices, we wish to partition it
into $p$ connected pieces of given areas. The problem is motivated by a
robotics application in which the polygon is a workspace that is to be
divided among $p$ robots performing a terrain-covering task. We show that
finding an area partitioning with minimal cut length is NP-hard in the number
of pieces and that it is even hard to approximate to within any factor that
is independent of the shape of the polygon.
We then present a simple $O(pn)$-time algorithm that produces
non-optimal, but often quite reasonable, area partitionings for arbitrary
polygons.},
}
@INCOLLECTION{bhhm-giae-exp-2010,
AUTHOR = {Berberich, Eric and Hagen, Matthias and Hiller, Benjamin and Moser, Hannes},
EDITOR = {M{\"u}ller-Hannemann, Matthias and Schirra, Stefan},
TITLE = {Experiments},
BOOKTITLE = {Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice},
CHAPTER = {8},
ADDRESS = {Berlin},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5971},
ISBN = {978-3-642-14865-1},
DOI = {10.1007/978-3-642-14866-8_8},
YEAR = {2010},
PAGES = {325--388},
}
@INPROCEEDINGS{bhk-ak2-2011,
AUTHOR = {Berberich, Eric and Hemmer, Michael and Kerber, Michael},
EDITOR = {Hurtado, Ferran and van Krefeld, Marc},
TITLE = {A Generic Algebraic Kernel for Non-linear Geometric Applications},
BOOKTITLE = {Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11)},
PADDRESS = {New York, NY},
ADDRESS = {Paris, France},
PUBLISHER = {ACM},
MONTH = {June},
ISBN = {978-1-4503-0682-9},
DOI = {10.1145/1998196.1998224},
YEAR = {2011},
PAGES = {179--186},
}
@TECHREPORT{bhk-ak2-inria-2010,
AUTHOR = {Berberich, Eric and Hemmer, Michael and Kerber, Michael},
TITLE = {A Generic Algebraic Kernel for Non-linear Geometric Applications},
INSTITUTION = {INRIA},
TYPE = {Rapport de recherche},
ADDRESS = {Sophia Antipolis, France},
NUMBER = {7274},
MONTH = {May},
YEAR = {2010},
PAGES = {20},
}
@ARTICLE{bhkp-deconstruct-journal-2012,
AUTHOR = {Berberich, Eric and Halperin, Dan and Kerber, Michael and Pogalnikova, Roza},
JOURNAL = {Discrete \& Computational Geometry},
TITLE = {Deconstructing Approximate Offsets},
ADDRESS = {New York, NY},
NUMBER = {4},
PUBLISHER = {Springer},
MONTH = {December},
VOLUME = {48},
ISBN = {0179-5376},
DOI = {10.1007/s00454-012-9441-5},
YEAR = {2012},
PAGES = {964--989},
}
@INPROCEEDINGS{bhkp-minkowksideconstruction-2011,
AUTHOR = {Berberich, Eric and Halperin, Dan and Kerber, Michael and Pogalnikova, Roza},
EDITOR = {Hurtado, Ferran and van Krefeld, Marc},
TITLE = {Deconstructing Approximate Offsets},
BOOKTITLE = {Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11)},
PADDRESS = {New York, NY},
ADDRESS = {Paris, France},
PUBLISHER = {ACM},
MONTH = {June},
ISBN = {978-1-4503-0682-9},
DOI = {10.1145/1998196.1998225},
YEAR = {2011},
PAGES = {187--196},
}
@ARTICLE{bhkp-minkowksideconstructiondcg-2011a,
AUTHOR = {Berberich, Eric and Halperin, Dan and Kerber, Michael and Pogalnikova, Roza},
JOURNAL = {arXiv},
TITLE = {Deconstructing Approximate Offsets},
ADDRESS = {Ithaca, NY},
PUBLISHER = {Cornell University Library},
MONTH = {September},
VOLUME = {abs/1109.2158},
YEAR = {2011},
}
@INPROCEEDINGS{bhkp-reconstruction-eurocg-2010,
AUTHOR = {Berberich, Eric and Halperin, Dan and Kerber, Michael and Pogalnikova, Roza},
EDITOR = {Vahrenhold, Jan},
TITLE = {Polygonal Reconstruction from Approximate Offsets},
BOOKTITLE = {26th European Workshop on Computational Geometry : Workshop Proceedings},
PADDRESS = {Dortmund},
ADDRESS = {Dortmund, Germany},
PUBLISHER = {TU Dortmund},
MONTH = {March},
YEAR = {2010},
PAGES = {65--68},
}
@INPROCEEDINGS{bhksw-eceicpmqic-05,
AUTHOR = {Berberich, Eric and Hemmer, Michael and Kettner, Lutz and Sch{\"o}mer, Elmar and Wolpert, Nicola},
EDITOR = {Mitchell, Joe and Rote, G{\"u}nter and Kettner, Lutz},
TITLE = {An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves},
BOOKTITLE = {21st Annual Symposium on Computational Geometry (SCG'05)},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Pisa, Italy},
PUBLISHER = {ACM},
MONTH = {June},
ISBN = {1-58113-991-8},
YEAR = {2005},
PAGES = {99--106},
ABSTRACT = {We present the first exact, complete and
efficient implementation that computes for a given
set $P=\{p_1,\dots,p_n\}$ of quadric surfaces the
planar map induced by all intersection curves
$p_1\cap p_i$, $2\leq i\leq n$, running on the
surface of $p_1$. The vertices in this graph are the
singular and $x$-extreme points of the curves as well
as all intersection points of pairs of curves. Two
vertices are connected by an edge if the underlying
points are connected by a branch of one of the curves.
Our work is based on and extends ideas developed
in~[20] and~[9].
Our implementation is {\em complete} in the sense
that it can handle all kind of inputs including all
degenerate ones where intersection curves have
singularities or pairs of curves intersect with
high multiplicity. It is {\em exact} in that it
always computes the mathematical correct result.
It is {\em efficient} measured in running times.},
}
@INPROCEEDINGS{BHTWahlstroem2009,
AUTHOR = {B{\"o}cker, Sebastian and H{\"u}ffner, Falk and Truss, Anke and Wahlstr{\"o}m, Magnus},
EDITOR = {Chen, Jianer and Fomin, Fedor V.},
TITLE = {A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams},
BOOKTITLE = {Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009},
PADDRESS = {Berlin},
ADDRESS = {Copenhagen, Denmark},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5917},
ISBN = {978-3-642-11268-3},
DOI = {10.1007/978-3-642-11269-0_3},
YEAR = {2009},
PAGES = {38--49},
}
@INPROCEEDINGS{BiedlKaufmannMutzel1998,
AUTHOR = {Biedl, Therese and Kaufmann, Michael and Mutzel, Petra},
EDITOR = {Hromkovic, J. and Sykora, O.},
TITLE = {Drawing Planar Partitions II: HH-Drawings},
BOOKTITLE = {Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Smolenice},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1517},
YEAR = {1998},
PAGES = {124--136},
}
@INCOLLECTION{BILLING97,
AUTHOR = {Lenhof, Hans-Peter},
EDITOR = {Plesser, Theo and Wittenberg, Peter},
TITLE = {Parallel Protein Puzzle: A New Suite of Protein Docking Tools},
BOOKTITLE = {Forschung und wissenschaftliches Rechnen: Beitr{\"a}ge zum Heinz-Billing-Preis 1996},
INSTITUTION = {Gesellschaft f{\"u}r wissenschaftliche Datenverarbeitung mbH G{\"o}ttingen},
TYPE = {GWDG-Bericht},
ADDRESS = {G{\"o}ttingen, Germany},
NUMBER = {44},
PUBLISHER = {Gesellschaft f{\"u}r wissenschaftliche Datenverarbeitung mbH},
ISBN = {0176-2516},
YEAR = {1997},
PAGES = {31--48},
}
@MASTERSTHESIS{Birk97,
AUTHOR = {Birk, R{\"u}diger},
TITLE = {{L{\"o}sung von Varianten des Post-Office-Problems mit Hilfe von Skip List Range Trees}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1997},
}
@ARTICLE{BJM97,
AUTHOR = {Brandenburg, Franz J. and J{\"u}nger, Michael and Mutzel, Petra},
JOURNAL = {Informatik Spektrum},
TITLE = {{Algorithmen zum automatischen Zeichnen von Graphen}},
NUMBER = {4},
VOLUME = {20},
YEAR = {1997},
PAGES = {199--207},
NOTE = {Short version in: Jarke, M., Pasedach, K. und Pohl, K. (eds.), Informatik '97,
27. Jahrestagung der Gesellschaft f{\"u}r Informatik, Aachen, Informatik aktuell,
Springer-Verlag, 1997, 58-67},
}
@INPROCEEDINGS{bk-aosogo-08,
AUTHOR = {Berberich, Eric and Kerber, Michael},
EDITOR = {Petitjean, Sylvain},
TITLE = {Arrangements on Surfaces of Genus One: Tori and Dupin Cyclides},
BOOKTITLE = {24th European Workshop on Computational Geometry - Collection of Abstracts},
PADDRESS = {No publisher},
ADDRESS = {Nancy, France},
MONTH = {March},
ISBN = {2-905267-57-7},
YEAR = {2008},
PAGES = {209--212},
NOTE = {An extended version of this article has appeared under the name
"Exact Arrangements on Tori and Dupin Cyclides" in the Proceedings of the 2008
ACM Symposium on Solid and Physical Modeling, pp 59-66},
ABSTRACT = {An algorithm is presented to compute the exact arrangement induced by
arbitrary algebraic surfaces on a parametrized ring Dupin cyclide,
including the special case of the torus.
The intersection of an algebraic surface of degree $n$ with a reference
cyclide is represented as a real algebraic curve of bi-degree $(2n,2n)$
in the cyclide's two-dimensional parameter space.
We use Eigenwillig and Kerber~\cite{ek-exact} to compute a planar arrangement
of such curves
and extend their approach to obtain more asymptotic information about curves
approaching the boundary of the cyclide's parameter space.
With that, we can base our implementation on a general software
framework by Berberich~et.~al.~\cite{bfhmw-samtdaosafs-07} to construct
the arrangement on the cyclide. Our contribution provides the demanded
techniques to model the special topology of the reference surface of genus one.
Our experiments show no combinatorial overhead of the framework,
i.e., the overall performance is strongly coupled to the efficiency of the
implementation for arrangements of algebraic plane curves.},
}
@INPROCEEDINGS{bk-eatdc-08,
AUTHOR = {Berberich, Eric and Kerber, Michael},
EDITOR = {Haines, Eric and McGuire, Morgan},
TITLE = {Exact Arrangements on Tori and Dupin Cyclides},
BOOKTITLE = {Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Stony Brook, USA},
PUBLISHER = {ACM},
MONTH = {June},
ISBN = {978-1-60558-106-4},
DOI = {10.1145/1364901.1364912},
YEAR = {2008},
PAGES = {59--66},
ABSTRACT = {An algorithm and implementation is presented to compute the exact arrangement
induced by arbitrary algebraic surfaces on a parametrized ring Dupin cyclide.
The family of Dupin cyclides contains as a special case the torus.
The intersection of an algebraic surface of degree $n$ with a reference
cyclide is represented as a real algebraic curve of bi-degree $(2n,2n)$
in the two-dimensional parameter space of the cyclide.
We use Eigenwillig and Kerber:
``Exact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves'',
SODA~2008, to compute a planar arrangement of such curves
and extend their approach to obtain more asymptotic information about curves
approaching the boundary of the cyclide's parameter space.
With that, we can base our implementation on the general software framework
by Berberich~et.~al.: ``Sweeping and Maintaining Two-Dimensional
Arrangements on Surfaces: A First Step'', ESA~2007.
Our contribution provides the demanded techniques to model the special
geometry of surfaces intersecting a cyclide
and the special topology of the reference surface of genus one.
The contained implementation is complete and does not assume generic position.
Our experiments show that the combinatorial overhead of the framework
does not harm the efficiency of the method. Our experiments show that the
overall performance is strongly coupled to the efficiency of the
implementation for arrangements of algebraic plane curves.},
}
@TECHREPORT{bk-reorder-07,
AUTHOR = {Berberich, Eric and Kettner, Lutz},
TITLE = {Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
TYPE = {Research Report},
ADDRESS = {Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-2007-1-001},
MONTH = {July},
ISBN = {0946-011X},
YEAR = {2007},
PAGES = {20},
}
@ARTICLE{bks-cgta-2009,
AUTHOR = {Berberich, Eric and Kerber, Michael and Sagraloff, Michael},
JOURNAL = {Computational Geometry: Theory and Applications (CGTA)},
TITLE = {An efficient algorithm for the stratification and triangulation of an algebraic surface},
ADDRESS = {Amsterdam, Netherlands},
NUMBER = {3},
PUBLISHER = {Elsevier},
MONTH = {April},
VOLUME = {43},
ISBN = {0925-7721},
DOI = {10.1016/j.comgeo.2009.01.009},
YEAR = {2010},
PAGES = {257--278},
ABSTRACT = {We present a method to compute the exact topology of a real algebraic surface
$S$, implicitly given by a polynomial $f\in\mathbb{Q}[x,y,z]$ of arbitrary
total degree~$N$.
Additionally, our analysis provides geometric information as it
supports the computation of arbitrary precise samples of $S$
including critical points.
We compute a stratification $\Omega_S$ of $S$ into $O(N^5)$ nonsingular cells,
including the complete adjacency information between these cells.
This is done by a projection approach.
We construct a special planar arrangement $\mathcal{A}_S$
with fewer cells than a cad in the projection plane.
Furthermore, our approach applies numerical and combinatorial methods to
minimize costly symbolic computations. The algorithm handles all sorts of
degeneracies without transforming the surface into a generic position.
Based on $\Omega_S$ we also compute a simplicial complex
which is isotopic to~$S$.
A complete C++-implementation of the stratification algorithm is presented.
It shows good performance for many well-known examples from algebraic geometry.},
}
@INPROCEEDINGS{bks-egtaas-08,
AUTHOR = {Berberich, Eric and Kerber, Michael and Sagraloff, Michael},
EDITOR = {Teillaud, Monique and Welzl, Emo},
TITLE = {Exact Geometric-Topological Analysis of Algebraic Surfaces},
BOOKTITLE = {Proceedings of the 24th ACM Symposium on Computational Geometry},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {College Park Maryland, USA},
PUBLISHER = {ACM},
MONTH = {June},
ISBN = {978-1-60558-071-5},
DOI = {10.1145/1377676.1377703},
YEAR = {2008},
PAGES = {164--173},
ABSTRACT = {We present a method to compute the exact topology of a real algebraic surface
$S$, implicitly given by a polynomial $f \in \mathbb{Q}[x,y,z]$ of arbitrary
degree $N$.
Additionally, our analysis provides geometric information as it
supports the computation of arbitrary precise samples of $S$
including critical points.
We use a projection approach,
similar to Collins' cylindrical algebraic decomposition (cad).
In comparison we reduce the number of output cells to $O(N^5)$ by constructing
a special planar arrangement instead of a full cad in the projection plane.
Furthermore, our approach applies numerical and combinatorial methods to
minimize costly symbolic computations. The algorithm handles all sorts of
degeneracies without transforming the surface into a generic position.
We provide a complete implementation of the algorithm, written in C++. It shows
good performance for many well known examples from algebraic geometry.},
}
@INPROCEEDINGS{bks-gaoasbopa-08,
AUTHOR = {Berberich, Eric and Kerber, Michael and Sagraloff, Michael},
EDITOR = {Petitjean, Sylvain},
TITLE = {Geometric Analysis of Algebraic Surfaces Based on Planar Arrangements},
BOOKTITLE = {24th European Workshop on Computational Geometry - Collection of Abstracts},
PADDRESS = {No publisher},
ADDRESS = {Nancy, France},
MONTH = {March},
ISBN = {2-905267-57-7},
YEAR = {2008},
PAGES = {29--32},
NOTE = {An extended version of this article has appeared under the name
"Exact Geometric-Topological Analysis of Algebraic Surfaces" in the Proceedings
of the 24th ACM Symposium on Computational Geometry, 2008, pp 164-173},
ABSTRACT = {We present a method to compute the exact topology of a real algebraic surface
$S$, implicitly given by a polynomial $f \in \mathbb{Q}[x,y,z]$ of arbitrary
degree $N$.
Additionally, our analysis provides geometric information as it
supports the computation of arbitrary precise samples of $S$
including critical points.
We use a projection approach,
similar to Collins' cylindrical algebraic decomposition (cad).
In comparison we reduce the number of output cells to $O(N^5)$ by constructing
a special planar arrangement instead of a full cad in the projection plane.
Furthermore, our approach applies numerical and combinatorial methods to
minimize costly symbolic computations. The algorithm handles all sorts of
degeneracies without transforming the surface into a generic position.
We provide a complete \Cpp-implementation of the algorithm that shows
good performance for many well-known examples from algebraic geometry.},
}
@INPROCEEDINGS{bks07,
AUTHOR = {Doerr, Benjamin and Klein, Christian and Storch, Tobias},
TITLE = {Faster Evolutionary Algorithms by Superior Graph Representation},
BOOKTITLE = {First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007)},
PADDRESS = {Washington, D.C.},
ADDRESS = {Honolulu, USA},
PUBLISHER = {IEEE},
ISBN = {1-424-40698-6},
DOI = {10.1109/FOCI.2007.372176},
YEAR = {2007},
PAGES = {245--250},
ABSTRACT = {We present a new representation for individuals in problems that have cyclic
permutations as solutions.
To demonstrate its usefulness, we analyze a simple randomized local search and
a (1+1) evolutionary algorithm for the Eulerian cycle problem utilizing this
representation.
Both have an expected run-time of $\Theta(m^2 \log(m))$, where $m$ denotes the
number of edges of the input graph.
This clearly beats previous solutions, which all have an expected optimization
time of $\Theta(m^3)$ or worse (PPSN~'06, CEC~'04).
We are optimistic that our representation also allows superior solutions for
other cyclic permutation problems.
For NP-complete ones like the TSP, however, other means than theoretical
run-time analyses are necessary.},
}
@MASTERSTHESIS{Blanchebarbe96,
AUTHOR = {Blanchebarbe, Markus},
TITLE = {{Untersuchung zur Implementierung eines parallelen Algorithmus mit guter asymptotischer Laufzeit auf einem Rechner mit verteiltem Speicher und Message-Passing}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1996},
}
@INPROCEEDINGS{BM-CEQ2007,
AUTHOR = {Berberich, Eric and Meyerovitch, Michal},
TITLE = {Computing Envelopes of Quadrics},
BOOKTITLE = {Proceedings of 23rd European Workshop on Computational Geometry},
PADDRESS = {Graz, Austria},
ADDRESS = {Graz, Austria},
PUBLISHER = {Technische Universitaet Graz},
MONTH = {March},
ISBN = {978-3-902465-62-7},
YEAR = {2007},
PAGES = {235--238},
ABSTRACT = {We present the computation of envelopes of a set of quadratic
surfaces defined in ${\rm I\!\hspace{-0.025em} R}^3$. Our solution is based on
the new
{\sc Cgal} {\tt Envelope\_3} package that provides a generic and
robust implementation of a divide-and-conquer algorithm. This work
concentrates on the theory of algebraic and combinatorial tasks
that occur for quadratic surfaces and their implementation. The
implementation is exact and efficient.},
}
@ARTICLE{BMST03,
AUTHOR = {Bast, Holger and Mehlhorn, Kurt and Sch{\"a}fer, Guido and Tamaki, Hisao},
JOURNAL = {Algorithmica},
TITLE = {A Heuristic for {Dijkstra's} Algorithm With Many Targets and its Use in Weighted Matching Algorithms},
ADDRESS = {Berlin, Germany},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {36},
DOI = {10.1007/s00453-002-1008-z},
YEAR = {2003},
PAGES = {75--88},
ABSTRACT = {We consider the single-source many-targets shortest-path (SSMTSP) problem in
directed graphs with non-negative
edge weights. A source node $s$ and a target set $T$ is specified and the goal
is to compute a shortest path from $s$ to a node in $T$.
Our interest in the shortest path problem with many targets stems from its use
in weighted bipartite matching algorithms. A weighted bipartite matching in a
graph with $n$ nodes on each side reduces to $n$ SSMTSP problems, where the
number
of targets varies between $n$ and $1$.
The SSMTSP problem can be solved by Dijkstra's algorithm. We describe a
heuristic
that leads to a significant improvement in running time for the weighted
matching
problem; in our experiments a speed-up by up to a factor of 12 was achieved.
We also present a partial analysis that gives some theoretical support for our
experimental findings. },
}
@ARTICLE{BMST05,
AUTHOR = {Bast, Holger and Mehlhorn, Kurt and Sch{\"a}fer, Guido and Tamaki, Hisao},
JOURNAL = {Theory of Computing Systems},
TITLE = {Matching Algorithms are Fast in Sparse Random Graphs},
ADDRESS = {New York, USA},
NUMBER = {1},
PUBLISHER = {Springer},
MONTH = {February},
VOLUME = {39},
ISBN = {1432-4350},
DOI = {10.1007/s00224-005-1254-y},
YEAR = {2006},
PAGES = {3--14},
ABSTRACT = {We present an improved average case analysis of the maximum cardinality
matching problem. We show that in a bipartite or general random graph on $n$
vertices, with high probability every non-maximum matching has an augmenting
path of length $O(\log n)$. This implies that augmenting path algorithms like
the Hopcroft--Karp algorithm for bipartite graphs and the Micali--Vazirani
algorithm for general graphs, which have a worst case running time of
$O(m\sqrt{n})$, run in time $O(m \log n)$ with high probability, where $m$ is
the number of edges in the graph. Motwani proved these results for random
graphs when the average degree is at least $\ln (n)$ [\emph{Average Case
Analysis of Algorithms for Matchings and Related Problems}, Journal of the ACM,
\textbf{41}(6), 1994]. Our results hold, if only the average degree is a large
enough constant. At the same time we simplify the analysis of Motwani.},
}
@ARTICLE{BodirskyGroeplJohannsenKang2007a,
AUTHOR = {Bodirsky, Manuel and Gr{\"o}pl, Clemens and Johannsen, Daniel and Kang, Mihyun},
JOURNAL = {S{\'e}minaire Lotharingien de Combinatoire},
TITLE = {A Direct Decomposition of 3-connected Planar Graphs},
VOLUME = {B54Ak},
YEAR = {2007},
PAGES = {15},
ABSTRACT = {We present a decomposition strategy for c-nets, i.\,e., rooted 3-connected
planar maps. The decomposition yields an algebraic equation for the number of
c-nets with a given number of vertices and a given size of the outer face. The
decomposition also leads to a deterministic and polynomial time algorithm to
sample c-nets \emph{uniformly at random}. Using rejection sampling, we can also
sample isomorphism types of convex polyhedra, i.e., 3-connected planar graphs,
uniformly at random.},
}
@ARTICLE{BodirskyKutz2007,
AUTHOR = {Bodirsky, Manuel and Kutz, Martin},
JOURNAL = {Artificial Intelligence},
TITLE = {Determining the consistency of partial tree descriptions},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {2/3},
PUBLISHER = {Elsevier},
MONTH = {February},
VOLUME = {171},
ISBN = {0004-3702},
DOI = {10.1016/j.artint.2006.12.004},
YEAR = {2007},
PAGES = {185--196},
ABSTRACT = {We present an efficient algorithm that decides the consistency of partial
descriptions of ordered trees. The constraint language of these descriptions
was introduced by Cornell in computational linguistics; the constraints specify
for pairs of nodes sets of admissible relative positions in an ordered tree.
Cornell asked for an algorithm to find a tree structure satisfying these
constraints. This computational problem generalizes the common-supertree
problem studied in phylogenetic analysis, and also generalizes the network
consistency problem of the so-called left-linear point algebra. We present the
first polynomial time algorithm for Cornell's problem, which runs in time O(mn)
, where m is the number of constraints and n the number of variables in the
constraint. },
}
@INPROCEEDINGS{Bodlaender-Hagerup95,
AUTHOR = {Bodlaender, Hans L. and Hagerup, Torben},
EDITOR = {F{\"u}l{\"o}p, Zolt{\'a}n and Gecseg, Ferenc},
TITLE = {Parallel Algorithms with Optimal Speedup for Bounded Treewidth},
BOOKTITLE = {Automata, Languages, and Programming: 22nd International Colloquium (ICALP95)},
PADDRESS = {Berlin},
ADDRESS = {Szeged, Hungary},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {944},
YEAR = {1995},
PAGES = {268--279},
}
@ARTICLE{BodlaenderDeogunJansenKloksKratschMuellerTuza98,
AUTHOR = {Bodlaender, Hans L. and Deogun, Jitender S. and Jansen, Klaus and Kloks, Ton and Kratsch, Dieter and M{\"u}ller, Haiko and Tuza, Zsolt},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {Ranking of Graphs},
NUMBER = {1},
MONTH = {February},
VOLUME = {11},
YEAR = {1998},
PAGES = {168--181},
}
@ARTICLE{BodlaenderHagerup98,
AUTHOR = {Bodlaender, Hans L. and Hagerup, Torben},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Parallel Algorithms with Optimal Speedup for Bounded Treewidth},
NUMBER = {6},
VOLUME = {27},
ISBN = {0097-5397},
YEAR = {1998},
PAGES = {1725--1746},
}
@INPROCEEDINGS{BogdanSSS2012,
AUTHOR = {Bogdan, Paul and Sauerwald, Thomas and Stauffer, Alexandre and Sun, He},
EDITOR = {Sanjeev Khanna},
TITLE = {Balls into Bins via Local Search},
BOOKTITLE = {24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13)},
PADDRESS = {Philadelphia, PA},
ADDRESS = {New Orleans, USA},
PUBLISHER = {SIAM},
MONTH = {July},
YEAR = {2013},
PAGES = {16--34},
}
@INPROCEEDINGS{BoghossianKohlbacherLenhof1999,
AUTHOR = {Boghossian, Nicolas Pascal and Kohlbacher, Oliver and Lenhof, Hans-Peter},
EDITOR = {Vitter, Jeffrey S. and Zaroliagis, Christos D.},
TITLE = {BALL: Biochemical Algorithms Library},
BOOKTITLE = {Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99},
PADDRESS = {Berlin},
ADDRESS = {London, UK},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1668},
YEAR = {1999},
PAGES = {330--344},
ABSTRACT = {In the next century, virtual laboratories will play a key role in
biotechnology. Computer experiments will not only replace
time-consuming and expensive real-world experiments, but they will also
provide insights that cannot be obtained using ``wet'' experiments.
The field that deals with the modeling of atoms, molecules, and their
reactions is called Molecular Modeling. The advent of
Life Sciences gave rise to numerous new developments in this
area. However, the implementation of new simulation tools is extremely
time-consuming. This is mainly due to the large amount of
supporting code (e.g. for data import/export, visualization, and so on)
that is required in addition to the code necessary to implement the new idea.
The
only way to reduce the development time is to reuse reliable code,
preferably using object-oriented approaches. We have designed and
implemented BALL, the first object-oriented application framework for rapid
prototyping in Molecular Modeling. By the use
of the composite design pattern and polymorphism we were able to model
the multitude of complex biochemical concepts in a well-structured and
comprehensible class hierarchy, the BALL kernel classes. The
isomorphism between the biochemical structures and the kernel classes
leads to an intuitive interface. Since BALL was designed for rapid software
prototyping, ease of use and flexibility were our principal design
goals. Besides the kernel classes, BALL provides fundamental
components for import/export of data in various file formats,
Molecular Mechanics simulations, three-dimensional visualization, and
more complex ones like a numerical solver for the Poisson-Boltzmann
equation. The usefulness of BALL was shown by the
implementation of an algorithm that checks proteins for
similarity. Instead of the five months that an earlier implementation
took, we were able to implement it within a day using BALL. },
}
@ARTICLE{Bonifaci2011:b,
AUTHOR = {Bonifaci, Vincenzo and Marchetti-Spaccamela, Alberto},
JOURNAL = {Algorithmica},
TITLE = {Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems},
ADDRESS = {New York, NY},
NUMBER = {4},
PUBLISHER = {Springer},
VOLUME = {63},
ISBN = {0178-4617},
DOI = {10.1007/s00453-011-9505-6},
YEAR = {2012},
PAGES = {763--780},
ABSTRACT = {We give the first algorithm for testing the feasibility of a system of sporadic
real-time tasks on a set of identical processors, solving an open problem in
the area of multiprocessor real-time scheduling (Baruah and Pruhs in Journal of
Scheduling 13(6):577–582, 2009). We also investigate the related notion of
schedulability and a notion that we call online feasibility. Finally, we show
that discrete-time schedules are as powerful as continuous-time schedules,
which answers another open question in the above mentioned survey. },
}
@INPROCEEDINGS{Bonifaci2012a,
AUTHOR = {Bonifaci, Vincenzo and Mehlhorn, Kurt and Varma, Girish},
EDITOR = {Ravani, Yuval},
TITLE = {Physarum Can Compute Shortest Paths},
BOOKTITLE = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12)},
ORGANIZATION = {Society for Industrial and Applied Mathematics (SIAM)},
PADDRESS = {Philadelphia, PA},
ADDRESS = {Kyoto, Japan},
PUBLISHER = {SIAM},
ISBN = {978-1-611972-11-5},
YEAR = {2012},
PAGES = {233--240},
ABSTRACT = {Physarum Polycephalum is a slime mold that is apparently able to solve shortest
path problems.
A mathematical model has been proposed by biologists to describe the feedback
mechanism used by the slime mold to adapt its tubular channels while foraging
two food sources $s_0$ and $s_1$. We prove that, under this model, the mass of
the mold will eventually converge to the shortest $s_0$-$s_1$ path of the
network that the mold lies on, independently of the structure of the network or
of the initial mass distribution.
This matches the experimental observations by the biologists and can be seen as
an example of a "natural algorithm", that is, an algorithm developed by
evolution over millions of years. },
}
@ARTICLE{Bonifaci2012b,
AUTHOR = {Bonifaci, Vincenzo and Marchetti-Spaccamela, Alberto and Stiller, Sebastian},
JOURNAL = {Algorithmica},
TITLE = {A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling},
ADDRESS = {New York, NY},
NUMBER = {3-4},
PUBLISHER = {Springer},
MONTH = {April},
VOLUME = {62},
ISBN = {0178-4617},
DOI = {10.1007/s00453-011-9497-2},
YEAR = {2012},
PAGES = {1034--1049},
ABSTRACT = {We devise an approximate feasibility test for multiprocessor real-time
scheduling in the sporadic task model. We give an algorithm that, given a task
system and $\epsilon>0$, correctly decides either that the task system can be
scheduled using the Earliest Deadline First algorithm on m speed-$(2−1/
m+\epsilon)$ machines, or that the system is not schedulable by any algorithm
on m unit speed machines. This speedup bound is known to be the best possible
for EDF. The running time of the algorithm is polynomial in the size of the
task system and $1/\epsilon$. We also provide a generalized tight bound that
trades off speed with additional machines. },
}
@ARTICLE{Bonifaci2012c,
AUTHOR = {Bonifaci, Vincenzo and Mehlhorn, Kurt and Varma, Girish},
JOURNAL = {Journal of Theoretical Biology},
TITLE = {Physarum Can Compute Shortest Paths},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
VOLUME = {309},
ISBN = {0022-5193},
DOI = {10.1016/j.jtbi.2012.06.017},
YEAR = {2012},
PAGES = {121--133},
ABSTRACT = {Physarum polycephalum is a slime mold that is apparently able to solve shortest
path problems.
A mathematical model has been proposed by Tero, Kobayashi and Nakagaki [Journal
of Theoretical Biology, 244, 2007, pp. 553--564] to describe the feedback
mechanism used by the slime mold to adapt its tubular channels while foraging
two food sources s0 and s1. We prove that, under this model, the mass of the
mold will eventually converge to the shortest s0-s1 path of the network that
the mold lies on, independently of the structure of the network or of the
initial mass distribution.
This matches the experimental observations by Tero et al. and can be seen as an
example of a ``natural algorithm'', that is, an algorithm developed by
evolution over millions of years. },
}
@INPROCEEDINGS{Bonifaci2013,
AUTHOR = {Bonifaci, Vincenzo and Marchetti-Spaccamela, Alberto and Stiller, Sebastian and Wiese, Andreas},
TITLE = {Feasibility Analysis in the Sporadic DAG Task Model},
BOOKTITLE = {Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013)},
PADDRESS = {Los Alamitos, USA},
ADDRESS = {Paris, France},
PUBLISHER = {IEEE},
YEAR = {2013},
}
@INPROCEEDINGS{Bonifaci2013b,
AUTHOR = {Bonifaci, Vincenzo and Marchetti-Spaccamela, Alberto and Megow, Nicole and Wiese, Andreas},
TITLE = {Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks},
BOOKTITLE = {Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013)},
PADDRESS = {Los Alamitos, USA},
ADDRESS = {Vancouver, Canada},
PUBLISHER = {IEEE},
YEAR = {2013},
}
@ARTICLE{BonifaciCMM2012,
AUTHOR = {Bonifaci, Vincenzo and Chan, Ho-Leung and Marchetti-Spaccamela, Alberto and Megow, Nicole},
JOURNAL = {ACM Transactions on Algorithms},
TITLE = {Algorithms and Complexity for Periodic Real-Time Scheduling},
VOLUME = {9},
YEAR = {2012},
PAGES = {601--619},
}
@ARTICLE{Bonifaci:2009:a,
AUTHOR = {Bonifaci, Vincenzo and Harks, Tobias and Sch{\"a}fer, Guido},
JOURNAL = {Mathematics of Operations Research},
TITLE = {Stackelberg Routing in Arbitrary Networks},
ADDRESS = {Hanover, USA},
NUMBER = {2},
PUBLISHER = {INFORMS},
MONTH = {May},
VOLUME = {35},
ISBN = {0364-765X},
DOI = {10.1287/moor.1100.0442v1},
YEAR = {2010},
PAGES = {330 -- 346},
ABSTRACT = {We investigate the impact of \emph{Stackelberg routing} to reduce the price of
anarchy in network routing games. In this setting, an $\alpha$ fraction of the
entire demand is first routed centrally according to a predefined
\emph{Stackelberg strategy} and the remaining demand is then routed selfishly
by (nonatomic) players. Although several advances have been made recently in
proving that Stackelberg routing can in fact significantly reduce the price of
anarchy for certain network topologies, the central question of whether this
holds true in general is still open. We answer this question negatively by
constructing a family of single-commodity instances such that every Stackelberg
strategy induces a price of anarchy that grows linearly with the size of the
network.
Moreover, we prove upper bounds on the price of anarchy of the
Largest-Latency-First (LLF) strategy that only depend on the size of the
network. Besides other implications, this rules out the possibility to
construct constant-size networks to prove an unbounded price of anarchy.
In light of this negative result, we consider bicriteria bounds. We develop an
efficiently computable Stackelberg strategy that induces a flow whose cost is
at most the cost of an optimal flow with respect to demands scaled by a factor
of $1 + \sqrt{1-\alpha}$.
Finally, we analyze the effectiveness of an easy-to-implement Stackelberg
strategy, called SCALE. We prove bounds for a general class of latency
functions that includes polynomial latency functions as a special case. Our
analysis is based on an approach which is simple, yet powerful enough to obtain
(almost) tight bounds for SCALE in general networks.},
}
@INPROCEEDINGS{Bonifaci:2010:b,
AUTHOR = {Bonifaci, Vincenzo and Chan, Ho-Leung and Marchetti-Spaccamela, Alberto and Megow, Nicole},
EDITOR = {Charikar, Moses},
TITLE = {Algorithms and Complexity for Periodic Real-Time Scheduling},
BOOKTITLE = {21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010)},
PADDRESS = {Philadelphia, Pa.},
ADDRESS = {Austin (TX), USA},
PUBLISHER = {SIAM},
ISBN = {978-0-898716-98-6},
YEAR = {2010},
PAGES = {1350--1359},
ABSTRACT = {We investigate the preemptive scheduling of periodic tasks with hard deadlines.
We show that, even in the uniprocessor case, no polynomial time algorithm can
test the feasibility of a task system within a constant speedup bound, unless
$\ccp=\ccnp$. This result contrasts with recent results for sporadic task
systems. For two special cases, synchronous task systems and systems with a
constant number of different task types, we provide the first polynomial time
constant-speedup feasibility tests for multiprocessor platforms. Furthermore,
we show that the problem of testing feasibility is coNP-hard for synchronous
multiprocessor tasks systems. The complexity of some of these problems has been
open for a long time.
We also propose a profit maximization variant of the feasibility
problem, where every task has a non-negative profit, and the goal is to find a
subset of tasks that can be scheduled feasibly with maximum profit. We give the
first constant-speed, constant-approximation algorithm for the case of
synchronous task systems, together with related hardness results.},
}
@INPROCEEDINGS{Bonifaci:2010:c,
AUTHOR = {Baruah, Sanjoy and Bonifaci, Vincenzo and D'Angelo, Gianlorenzo and Li, Haohan and Marchetti-Spaccamela, Alberto and Megow, Nicole and Stougie, Leen},
EDITOR = {Hlinen{\'y}, Petr and Kucera, Anton\'{\i}n},
TITLE = {Scheduling Real-Time Mixed-Criticality Jobs},
BOOKTITLE = {Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010},
ORGANIZATION = {European Research Consortium for Informatics and Mathematics (ERCIM)},
PADDRESS = {Berlin},
ADDRESS = {Brno, Czech Republic},
PUBLISHER = {Springer},
MONTH = {October},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6281},
ISBN = {3-642-15154-X},
DOI = {10.1007/978-3-642-15155-2},
YEAR = {2010},
PAGES = {90--101},
ABSTRACT = {Many safety-critical embedded systems are subject to certification
requirements; some systems may be required to meet multiple sets of
certification requirements, from different certification authorities.
Certification requirements in such ``mixed-criticality'' systems give rise to
interesting scheduling
problems, that cannot be satisfactorily addressed using techniques from
conventional scheduling theory. In this paper, we study a formal model for
representing such mixed-criticality workloads. We demonstrate first the
intractability of determining whether a system specified in this model can be
scheduled to meet all its certification requirements, even for systems subject
to two sets of certification requirements. Then we quantify, via the metric of
processor speedup factor, the effectiveness of two techniques,
reservation-based scheduling and priority-based scheduling, that are widely
used in scheduling such mixed-criticality systems, showing that the latter of
the two is superior to the former. We also show that the speedup factors are
tight for these two techniques.},
}
@INPROCEEDINGS{Bonifaci:2010:d,
AUTHOR = {Bonifaci, Vincenzo and Marchetti-Spaccamela, Alberto},
EDITOR = {de Berg, Mark and Meyer, Ulrich},
TITLE = {Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems},
BOOKTITLE = {Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II},
PADDRESS = {Berlin},
ADDRESS = {Liverpool, United Kingdom},
PUBLISHER = {Springer},
MONTH = {November},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6347},
ISBN = {978-3-642-15780-6},
DOI = {10.1007/978-3-642-15781-3_20},
YEAR = {2010},
PAGES = {230--241},
ABSTRACT = {We give the first algorithm for testing the feasibility of a system of sporadic
real-time tasks on a set of identical processors, solving an open problem in
the area of multiprocessor real-time scheduling~[S.~Baruah and K.~Pruhs,
Journal of Scheduling, 2009]. We also investigate the related notion of
schedulability and a notion that we call online feasibility. Finally, we show
that discrete-time schedules are as powerful as continuous-time schedules,
which answers another open question in the above mentioned survey. },
}
@ARTICLE{Bonifaci:2011:a,
AUTHOR = {Bonifaci, Vincenzo and Korteweg, Peter and Marchetti-Spaccamela, Alberto and Stougie, Leen},
JOURNAL = {Theoretical Computer Science},
TITLE = {The Distributed Wireless Gathering Problem},
ADDRESS = {Amsterdam},
NUMBER = {8-10},
PUBLISHER = {Elsevier},
MONTH = {March},
VOLUME = {412},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2010.10.018},
YEAR = {2011},
PAGES = {633--641},
ABSTRACT = {We address the problem of data gathering in a wireless network using multi-hop
communication; our main goal is the analysis of simple algorithms suitable for
implementation in realistic scenarios. We study the performance of distributed
algorithms, which do not use any form of local coordination, and we focus on
the objective of minimizing average flow times of data packets. We prove a
lower bound of $\Omega(n)$ on the expected competitive ratio of any
acknowledgment-based distributed algorithm minimizing the maximum flow time,
where $n$ is the number of nodes of the network. Next, we consider a
distributed algorithm which sends packets over shortest paths, and we use
resource augmentation to analyze its performance when the objective is to
minimize the average flow time. If interferences are modeled as in Bar-Yehuda
et al. [R. Bar-Yehuda, O. Goldreich, A. Itai, On the time complexity of
broadcast in multi-hop radio networks: an exponential gap between determinism
and randomization, Journal of Computer and Systems Sciences 45 (1) (1992) 104–
126] we prove that the algorithm is $(1+\epsilon)$-competitive, when the
algorithm sends packets a factor $O(\log(\delta/\epsilon) \log \Delta)$ faster
than the optimal off-line solution; here $\delta$ is the radius of the network
and $\Delta$ the maximum degree. We finally extend this result to a more
complex interference model.},
}
@ARTICLE{Bonifaci:2011:b,
AUTHOR = {Bonifaci, Vincenzo and Korteweg, Peter and Marchetti-Spaccamela, Alberto and Stougie, Leen},
JOURNAL = {ACM Transactions on Algorithms},
TITLE = {Minimizing Flow Time in the Wireless Gathering Problem},
ADDRESS = {New York, NY},
NUMBER = {3},
PUBLISHER = {ACM},
VOLUME = {7},
ISBN = {1549-6325},
DOI = {10.1145/1978782.1978788},
YEAR = {2011},
PAGES = {33:1--33:20},
ABSTRACT = {We address the problem of efficient data gathering in a wireless network
through multihop communication. We focus on two objectives related to flow
times, that is, the times spent by data packets in the system: minimization of
the maximum flow time and minimization of the average flow time of the packets.
For both problems we prove that, unless P=NP, no polynomial-time algorithm can
approximate the optimal solution within a factor less than
$\Omega(m^{1-\epsilon})$ for any $0<\epsilon<1$, where $m$ is the number of
packets. We then assess the performance of two natural algorithms by proving
that their cost remains within the optimal cost of the respective problem if we
allow the algorithms to transmit data at a speed 5 times higher than that of
the optimal solutions to which we compare them.},
}
@INPROCEEDINGS{Bonifaci:2011:c,
AUTHOR = {Baruah, Sanjoy and Bonifaci, Vincenzo and D'Angelo, Gianlorenzo and Marchetti-Spaccamela, Alberto and van der Ster, Suzanne and Stougie, Leen},
EDITOR = {Demetrescu, Camil and Halld{\'o}rsson, Magn{\'u}s M.},
TITLE = {Mixed-criticality scheduling of sporadic task systems},
BOOKTITLE = {Algorithms - ESA 2011 : 19th Annual European Symposium},
PADDRESS = {Berlin},
ADDRESS = {Saarbr{\"u}cken, Germany},
PUBLISHER = {Springer},
MONTH = {October},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6942},
ISBN = {0302-9743},
DOI = {10.1007/978-3-642-23719-5_47},
YEAR = {2011},
PAGES = {555--566},
ABSTRACT = {We consider the scheduling of mixed-criticality task systems, that is, systems
where each task to be scheduled has multiple levels of worst-case execution
time estimates. We design a scheduling algorithm, EDF-VD, whose effectiveness
we analyze using the processor speedup metric: we show that any 2-level task
system that is schedulable on a unit-speed processor is correctly scheduled by
EDF-VD using speed $\phi$; here $\phi < 1.619$ is the golden ratio. We also
show how to generalize the algorithm to $K > 2$ criticality levels. We finally
consider 2-level instances on $m$ identical machines. We prove speedup bounds
for scheduling an independent collection of jobs and for the partitioned
scheduling of a 2-level task system. },
}
@BOOK{BookNeumannWitt,
AUTHOR = {Neumann, Frank and Witt, Carsten},
TITLE = {Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity},
ADDRESS = {New York, NY},
PUBLISHER = {Springer},
SERIES = {Natural Computing Series},
ISBN = {978-3-642-16543-6},
YEAR = {2010},
PAGES = {216},
}
@BOOK{books/wi/LoeckxMW89,
AUTHOR = {Loeckx, Jacques and Mehlhorn, Kurt and Wilhelm, Reinhard},
TITLE = {Foundations of Programming Languages},
ADDRESS = {New York, USA},
PUBLISHER = {Wiley},
ISBN = {0-471-92139-4},
YEAR = {1989},
PAGES = {426},
}
@ARTICLE{BorosElabassioniMakino2010,
AUTHOR = {Boros, Endre and Elbassioni, Khaled and Makino, Kazuhisa},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Left-to-right multiplication for monotone {Boolean} dualization},
ADDRESS = {Philadelphia, Pa.},
NUMBER = {7},
PUBLISHER = {SIAM},
VOLUME = {39},
ISBN = {0097-5397},
DOI = {10.1137/080734881},
YEAR = {2010},
PAGES = {3424--3439},
}
@ARTICLE{BorosElbassioniGurvich2010,
AUTHOR = {Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa},
JOURNAL = {Games and Economic Behavior},
TITLE = {On effectivity functions of game forms},
ADDRESS = {Amsterdam},
NUMBER = {2},
PUBLISHER = {Elsevier},
VOLUME = {68},
ISBN = {0899-8256},
DOI = {10.1016/j.geb.2009.09.002},
YEAR = {2010},
PAGES = {512--531},
}
@MASTERSTHESIS{Boullay96,
AUTHOR = {Boullay, Johannes},
TITLE = {{Eine parallelisierbare Heuristik f{\"u}r das Min-Cost-Flow Problem}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1996},
}
@ARTICLE{Bradford-Capoyleas97,
AUTHOR = {Bradford, Phillip Gnassi and Capoyleas, Vasilis},
JOURNAL = {Discrete \& Computational Geometry},
TITLE = {Weak epsilon-Nets for Points on a Hypersphere},
NUMBER = {1},
VOLUME = {18},
YEAR = {1997},
PAGES = {83--91},
}
@INPROCEEDINGS{Bradford-et-al95,
AUTHOR = {Bradford, Phillip Gnassi and Choppela, Venkatesh and Rawlins, Gregory J.E.},
EDITOR = {Baeza-Yates, Ricardo and Goles, Eric and Poblete, Patricio V.},
TITLE = {Lower Bounds for the Matrix Chain Ordering Problem},
BOOKTITLE = {LATIN'95: Theoretical Informatics, 2nd Latin American Symposium},
PADDRESS = {Berlin},
ADDRESS = {Valparaiso, Chile},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {911},
YEAR = {1995},
PAGES = {112--130},
}
@ARTICLE{Bradford-et-al.98,
AUTHOR = {Bradford, Phillip Gnassi and Rawlins, Gregory J.E. and Shannon, Greogory E.},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Efficient Matrix Chain Ordering in Polylog Time},
NUMBER = {2},
VOLUME = {27},
ISBN = {0097-5397},
YEAR = {1998},
PAGES = {466--490},
}
@ARTICLE{Bradford-Fleischer-96,
AUTHOR = {Alon, Noga and Bradford, Phillip Gnassi and Fleischer, Rudolf},
JOURNAL = {Information Processing Letters},
TITLE = {Matching nuts and bolts faster},
NUMBER = {3},
PUBLISHER = {Elsevier},
VOLUME = {59},
ISBN = {0020-0190},
YEAR = {1996},
PAGES = {123--127},
}
@INPROCEEDINGS{Bradford-Fleischer95,
AUTHOR = {Bradford, Phillip Gnassi and Fleischer, Rudolf},
EDITOR = {Staples, John and Eades, Peter and Katoh, Naoki and Moffat, Alistair},
TITLE = {Matching nuts and bolts faster},
BOOKTITLE = {Algorithms and Computation: 6th International Symposium (ISAAC'95)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Cairns, Australia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1004},
YEAR = {1995},
PAGES = {402--408},
}
@INPROCEEDINGS{Bradford-Reinert-96,
AUTHOR = {Bradford, Phillip Gnassi and Reinert, Knut},
EDITOR = {Meyer auf der Heide, Friedhelm and Monien, Burkhard},
TITLE = {Lower Bounds for Row Minima Searching},
BOOKTITLE = {Automata Languages and Programming: 23rd International Colloquium (ICALP'96)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Paderborn},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1099},
YEAR = {1996},
PAGES = {454--465},
}
@ARTICLE{BradfordGolinLarmore2002,
AUTHOR = {Bradford, Phillip Gnassi and Golin, Mordecai J. and Larmore, Lawrence L.},
JOURNAL = {Journal of Algorithms},
TITLE = {Optimal prefix-free codes for unequal letter costs: Dynamic programming with the {Monge} property},
ADDRESS = {New York, USA},
NUMBER = {2},
PUBLISHER = {Academic Press},
MONTH = {February},
VOLUME = {42},
ISBN = {0196-6774},
YEAR = {2002},
PAGES = {277--303},
}
@INPROCEEDINGS{BradfordGolinLarmoreRytter1998,
AUTHOR = {Bradford, Phillip Gnassi and Golin, Mordecai J. and Larmore, Lawrence L. and Rytter, Wojciech},
EDITOR = {Bilardi, Gianfranco and Italiano, Giuseppe F. and Pietracaprina, Andrea and Pucci, Geppino},
TITLE = {Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property},
BOOKTITLE = {Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Venice, Italy},
PUBLISHER = {Springer},
MONTH = {August},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1461},
ISBN = {0302-9743},
YEAR = {1998},
PAGES = {43--54},
}
@MASTERSTHESIS{BramerDipl03,
AUTHOR = {Bramer, Andreas},
TITLE = {{Zwei Algorithmen zur Bestimmung kostenminimaler Fl{\"u}sse in Netzwerken}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {November},
YEAR = {2003},
}
@INPROCEEDINGS{BrandenburgJuengerMutzelLengauer97,
AUTHOR = {Brandenburg, Franz J. and J{\"u}nger, Michael and Mutzel, Petra and Lengauer, Thomas},
EDITOR = {Jarke, Matthias and Pasedach, Klaus and Pohl, Klaus},
TITLE = {{SPP 731 : Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts "Effiziente Algorithmen f{\"u}r diskrete Probleme und ihre Anwendungen"}},
BOOKTITLE = {Informatik '97 : Informatik als Innovationsmotor : 27. Jahrestagung der Gesellschaft f{\"u}r Informatik},
PADDRESS = {Berlin},
ADDRESS = {Aachen},
PUBLISHER = {Springer},
YEAR = {1997},
PAGES = {58--67},
}
@MASTERSTHESIS{Braun2000,
AUTHOR = {Braun, Sebastian},
TITLE = {{Entwicklung und Test von f{\"u}r statische Graphen optimierte Datentypen}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {January},
YEAR = {2000},
}
@INPROCEEDINGS{brederecknichterleinniedermeierphilip2011a,
AUTHOR = {Bredereck, Robert and Nichterlein, Andr{\'e} and Niedermeier, Rolf and Philip, Geevarghese},
EDITOR = {Murlak, Filip and Sankowski, Piotr},
TITLE = {Pattern-Guided Data Anonymization and Clustering},
BOOKTITLE = {Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
PADDRESS = {Berlin},
ADDRESS = {Warsaw, Poland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6907},
ISBN = {978-3-642-22992-3},
DOI = {10.1007/978-3-642-22993-0},
YEAR = {2011},
PAGES = {182--193},
ABSTRACT = {A matrix~$M$ over a fixed alphabet is $k$-anonymous if every row
in~$M$ has at least~$k-1$ identical copies in~$M$. Making a matrix
$k$-anonymous by replacing a minimum number of entries with an additional
$\star$-symbol (called ``suppressing entries'') is known to be
NP-hard. This task arises in the context of privacy-preserving
publishing. We propose and analyze the computational complexity
of an enhanced anonymization model where the user of the
$k$-anonymized data may additionally ``guide'' the selection of
the candidate matrix entries to be suppressed. The basic idea is
to express this by means of ``pattern vectors'' which are part
of the input. This can also be interpreted as a sort of
clustering process. It is motivated by the observation that
the ``value'' of matrix entries may significantly differ, and
losing one (by suppression) may be more harmful than losing
the other, which again may very much depend on the intended use of the
anonymized data. We show that already very basic special cases
of our new model lead to NP-hard problems while others allow for
(fixed-parameter) tractability results.},
}
@INPROCEEDINGS{BredereckNichterleinNiedermeierPhilip2011b,
AUTHOR = {Bredereck, Robert and Nichterlein, Andr{\'e} and Niedermeier, Rolf and Philip, Geevarghese},
EDITOR = {Owe, Olaf and Steffen, Martin and Telle, Jan Arne},
TITLE = {The Effect of Homogeneity on the Complexity of $k$-Anonymity},
BOOKTITLE = {Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings},
PADDRESS = {Berlin},
ADDRESS = {Oslo, Norway},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6914},
DOI = {978-3-642-22952-7},
YEAR = {2011},
PAGES = {53--64},
ABSTRACT = {The NP-hard \textsc{$k$-Anonymity}
problem asks, given an~$n \times m$-matrix~$M$ over a
fixed alphabet and an integer~$s>0$, whether~$M$ can be made
$k$-anonymous by suppressing (blanking out) at most~$s$
entries. A matrix~$M$ is said to be $k$-anonymous if for each
row~$r$ in~$M$ there are at least~$k-1$ other rows in~$M$ which
are identical to~$r$. Complementing previous work, we introduce two new
``data-driven'' parameterizations for \textsc{$k$-Anonymity}---the
number~$\tin$ of
different input rows and the number~$\tout$ of different output rows---both
modeling aspects of data homogeneity. We show that \textsc{$k$-Anonymity}
is fixed-parameter tractable for the parameter~$\tin$, and it is
NP-hard even for~$\tout = 2$ and alphabet size four.
Notably, our fixed-parameter tractability result implies that
\textsc{$k$-Anonymity} can be solved in \emph{linear time} when~$\tin$ is a
constant. Our results also extend to some interesting
generalizations of \textsc{$k$-Anonymity}.},
}
@ARTICLE{BrelauerJiangJiang97,
AUTHOR = {Breslauer, Dany and Jiang, Tao and Jiang, Zhigen},
JOURNAL = {Journal of Algorithms},
TITLE = {Rotations of periodic strings and short superstrings},
NUMBER = {1},
VOLUME = {24},
YEAR = {1997},
PAGES = {340--353},
}
@MASTERSTHESIS{Bremer95,
AUTHOR = {Bremer, Dirk},
TITLE = {{Analyse und Simulation eines Maximum-Flow Algorithmus f{\"u}r das Gitter}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1995},
}
@MASTERSTHESIS{Brengel2000,
AUTHOR = {Brengel, Klaus},
TITLE = {{Externe Priorit{\"a}tswarteschlangen}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {January},
YEAR = {2000},
}
@ARTICLE{BreslauerRamesh96,
AUTHOR = {Breslauer, Dany and Ramesh, Hariharan},
JOURNAL = {Parallel Processing Letters},
TITLE = {Optimal Parallel Construction of Minimal Suffix and Factor Automata},
NUMBER = {1},
VOLUME = {6},
YEAR = {1996},
PAGES = {35--44},
}
@ARTICLE{BrFlSm97,
AUTHOR = {Bradford, Phillip Gnassi and Fleischer, Rudolf and Smid, Michiel},
JOURNAL = {Journal of Algorithms},
TITLE = {More efficient parallel totally monotone matrix searching},
VOLUME = {23},
YEAR = {1997},
PAGES = {386--400},
}
@ARTICLE{Brightwell2012,
AUTHOR = {Brightwell, Graham and Panagiotou, Konstantinos and Steger, Angelika},
JOURNAL = {Random Structures \& Algorithms},
TITLE = {Extremal subgraphs of random graphs},
ADDRESS = {Chichester},
NUMBER = {2},
PUBLISHER = {Wiley},
VOLUME = {41},
ISBN = {1042-9832},
DOI = {10.1002/rsa.20413},
YEAR = {2012},
PAGES = {147--178},
}
@INPROCEEDINGS{Bringmann13,
AUTHOR = {Bringmann, Karl},
EDITOR = {Chatterjee, Krishnendu and Sgall, Jir{\'i}},
TITLE = {Bringing Order to Special Cases of Klee’s Measure Problem},
BOOKTITLE = {38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13)},
ORGANIZATION = {European Association for Theoretical Computer Science (EATCS)},
PADDRESS = {Heidelberg},
ADDRESS = {Klosterneuburg, Austria},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8087},
YEAR = {2013},
PAGES = {207--218},
}
@ARTICLE{Bringmann2012d,
AUTHOR = {Bringmann, Karl and Friedrich, Tobias},
JOURNAL = {Theoretical Computer Science},
TITLE = {Approximating the least hypervolume contributor: {NP-hard} in general, but fast in practice},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
VOLUME = {425},
DOI = {10.1016/j.tcs.2010.09.026},
YEAR = {2012},
PAGES = {104--116},
}
@ARTICLE{BringmannCGTA12,
AUTHOR = {Bringmann, Karl},
JOURNAL = {Computational Geometry: Theory and Applications},
TITLE = {An improved algorithm for {Klee's} measure problem on fat boxes},
ADDRESS = {Amsterdam},
NUMBER = {5-6},
PUBLISHER = {Elsevier},
MONTH = {July},
VOLUME = {45},
ISBN = {0925-7721},
DOI = {10.1016/j.comgeo.2011.12.001},
YEAR = {2012},
PAGES = {225--233},
ABSTRACT = {The measure problem of Klee asks for the volume of the union of n axis-parallel
boxes in a fixed dimension d. We give an O(n^((d+2)/3)) time algorithm for the
special case of all boxes being cubes or, more generally, fat boxes.
Previously, the fastest run-time was n^(d/2) 2^O(log⁎n) , achieved by the
general case algorithm of Chan [SoCG 2008]. For the general problem our
run-time would imply a breakthrough for the k-clique problem.},
}
@INPROCEEDINGS{BringmannDoerrNeumannSliacan2013,
AUTHOR = {Bringmann, Karl and Doerr, Benjamin and Neumann, Adrian and Sliacan, Jakub},
EDITOR = {Fomin, Fedor V. and Freivalds, Rūsiņ{\v{s}} and Kwiatkowska, Marta and Peleg, David},
TITLE = {Online Checkpointing with Improved Worst-Case Guarantees},
BOOKTITLE = {Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013)},
ORGANIZATION = {European Association for Theoretical Computer Science (EATCS)},
PADDRESS = {Heidelberg},
ADDRESS = {Riga, Latvia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7965},
ISBN = {978-3-642-39205-4},
DOI = {10.1007/978-3-642-39206-1},
YEAR = {2013},
PAGES = {255--266},
ABSTRACT = { In the online checkpointing problem, the task is to continuously maintain a
set of $k$ checkpoints that allow to rewind an ongoing computation faster than
by a full restart. The only operation allowed is to replace an old checkpoint
by the current state. Our aim are checkpoint placement strategies that minimize
rewinding cost, i.e., such that at all times $T$ when requested to rewind to
some time $t \le T$ the number of computation steps that need to be redone to
get to $t$ from a checkpoint before $t$ is as small as possible. In particular,
we want that the closest checkpoint earlier than $t$ is not further away from
$t$ than $q_k$ times the ideal distance $T / (k+1)$, where $q_k$ is a small
constant.
Improving over earlier work showing $1 + 1/k \le q_k \le 2$, we show that
$q_k$ can be chosen asymptotically less than $2$. We present algorithms with
asymptotic discrepancy $q_k \le 1.59 + o(1)$ valid for all $k$ and $q_k \le
\ln(4) + o(1) \le 1.39 + o(1)$ valid for $k$ being a power of two. Experiments
indicate the uniform bound $p_k \le 1.7$ for all $k$. For small $k$, we show
how to use a linear programming approach to compute good checkpointing
algorithms. This gives discrepancies of less than $1.55$ for all $k < 60$.
We prove the first lower bound that is asymptotically more than one, namely
$q_k \ge 1.30 - o(1)$. We also show that optimal algorithms (yielding the
infimum discrepancy) exist for all~$k$. },
}
@INPROCEEDINGS{BringmannEMR13,
AUTHOR = {Bringmann, Karl and Engels, Christian and Manthey, Bodo and Raghavendra Rao, B. V.},
EDITOR = {Chatterjee, Krishnendu and Sgall, Jir{\'i}},
TITLE = {Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems},
BOOKTITLE = {38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13)},
ORGANIZATION = {European Association for Theoretical Computer Science (EATCS)},
PADDRESS = {Heidelberg},
ADDRESS = {Klosterneuburg, Austria},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8087},
YEAR = {2013},
PAGES = {219--230},
}
@INPROCEEDINGS{BringmannF12,
AUTHOR = {Bringmann, Karl and Friedrich, Tobias},
TITLE = {Convergence of Hypervolume-Based Archiving Algorithms {II}: Competitiveness},
BOOKTITLE = {GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, NY},
ADDRESS = {Philadelphia, USA},
PUBLISHER = {ACM},
ISBN = {978-1-4503-1177-9},
DOI = {10.1145/2330163.2330229},
YEAR = {2012},
PAGES = {457--464},
ABSTRACT = {We study the convergence behavior of (μ+λ)-archiving algorithms. A (μ+λ)-
archiving algorithm defines how to choose in each generation μ children from μ
parents and λ offspring together. Archiving algorithms have to choose
individuals online without knowing future offspring. Previous studies assumed
the offspring generation to be best-case. We assume the initial population and
the offspring generation to be worst-case and use the competitive ratio to
measure how much smaller hypervolumes an archiving algorithm finds due to not
knowing the future in advance. We prove that all archiving algorithms which
increase the hypervolume in each step (if they can) are only μ-competitive. We
also present a new archiving algorithm which is (4 + 2/μ)-competitive. This
algorithm not only achieves a constant competitive ratio, but is also
efficiently computable. Both properties provably do not hold for the commonly
used greedy archiving algorithms, for example those used in SIBEA, SMS-EMOA, or
the generational MO-CMA-ES. },
}
@INPROCEEDINGS{BringmannF13,
AUTHOR = {Bringmann, Karl and Friedrich, Tobias},
TITLE = {Parameterized Average-Case Complexity of the Hypervolume Indicator},
BOOKTITLE = {15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13)},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, NY},
ADDRESS = {Amsterdam, The Netherlands},
PUBLISHER = {ACM},
YEAR = {2013},
PAGES = {575--582},
}
@INPROCEEDINGS{BringmannF13-2,
AUTHOR = {Bringmann, Karl and Friedrich, Tobias},
EDITOR = {Fomin, Fedor V. and Freivalds, Rūsiņ{\v{s}} and Kwiatkowska, Marta and Peleg, David},
TITLE = {Exact and Efficient Generation of Geometric Random Variates and Random Graphs},
BOOKTITLE = {Automata, Languages, and Programming - 40th International Colloquium (ICALP-13)},
ORGANIZATION = {European Association for Theoretical Computer Science (EATCS)},
PADDRESS = {Heidelberg},
ADDRESS = {Riga, Latvia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7965},
ISBN = {978-3-642-39205-4},
YEAR = {2013},
PAGES = {267--278},
}
@INPROCEEDINGS{BringmannF2011,
AUTHOR = {Bringmann, Karl and Friedrich, Tobias},
EDITOR = {Krasnogor, Natalio and Lanzim, Pier Luca},
TITLE = {Convergence of Hypervolume-Based Archiving Algorithms {I}: {Effectiveness}},
BOOKTITLE = {GECCO 2011 : Genetic and Evolutionary Computation Conference},
ORGANIZATION = { SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation},
PADDRESS = {New York, NY},
ADDRESS = {Dublin, Ireland},
PUBLISHER = {ACM},
ISBN = {978-1-4503-0557-0},
DOI = {10.1145/2001576.2001678},
YEAR = {2011},
PAGES = {745--752},
ABSTRACT = {The core of hypervolume-based multi-objective evolutionary algorithms is an
archiving algorithm which performs the environmental selection. A (μ+λ)-
archiving algorithm defines how to choose μ children from μ parents and λ
offspring together. We study theoretically (μ+λ)-archiving algorithms which
never decrease the hypervolume from one generation to the next.
Zitzler, Thiele, and Bader (IEEE Trans. Evolutionary Computation, 14:58-79,
2010) proved that all (μ+1)-archiving algorithms are ineffective, which means
there is an initial population such that independent of the used reproduction
rule, a set with maximum hypervolume cannot be reached. We extend this and
prove that for λ<μ all archiving algorithms are ineffective. On the other hand,
locally optimal algorithms, which maximize the hypervolume in each step, are
effective for λ=μ and can always find a population with hypervolume at least
half the optimum for λ<μ.
We also prove that there is no hypervolume-based archiving algorithm which can
always find a population with hypervolume greater than 1/(1+0.1338(1/λ-1/μ))
times the optimum. },
}
@ARTICLE{BringmannFIV13,
AUTHOR = {Bringmann, Karl and Friedrich, Tobias and Igel, Christian and Vo{\ss}, Thomas},
JOURNAL = {Artificial Intelligence},
TITLE = {Speeding Up Many-Objective Optimization by Monte Carlo Approximations},
PUBLISHER = {Elsevier},
MONTH = {November},
VOLUME = {204},
YEAR = {2013},
PAGES = {22–29},
}
@ARTICLE{BringmannFjournal13,
AUTHOR = {Bringmann, Karl and Friedrich, Tobias},
JOURNAL = {Artificial Intelligence},
TITLE = {Approximation Quality of the Hypervolume Indicator},
PUBLISHER = {Elsevier},
MONTH = {February},
VOLUME = {195},
YEAR = {2013},
PAGES = {265–290},
}
@INPROCEEDINGS{BringmannFNW2011,
AUTHOR = {Bringmann, Karl and Friedrich, Tobias and Neumann, Frank and Wagner, Markus},
EDITOR = {Walsh, Toby},
TITLE = {Approximation-guided evolutionary multi-objective optimization},
BOOKTITLE = {Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011)},
ORGANIZATION = {International Joint Conferences on Artificial Intelligence (IJCAI)},
PADDRESS = {Menlo Park, CA},
ADDRESS = {Barcelona, Spain},
PUBLISHER = {AAAI Press},
ISBN = {978-1-57735-516-8},
DOI = {10.5591/978-1-57735-516-8/IJCAI11-204},
YEAR = {2011},
PAGES = {1198--1203},
ABSTRACT = {Multi-objective optimization problems arise frequently in applications but can
often only be solved approximately by heuristic approaches. Evolutionary
algorithms have been widely used to tackle multi-objective problems. These
algorithms use different measures to ensure diversity in the objective space
but are not guided by a formal notion of approximation.
We present a new framework of an evolutionary algorithm for multi-objective
optimization that allows to work with a formal notion of approximation. Our
experimental results show that our approach outperforms state-of-the-art
evolutionary algorithms in terms of the quality of the approximation that is
obtained in particular for problems with many objectives. },
}
@INPROCEEDINGS{BringmannGL,
AUTHOR = {Bringmann, Karl and Green Larsen, Kasper},
TITLE = {Succinct Sampling from Discrete Distributions},
BOOKTITLE = {45th ACM Symposium on Theory of Computing (STOC-13)},
PADDRESS = {New York, USA},
ADDRESS = {Palo Alto, USA},
PUBLISHER = {ACM},
YEAR = {2013},
PAGES = {775--782},
}
@INPROCEEDINGS{BringmannP12,
AUTHOR = {Bringmann, Karl and Panagiotou, Konstantinos},
EDITOR = {Czumaj, Artur and Mehlhorn, Kurt and Pitts, Andrew M. and Wattenhofer, Roger},
TITLE = {Efficient Sampling Methods for Discrete Distributions},
BOOKTITLE = {Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012},
PADDRESS = {Berlin},
ADDRESS = {Warwick, UK},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7391},
ISBN = {978-3-642-31593-0},
DOI = {10.1007/978-3-642-31594-7_12},
YEAR = {2012},
PAGES = {133--144},
ABSTRACT = {We study the fundamental problem of the exact and efficient generation of
random values from a finite and discrete probability distribution. Suppose that
we are given n distinct events with associated probabilities p_1,...,p_n. We
consider the problem of sampling a subset, which includes the i-th event
independently with probability p_i, and the problem of sampling from the
distribution, where the i-th event has a probability proportional to p_i. For
both problems we present on two different classes of inputs – sorted and
general probabilities – efficient preprocessing algorithms that allow for
asymptotically optimal querying, and prove almost matching lower bounds for
their complexity. },
}
@INPROCEEDINGS{BringmannSSS14,
AUTHOR = {Bringmann, Karl and Sauerwald, Thomas and Stauffer, Alexandre and Sun, He},
TITLE = {Balls into bins via local search: cover time and maximum load},
BOOKTITLE = {31st Symposium on Theoretical Aspects of Computer Science (STACS-14)},
PADDRESS = {Heidelberg},
ADDRESS = {Lyon, France},
PUBLISHER = {Springer},
YEAR = {2014},
}
@MASTERSTHESIS{Brockenauer97,
AUTHOR = {Brockenauer, Ralf},
TITLE = {{Separierung von Kuratowski-Ungleichungen f{\"u}r das gr{\"o}{\ss}te planare Untergraphenproblem}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1997},
}
@ARTICLE{Brodal-Chaudhuri-Radhakrishnan,
AUTHOR = {Brodal, Gerth St{\o}lting and Chaudhuri, Shiva and Radhakrishnan, R.},
JOURNAL = {Nordic Journal of Computing},
TITLE = {The randomized complexity of maintaining the minimum},
NUMBER = {4},
PUBLISHER = {Publishing Association Nordic Journal of Computing},
VOLUME = {3},
ISBN = {1236-6064},
YEAR = {1996},
PAGES = {337--351},
}
@INPROCEEDINGS{Brodal-Traeff-Zaro97,
AUTHOR = {Brodal, Gerth St{\o}lting and Tr{\"a}ff, Jesper Larsson and Zaroliagis, Christos},
EDITOR = {Feitelson, Dror G. and Rudolph, Larry},
TITLE = {A parallel priority data structure with applications},
BOOKTITLE = {11th Internatinal Parallel Processing Symposium (IPPS-97)},
PADDRESS = {Los Alamitos, USA},
ADDRESS = {Geneva, Switzerland},
PUBLISHER = {IEEE},
YEAR = {1997},
PAGES = {689--693},
ABSTRACT = {We present a parallel priority data structure that improves
the running time of certain algorithms for problems
that lack a fast and work-efficient parallel solution.
As a main application, we give a parallel implementation
of Dijkstra's algorithm which runs in $O(n)$ time
while performing $O(m\log n)$ work on a CREW PRAM\@.
This is a logarithmic factor improvement for the running
time compared with previous approaches. The main
feature of our data structure is that the operations needed
in each iteration of Dijkstra's algorithm can be
supported in $O(1)$ time.},
}
@INPROCEEDINGS{Brodal1998b,
AUTHOR = {Brodal, Gerth St{\o}lting and Katajainen, Jyrki},
EDITOR = {Arnborg, Stefan and Ivansson, Lars},
TITLE = {Worst-Case Efficient External-Memory Priority Queues},
BOOKTITLE = {Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Stockholm, Sweden},
PUBLISHER = {Springer},
MONTH = {July},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1432},
ISBN = {3-540-64682-5},
YEAR = {1998},
PAGES = {107--118},
ABSTRACT = {A priority queue $Q$ is a data structure that maintains a collection
of elements, each element having an associated priority drawn from a
totally ordered universe, under the operations {\sc Insert}, which
inserts an element into $Q$, and {\sc DeleteMin}, which deletes an
element with the minimum priority from $Q$. In this paper a
priority-queue implementation is given which is efficient with
respect to the number of block transfers or I/Os performed between
the internal and external memories of a computer. Let $B$ and $M$
denote the respective capacity of a block and the internal memory
measured in elements. The developed data structure handles any
intermixed sequence of {\sc Insert} and {\sc DeleteMin} operations such
that in every disjoint interval of $B$ consecutive priority-queue
operations at most $c \log_{M/B} \frac{N}{M}$ I/Os are performed,
for some positive constant $c$. These I/Os are divided evenly among
the operations: if $B \geq c \log_{M/B} \frac{N}{M}$, one I/O is
necessary for every $B/(c\log_{M/B} \frac{N}{M})$th operation and if
$B < c \log_{M/B} \frac{N}{M}$, $\frac{c}{B}\log_{M/B} \frac{N}{M}$
I/Os are performed per every operation. Moreover, every operation
requires $O(\log_2 N)$ comparisons in the worst case. The best
earlier solutions can only handle a sequence of $S$ operations with
$O(\sum_{i=1}^{S}\frac{1}{B}\log_{M/B}\frac{N_{i}}{M})$ I/Os, where
$N_{i}$ denotes the number of elements stored in the data structure
prior to the $i$th operation, without giving any guarantee for the
performance of the individual operations.},
}
@INPROCEEDINGS{Brodal1998c,
AUTHOR = {Brodal, Gerth St{\o}lting and Pinotti, M. Cristina},
EDITOR = {Arnborg, Stefan and Ivansson, Lars},
TITLE = {Comparator Networks for Binary Heap Construction},
BOOKTITLE = {Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Stockholm, Sweden},
PUBLISHER = {Springer},
MONTH = {July},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1432},
ISBN = {3-540-64682-5},
YEAR = {1998},
PAGES = {158--168},
ABSTRACT = {Comparator networks for constructing binary heaps of size $n$ are
presented which have size $O(n\log\log n)$ and depth $O(\log n)$. A
lower bound of $n\log\log n-O(n)$ for the size of any heap
construction network is also proven, implying that the networks
presented are within a constant factor of optimal. We give
a tight relation between the leading constants in the size of selection
networks and in the size of heap construction networks.},
}
@ARTICLE{Brodal1998d,
AUTHOR = {Brodal, Gerth St{\o}lting and Tr{\"a}ff, Jesper Larsson and Zaroliagis, Christos},
JOURNAL = {Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures},
TITLE = {A Parallel Priority Queue with Constant Time Operations},
NUMBER = {1},
PUBLISHER = {Academic Press},
VOLUME = {49},
ISBN = {0743-7315},
YEAR = {1998},
PAGES = {4--21},
ABSTRACT = {We present a parallel priority queue that supports the following
operations in constant time: {\em parallel insertion\/} of a
sequence of elements ordered according to key,
{\em parallel decrease key\/} for a sequence of elements ordered
according to key, {\em deletion of the minimum key element}, as well as
{\em deletion of an arbitrary element}. Our data structure is the first
to support multi insertion and multi decrease key in constant time.
The priority queue can be implemented on the EREW PRAM, and can
perform any sequence of $n$ operations in $O(n)$ time and $O(m\log
n)$ work, $m$ being the total number of keys inserted and/or
updated. A main application is a parallel implementation of
Dijkstra's algorithm for the single-source shortest path problem,
which runs in $O(n)$ time and $O(m\log n)$ work on a CREW PRAM on
graphs with $n$ vertices and $m$ edges. This is a logarithmic factor
improvement in the running time compared with previous approaches.},
}
@INPROCEEDINGS{Brodal96,
AUTHOR = {Brodal, Gerth St{\o}lting},
TITLE = {Priority queues on parallel machines},
BOOKTITLE = {5th Scandinavian Workshop on Algorithm Theory (SWAT96)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Reykjavik, Iceland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1097},
YEAR = {1996},
PAGES = {416--427},
}
@INPROCEEDINGS{Brodal97a,
AUTHOR = {Brodal, Gerth St{\o}lting},
EDITOR = {Reischuk, Rudiger and Morvan, Michel},
TITLE = {Predecessor Queries in Dynamic Integer Sets},
BOOKTITLE = {Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS-97)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Lubeck, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1200},
ISBN = {3-540-62616-6},
YEAR = {1997},
PAGES = {21--32},
ABSTRACT = {We consider the problem of maintaining a set of $n$ integers in the
range $0..2^{w}-1$ under the operations of insertion, deletion,
predecessor queries, minimum queries and maximum queries on a unit
cost RAM with word size $w$ bits. Let $f(n)$ be an arbitrary
nondecreasing smooth function satisfying $\log\log n\leq f(n)\leq
\sqrt{\log n}$. A data structure is presented supporting insertions
and deletions in worst case $O(f(n))$ time, predecessor queries in
worst case $O((\log n)/f(n))$ time and minimum and maximum queries
in worst case constant time. The required space is $O(n2^{\epsilon
w})$ for an arbitrary constant $\epsilon>0$. The RAM operations
used are addition, arbitrary left and right bit shifts and bit-wise
boolean operations. The data structure is the first supporting
predecessor queries in worst case $O(\log n/\log\log n)$ time while
having worst case $O(\log\log n)$ update time.},
}
@INPROCEEDINGS{Brodal98a,
AUTHOR = {Brodal, Gerth St{\o}lting},
TITLE = {Finger Search Trees with Constant Update Time},
BOOKTITLE = {Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98)},
ORGANIZATION = {Association of Computing Machinery/Society for Industrial and Applied Mathematics},
PADDRESS = {New York, USA},
ADDRESS = {San Francisko, USA},
PUBLISHER = {ACM Press / SIAM},
ISBN = {0-89871-410-9},
YEAR = {1998},
PAGES = {540--549},
ABSTRACT = {We consider the problem of implementing finger search trees on the
pointer machine, {\it i.e.}, how to maintain a sorted list such that
searching for an element $x$, starting the search at any arbitrary
element $f$ in the list, only requires logarithmic time in the
distance between $x$ and $f$ in the list.
We present the first pointer-based implementation of finger search
trees allowing new elements to be inserted at any arbitrary position
in the list in worst case constant time. Previously, the best known
insertion time on the pointer machine was $O(\log^{*} n)$, where $n$
is the total length of the list. On a unit-cost RAM, a constant
insertion time has been achieved by Dietz and Raman by using
standard techniques of packing small problem sizes into a constant
number of machine words.
Deletion of a list element is supported in $O(\log^{*} n)$ time, which
matches the previous best bounds. Our data structure requires linear
space.},
}
@INPROCEEDINGS{BrodalChaudhuriRadhakrishnan96-CPM-7,
AUTHOR = {Brodal, Gerth St{\o}lting and Chaudhuri, Shiva and Radhakrishnan, Jaikumar},
EDITOR = {Karlsson, Rolf and Lingas, Andrzej},
TITLE = {The randomized complexity of maintaining the minimum},
BOOKTITLE = {Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory},
PADDRESS = {Berlin},
ADDRESS = {Reykjavik, Iceland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1097},
YEAR = {1996},
PAGES = {4--15},
}
@ARTICLE{BroennimannBurnikelPion2001,
AUTHOR = {Br{\"o}nnimann, Herv{\'e} and Burnikel, Christoph and Pion, Sylvain},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Interval arithmetic yields efficient dynamic filters for computational geometry},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {1/2},
PUBLISHER = {Elsevier},
MONTH = {April},
VOLUME = {109},
YEAR = {2001},
PAGES = {25--47},
}
@ARTICLE{BroetalTEC2009,
AUTHOR = {Brockhoff, Dimo and Friedrich, Tobias and Hebbinghaus, Nils and Klein, Christian and Neumann, Frank and Zitzler, Eckart},
JOURNAL = {IEEE Transactions on Evolutionary Computation},
TITLE = {On the Effects of Adding Objectives to Plateau Functions},
ADDRESS = {New York, NY},
NUMBER = {3},
PUBLISHER = {IEEE},
VOLUME = {13},
ISBN = {1089-778X},
DOI = {10.1109/TEVC.2008.2009064},
YEAR = {2009},
PAGES = {591--603},
}
@INPROCEEDINGS{BroFriNeuPPSN2008,
AUTHOR = {Brockhoff, Dimo and Friedrich, Tobias and Neumann, Frank},
EDITOR = {Rudolph, G{\"u}nter and Jansen, Thomas and Lucas, Simon M. and Poloni, Carlo and Beume, Nicola},
TITLE = {Analyzing Hypervolume Indicator Based Algorithms},
BOOKTITLE = {Parallel Problem Solving from Nature (PPSN X)},
PADDRESS = {Berlin},
ADDRESS = {Dortmund, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5199},
ISBN = {978-3-540-87699-1},
DOI = {10.1007/978-3-540-87700-4_65},
YEAR = {2008},
PAGES = {651--660},
}
@UNPUBLISHED{BrownRizkallah2011,
AUTHOR = {Rizkallah, Christine},
TITLE = {Glivenko and Kuroda for Simple Type Theory},
MONTH = {December},
YEAR = {2011},
PAGES = {14},
NOTE = {Submitted},
ABSTRACT = {Glivenko’s theorem states that an arbitrary proposi- tional formula is
classically provable if and only if its double nega- tion is intuitionistically
provable. The result does not extend to full first-order predicate logic, but
does extend to first-order pred- icate logic without the universal quantifier.
A recent paper by Zdanowski shows that Glivenko’s theorem also holds for
second- order propositional logic without the universal quantifier. We prove
that Glivenko’s theorem extends to some versions of simple type theory without
the universal quantifier. Moreover we prove that Kuroda’s negative translation,
which is known to embed clas- sical first-order logic into intuitionistic
first-order logic, extends to the same versions of simple type theory. We also
prove that the Glivenko property fails for simple type theory once a weak form
of functional extensionality is included.},
}
@INPROCEEDINGS{bs-agffgtaas-08,
AUTHOR = {Berberich, Eric and Sagraloff, Michael},
EDITOR = {Haines, Eric and McGuire, Morgan},
TITLE = {A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces},
BOOKTITLE = {Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling},
PADDRESS = {New York, USA},
ADDRESS = {Stony Brook, USA},
PUBLISHER = {ACM},
MONTH = {June},
DOI = {10.1145/1364901.1364925},
YEAR = {2008},
PAGES = {171--182},
ABSTRACT = {We present a generic framework on a set of surfaces $\calS$ in $\R^3$ that
provides their geometric and topological analysis in order to
support various algorithms and applications in computational geometry.
Our implementation follows the generic programming paradigm, i.e.,
to support a certain family of surfaces, we require a small set of types and
some basic operations on them, all collected in a model of the newly presented
{\sc SurfaceTraits\_3} concept.
The framework obtains geometric and topological information on a
non-empty set of surfaces in two steps.
First, important $0$- and $1$-dimensional features are projected onto the
$xy$-plane, obtaining an arrangement $\calA_\calS$ with certain properties.
Second, for each of its components, a sample point is lifted back to $\R^3$
while detecting intersections with the given surfaces.
This idea is similar to Collins' cylindrical algebraic decomposition (cad).
In contrast, we reduce the number of liftings using \cgal's Arrangement\_2
package as a basic tool. Properly instantiated, the framework provides main
functionality required to support the computation of a
Piano Mover's instance. On the other hand, the complexity of the output is
high, and thus, we particularly regard the framework as key ingredient
for querying information on and constructing geometric objects from a small set
of surfaces. Examples are meshing of single surfaces, the computation of
space-curves defined by two surfaces, to compute lower envelopes of surfaces,
or as a basic step to compute an efficient representation of a
three-dimensional arrangement.
We also inspirit the framework in two steps. First, we show that the well-known
family of algebraic surfaces fulfils the framework's requirements.
As robust implementations on these surfaces are lacking these days, we consider
the framework to be an important step to fill this gap.
Second, we instantiate the framework by a fully-fledged model
for special algebraic surfaces, namely quadrics. This instantiation
already supports main tasks demanded from rotational robot motion
planning~\cite{Latom1993}. How to provide a model for algebraic surfaces
of arbitrary degree, is partly discussed in~\cite{bks-exact-08}.},
}
@ARTICLE{bs-agffgtaas-cagd-09,
AUTHOR = {Berberich, Eric and Sagraloff, Michael},
JOURNAL = {Computer Aided Geometric Design (CAGD)},
TITLE = {A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {6},
PUBLISHER = {Elsevier},
MONTH = {August},
VOLUME = {26},
ISBN = {0167-8396},
DOI = {10.1016/j.cagd.2009.03.006},
YEAR = {2009},
PAGES = {627--647},
ABSTRACT = {We present a generic framework on a set of surfaces S in R^3 that provides
their geometric and topological analysis in order to support various algorithms
and applications in computational geometry. Our implementation follows the
generic programming paradigm, that is, to support a certain family of surfaces,
we require a small set of types and some basic operations on them, all
collected in a model of the newly presented SurfaceTraits_3 concept. The
framework obtains geometric and topological information on a non-empty set of
surfaces in two steps. First, important 0- and 1-dimensional features are
projected onto the xy-plane, obtaining an arrangement A"S with certain
properties. Second, for each of its components, a sample point is lifted back
to R^3 while detecting intersections with the given surfaces. For the
projection we rely on Cgal's Arrangement_2 package as basic tool. Anyhow, the
complexity of the output is high, and thus, we particularly regard the
framework as key ingredient for querying information on and constructing
geometric objects from a small set of surfaces. Examples are meshing of single
surfaces, the computation of space-curves defined by two surfaces, to compute
lower envelopes of surfaces, or as a basic step to compute an efficient
representation of a three-dimensional arrangement. We show that the well-known
family of (semi-)algebraic surfaces fulfills the framework's requirements. As
robust implementations on these surfaces are lacking these days, we consider
the framework to be an important step to fill this gap. In particular, we
instantiate the framework by a fully-fledged model for special algebraic
surfaces, namely quadrics. This instantiation already supports main tasks
demanded from rotational robot motion planning, for example, as expected to
compute a Piano Mover's instance.},
}
@INPROCEEDINGS{BS2004,
AUTHOR = {Baswana, Surender and Sen, Sandeep},
TITLE = {Approximate distance oracle for unweighted graphs in Expected O(n²) time},
BOOKTITLE = {Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04)},
PADDRESS = {New York, USA},
ADDRESS = {New Orleans, USA},
PUBLISHER = {ACM},
ISBN = {0-89871-XXX-X},
YEAR = {2004},
PAGES = {271--280},
ABSTRACT = {Let $G=(V,E)$ be an undirected graph on $n$ vertices, and let $\delta(u,v)$
denote the distance in $G$ between two vertices $u$ and $v$. Thorup and Zwick
showed that for any +ve integer $t$, the
graph $G$ can be preprocessed to build a data-structure that can efficiently
report $t$-approximate distance between any pair of vertices. That is, for any
$u,v\in V$, the distance reported $\hat{\delta}(u,v)$ satisfies
\[
\delta(u,v) \le \hat{\delta}(u,v) \le t \delta(u,v)
\]
The remarkable feature of this data-structure is that, for $t>2$,
it occupies sub-quadratic space, i.e., it does not store all-pairs distances
information explicitly, and still can answer
any $t$-approximate distance query in constant time. They named the
data-structure "oracle" because of this feature. Furthermore, the tradeoff
between stretch $t$ and the size of the data-structure is essentially optimal.
In this paper we show that we can actually construct approximate distance
oracles in expected $O(n^2)$ time if the graph is unweighted. One of the new
ideas used in the improved algorithm also leads to the first expected linear
time algorithm for computing an optimal size $(2,1)$-spanner of an unweighted
graph. A $(2,1)$-spanner of a graph $G=(V,E)$ is a subgraph $G=(V,E_S),
E_S\subset E$, such that for any two vertices
$u$ and $v$ in the graph, their distance in the subgraph is at most
$2\delta(u,v)+1$.},
}
@MASTERSTHESIS{Buchheit1999,
AUTHOR = {Buchheit, Thomas},
TITLE = {{Oberfl{\"a}chenrekonstruktion mithilfe von Voronoi-Diagrammen}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {December},
YEAR = {1999},
}
@INPROCEEDINGS{Burkhardt1999/1,
AUTHOR = {Burkhardt, Stefan and Crauser, Andreas and Ferragina, Paolo and Lenhof, Hans-Peter and Rivals, Eric and Vingron, Martin},
EDITOR = {Istrail, Sorin and Pevzner, Pavel and Waterman, Michael},
TITLE = {q-gram Based Database Searching Using a Suffix Array (QUASAR)},
BOOKTITLE = {Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99)},
ORGANIZATION = {Association of Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Lyon, France},
PUBLISHER = {ACM},
MONTH = {April},
ISBN = {1-58113-069-4},
YEAR = {1999},
PAGES = {77--83},
ABSTRACT = { With the increasing amount of DNA sequence information deposited in
our databases searching for similarity to a query sequence
has become a basic operation in molecular biology.
But even todays fast algorithms reach their limits when
applied to all-versus-all comparisons of large databases.
Here we present a new data base searching
algorithm dubbed QUASAR (Q-gram Alignment based on Suffix ARrays)
which was designed to quickly detect sequences with strong
similarity to the query in a context where many searches are
conducted on one database. Our algorithm applies a modification of
$q$-tuple filtering implemented on top of a suffix array. Two
versions were developed, one for a RAM resident suffix array and one
for access to the suffix array on disk. We compared our implementation
with BLAST and found that our approach is an order of magnitude faster.
It is, however, restricted to the search for strongly similar DNA
sequences as is typically required, e.g., in the context of clustering
expressed sequence tags (ESTs).},
}
@INPROCEEDINGS{Burkhardt2001,
AUTHOR = {Burkhardt, Stefan and K{\"a}rkk{\"a}inen, Juha},
EDITOR = {Amir, Amihood and Landau, Gadi},
TITLE = {Better Filtering with Gapped q-Grams},
BOOKTITLE = {Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching},
PADDRESS = {Berlin, Germany},
ADDRESS = {Jerusalem, Israel},
PUBLISHER = {Springer},
MONTH = {July},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2089},
ISBN = {3-540-42271-4},
YEAR = {2001},
PAGES = {73--85},
ABSTRACT = {The q-gram filter is a popular filtering method for approximate
string matching. It compares substrings of length q (the q-grams)
in the pattern and the text to identify the text areas that might
contain a match. A generalization of the method is to use gapped
q-grams, subsets of q characters in some fixed non-contiguous
shape, instead of contiguous substrings. Although mentioned a few
times in the literature, this generalization has never been studied
in any depth. In ths paper, we report the first results from a
study on gapped q-grams. We show that gapped q-grams can provide
orders of magnitude faster and/or more efficient filtering than
contiguous q-grams. The performance, however, depends on the shape
of the q-grams. The best shaoes are rare and often posess no
apparen regularity. We show how to recognize good shapes and
demonstrate with experiments their advantage over both contiguous
and average shapes. We concentrate here on the k mismatches
problem, but also outline an approach for extending the results
to the more common k differences problem.},
}
@INPROCEEDINGS{Burkhardt2002,
AUTHOR = {Burkhardt, Stefan and K{\"a}rkk{\"a}inen, Juha},
EDITOR = {Apostolico, Alberto and Takeda, Masayuki},
TITLE = {One-Gapped q-Gram Filters for {L}evenshtein Distance},
BOOKTITLE = {Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002},
PADDRESS = {Berlin, Germany},
ADDRESS = {Fukuoka, Japan},
PUBLISHER = {Springer},
MONTH = {July},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2373},
ISBN = {3-540-43862-9},
YEAR = {2002},
PAGES = {225--234},
ABSTRACT = {We have recently shown that $q$-gram filters based on gapped $q$-grams
instead of the usual contiguous $q$-grams can provide orders of
magnitude faster and/or more efficient filtering for the Hamming
distance. In this paper, we extend the results for the Levenshtein
distance, which is more problematic for gapped $q$-grams because an
insertion or deletion in a gap affects a $q$-gram while a
replacement does not. To keep this effect under control, we
concentrate on gapped $q$-grams with just one gap. We demostrate with
experiments that the resulting filters provide a significant
improvement over the contiguous $q$-gram filters. We also develop new
techniques for dealing with complex $q$-gram filters.},
}
@INPROCEEDINGS{Burkhardt2003,
AUTHOR = {Burkhardt, Stefan and K{\"a}rkk{\"a}inen, Juha},
EDITOR = {Baeza-Yates, R. and Ch{\'a}vez, E. and Crochemore, M.},
TITLE = {Fast Lightweight Suffix Array Construction and Checking},
BOOKTITLE = {Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003},
PADDRESS = {Heidelberg, Germany},
ADDRESS = {Morelia, Michoac{\'a}n, Mexico},
PUBLISHER = {Springer},
MONTH = {June},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2676},
ISBN = {0302-9743},
YEAR = {2003},
PAGES = {55--69},
ABSTRACT = {We describe an algorithm that, for any $v\in[2,n]$, constructs
the suffix array of a string of length $n$ in $\Oh{vn + n \log
n}$ time using $\Oh{v+n/\sqrt{v}}$ space in addition to the
input (the string) and the output (the suffix array). By setting
$v=\log n$, we obtain an $\Oh{n \log n}$ time algorithm using
$\Oh{n/\sqrt{\log n}}$ extra space. This solves the open problem
stated by Manzini and Ferragina [ESA\;'02] of whether there
exists a lightweight (sublinear extra space) $\Oh{n \log n}$ time
algorithm. The key idea of the algorithm is to first sort a
sample of suffixes chosen using mathematical constructs called
difference covers. The algorithm is not only lightweight but also
fast in practice as demonstrated by experiments. Additionally,
we describe fast and lightweight suffix array checkers, i.e.,
algorithms that check the correctness of a suffix array.},
}
@PHDTHESIS{BurkhardtDiss02,
AUTHOR = {Burkhardt, Stefan},
TITLE = {Filter Algorithms for Approximate String Matching},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
MONTH = {December},
YEAR = {2002},
}
@ARTICLE{BurkhardtKarkkainen2003,
AUTHOR = {Burkhardt, Stefan and K{\"a}rkk{\"a}inen, Juha},
JOURNAL = {Fundamenta Informaticae},
TITLE = {Better Filtering with Gapped q-Grams},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {1-2},
PUBLISHER = {IOS},
VOLUME = {56},
ISBN = {0169-2968},
YEAR = {2003},
PAGES = {51--70},
ABSTRACT = {A popular and well-studied class of filters for approximate string
matching compares substrings of length $q$, \emph{the $q$-grams}, in
the pattern and the text to identify text areas that contain potential
matches. A generalization of the method that uses {\em gapped}
$q$-grams instead of contiguous substrings is mentioned a few times in
literature but has never been analyzed in any depth. In this paper,
we report the first results of a study on gapped $q$-grams. We show
that gapped $q$-grams can provide orders of magnitude faster and/or
more efficient filtering than contiguous $q$-grams. To achieve these
results the arrangement of the gaps in the $q$-gram and a filter
parameter called \emph{threshold} have to be optimized. Both of these
tasks are nontrivial combinatorial optimization problems for which we
present efficient solutions. We concentrate on the $k$~mismatches
problem, i.e, approximate string matching with the Hamming distance.},
}
@PHDTHESIS{Burnikel-Diss96,
AUTHOR = {Burnikel, Christoph},
TITLE = {Exact Computation of Voronoi Diagrams and Line Segment Intersections},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
YEAR = {1996},
}
@INPROCEEDINGS{Burnikel-et-al95,
AUTHOR = {Burnikel, Christoph and K{\"o}nemann, Jochen and Mehlhorn, Kurt and N{\"a}her, Stefan and Schirra, Stefan and Uhrig, Christian},
TITLE = {Exact Geometric Computation in LEDA},
BOOKTITLE = {11th ACM Symposium on Computational Geometry (SCG95)},
PADDRESS = {New York, USA},
ADDRESS = {Vancouver, British Columbia, Canada},
PUBLISHER = {ACM},
ISBN = {0-89791-724-3},
DOI = {10.1145/220279.220330},
YEAR = {1995},
PAGES = {C18--C19},
}
@INPROCEEDINGS{Burnikel-et-al97,
AUTHOR = {Mehlhorn, Kurt and Burnikel, Christoph and Fleischer, Rudolf and Schirra, Stefan},
TITLE = {A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots},
BOOKTITLE = {Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97)},
PADDRESS = {New York, USA},
ADDRESS = {New Orleans, USA},
PUBLISHER = {ACM / SIAM},
YEAR = {1997},
PAGES = {702--709},
}
@ARTICLE{Burnikel2009,
AUTHOR = {Burnikel, Christoph and Funke, Stefan and Mehlhorn, Kurt and Schirra, Stefan and Schmitt, Susanne},
JOURNAL = {Algorithmica},
TITLE = {A Separation Bound for Real Algebraic Expressions},
ADDRESS = {New York, NY},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {55},
ISBN = {0178-4617},
DOI = {10.1007/s00453-007-9132-4},
YEAR = {2009},
PAGES = {14--28},
}
@ARTICLE{BurnikelFunkeSeel2001,
AUTHOR = {Burnikel, Christoph and Funke, Stefan and Seel, Michael},
JOURNAL = {International Journal of Computational Geometry \& Applications},
TITLE = {Exact geometric computation using Cascading},
ADDRESS = {Singapore},
NUMBER = {3},
PUBLISHER = {World Scientific},
VOLUME = {11},
ISBN = {0218-1959},
YEAR = {2001},
PAGES = {245--266},
}
@MASTERSTHESIS{BuschBach2011,
AUTHOR = {Busch, Philip Johannes},
TITLE = {Analysis of the KIT email graph, with an application of randomized rumour spreading protocols},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Bachelor thesis},
ADDRESS = {Saarbr{\"u}cken},
PUBLISHER = {Universit{\"a}t des Saarlandes},
MONTH = {November},
YEAR = {2011},
PAGES = {57},
}
@MASTERSTHESIS{Butz98,
AUTHOR = {Butz, Bernd},
TITLE = {{Robuste Implementierung eines Algorithmus zur Berechnung eines Voronoi-Diagramms f{\"u}r Polygone}},
SCHOOL = {Universitaet des Saarlandes},
TYPE = {Master's thesis},
MONTH = {December},
YEAR = {1997},
}
@ARTICLE{CameronJohannsenPrellbergSchweitzer2008,
AUTHOR = {Cameron, Peter and Johannsen, Daniel and Prellberg, Thomas and Schweitzer, Pascal},
JOURNAL = {Electronic Journal of Combinatorics},
TITLE = {Counting Defective Parking Functions},
NUMBER = {1},
MONTH = {July},
VOLUME = {15},
YEAR = {2008},
PAGES = {R92},
ABSTRACT = {Suppose that $m$ drivers each choose a preferred parking space in a linear car
park with $n$ spaces. Each driver goes to the chosen space and parks there if
it is free, and otherwise takes the first available space with a larger number
(if any). If all drivers park successfully, the sequence of choices is called a
parking function. In general, if $k$ drivers fail to park, we have a
\emph{defective parking function} of \emph{defect} $k$. Let $\cp(n,m,k)$ be the
number of such functions.
In this paper, we establish a recurrence relation for the numbers $\cp(n,m,k)$,
and express this as an equation for a three-variable generating function. We
solve this equation using the kernel method, and extract the coefficients
explicitly: it turns out that the cumulative totals are partial sums in Abel's
binomial identity. Finally, we compute the asymptotics of $\cp(n,m,k)$. In
particular, for the case $m=n$, if choices are made independently at random,
the limiting distribution of the defect (the number of drivers who fail to
park), scaled by the square root of $n$, is the Rayleigh distribution. On the
other hand, in the case $m=\omega(n)$, the probability that all spaces are
occupied tends asymptotically to one.},
}
@INPROCEEDINGS{Canzar2006,
AUTHOR = {Canzar, Stefan and Remy, Jan},
TITLE = {{Shape Distributions and Protein Similarity}},
BOOKTITLE = {GCB},
PADDRESS = {Bonn, Germany},
ADDRESS = {T{\"u}bingen, Germany},
PUBLISHER = {GI},
YEAR = {2006},
PAGES = {1--10},
}
@INPROCEEDINGS{CaragiannisFishkin2007,
AUTHOR = {Caragiannis, Ioannis and Fishkin, Aleksei V. and Kaklamanis, Christos and Papaioannou, Evi},
EDITOR = {Kratochv{\'i}l, Jan and D{\'i}az, Josep and Fiala , Ji{\v{r}}{\'i}},
TITLE = {Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs},
BOOKTITLE = {29th Symposium on Mathematical Foundations of Computer Science MFCS 2004},
PADDRESS = {Amsterdam, The Netherlands},
ADDRESS = {Prague, Czech Republic},
NUMBER = {2},
PUBLISHER = {Elsevier},
MONTH = {January},
SERIES = {Discrete Applied Mathematics},
VOLUME = {155},
DOI = {10.1016/j.dam.2006.04.036},
YEAR = {2007},
PAGES = {119--136},
ABSTRACT = {We study the on-line version of the maximum independent set problem, for the
case of disk graphs which are graphs resulting from intersections of disks on
the plane. In particular, we investigate whether randomization can be used to
break known lower bounds for deterministic on-line independent set algorithms
and present new upper and lower bounds. },
}
@ARTICLE{Caragioannis2007,
AUTHOR = {Caragiannis, Ioannis and Fishkin, Aleksei V. and Kaklamanis, Christos and Papaioannou, Evi},
JOURNAL = {Theoretical Computer Science},
TITLE = {A tight bound for online colouring of disk graphs},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {2/3},
PUBLISHER = {Elsevier},
MONTH = {October},
VOLUME = {384},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2007.04.025},
YEAR = {2007},
PAGES = {152--160},
ABSTRACT = {We present an improved upper bound on the competitiveness of the online
colouring algorithm First-Fit in disk graphs, which are graphs representing
overlaps of disks on the plane. We also show that this bound is best possible
for deterministic online colouring algorithms that do not use the disk
representation of the input graph. We also present a related new lower bound
for unit disk graphs },
}
@MASTERSTHESIS{Caroli07Evaluation,
AUTHOR = {Caroli, Manuel},
TITLE = {Evaluation of a Generic Method for Analyzing Controlled-Perturbation Algorithms},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {March},
YEAR = {2007},
}
@INPROCEEDINGS{Cas-Koe:c:11:StacsEpit,
AUTHOR = {Case, John and K{\"o}tzing, Timo},
EDITOR = {Schwentick, Thomas and D{\"u}rr, Christoph},
TITLE = {Measuring Learning Complexity with Criteria Epitomizers},
BOOKTITLE = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)},
PADDRESS = {Dagstuhl},
ADDRESS = {Dortmund, Germany},
PUBLISHER = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {9},
ISBN = {978-3-939897-25-5},
DOI = {10.4230/LIPIcs.STACS.2011.320},
YEAR = {2011},
PAGES = {320--331},
ABSTRACT = {In prior papers, beginning with the seminal work by Freivalds et al. 1995, the
notion of intrinsic complexity is used to analyze the learning complexity of
sets of functions in a Gold-style learning setting. Herein are pointed out some
weaknesses of this notion. Offered is an alternative based on epitomizing sets
of functions -- sets, which are learnable under a given learning criterion, but
not under other criteria which are not at least as powerful. To capture the
idea of epitomizing sets, new reducibility notions are given based on robust
learning (closure of learning under certain classes of operators). Various
degrees of epitomizing sets are characterized as the sets complete with respect
to corresponding reducibility notions! These characterizations also provide an
easy method for showing sets to be epitomizers, and they are, then, employed to
prove several sets to be epitomizing. Furthermore, a scheme is provided to
generate easily very strong epitomizers for a multitude of learning criteria.
These strong epitomizers are so-called self-learning sets, previously applied
by Case \& Koetzing, 2010. These strong epitomizers can be generated and
employed in a myriad of settings to witness the strict separation in learning
power between the criteria so epitomized and other not as powerful criteria!},
}
@ARTICLE{CaseKoetzing2012:DynMod,
AUTHOR = {Case, John and K{\"o}tzing, Timo},
JOURNAL = {Information and Computation},
TITLE = {Learning secrets interactively. {D}ynamic modeling in inductive inference},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
VOLUME = {220-221},
DOI = {10.1016/j.ic.2012.10.002},
YEAR = {2012},
PAGES = {60--73},
}
@ARTICLE{CaseKoetzing2012:MemLim,
AUTHOR = {Case, John and K{\"o}tzing, Timo},
JOURNAL = {Theoretical Computer Science},
TITLE = {Memory-limited {non-U-shaped} learning with solved open problems},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
MONTH = {February},
VOLUME = {473},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2012.10.010},
YEAR = {2013},
PAGES = {100--123},
}
@ARTICLE{CaseKoetzing2012:PhilTrans,
AUTHOR = {Case, John and K{\"o}tzing, Timo},
JOURNAL = {Philosophical Transaction of the Royal Society A},
TITLE = {Computability-theoretic learning complexity},
ADDRESS = {London},
NUMBER = {1971},
PUBLISHER = {Royal Society},
VOLUME = {370},
DOI = {10.1098/rsta.2011.0320},
YEAR = {2012},
PAGES = {3570--3596},
}
@UNPUBLISHED{category_based_routing_2012,
AUTHOR = {Bringmann, Karl and Mehlhorn, Kurt and Neumann, Adrian},
TITLE = {Remarks on Category-Based Routing in Social Networks},
MONTH = {August},
YEAR = {2012},
PAGES = {21},
}
@INPROCEEDINGS{CCLPS2009,
AUTHOR = {Christodoulou, George and Chung, Christine and Ligett, Katrina and Pyrga, Evangelia and van Stee, Rob},
EDITOR = {Bampis, Evripidis and Jansen, Klaus},
TITLE = {On the price of stability for undirected network design},
BOOKTITLE = {Approximation and Online Algorithms : 7th International Workshop, WAOA 2009},
PADDRESS = {Berlin},
ADDRESS = {Copenhagen, Denmark},
PUBLISHER = {Springer},
MONTH = {June},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5893},
ISBN = {9-783642-12449-5},
DOI = {10.1007/978-3-642-12450-1_8},
YEAR = {2010},
PAGES = {86--97},
ABSTRACT = {We continue the study of the effects of selfish behavior in the
network design problem.
We provide new bounds for the price of stability for network design with
fair cost allocation for undirected graphs. We consider the most general
case, for which the best known upper bound is the Harmonic number
$H_n$, where $n$ is the number of agents,
and the best previously known lower bound is $12/7\approx1.778$.
We present a nontrivial lower bound of $42/23\approx1.8261$.
Furthermore,
we show that for two players, the price of stability is exactly $4/3$, while for
three players it is at least $74/48\approx 1.542$ and at most $1.65$.
These are the first improvements on the bound of $H_n$ for general networks.
In particular, this demonstrates a separation between the price of
stability on undirected graphs and that on directed graphs,
Previously, such a gap was only known for the cases where all players
have a shared source, and for weighted players.},
}
@ARTICLE{CDGKS2009,
AUTHOR = {Chan, T-H. Hubert and Dhamdhere, Kedar and Gupta, Anupam and Kleinberg, Jon and Slivkins, Aleksandrs},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Metric Embeddings with Relaxed Guarantees},
ADDRESS = {Philadelphia, PA},
NUMBER = {6},
PUBLISHER = {SIAM},
MONTH = {March},
VOLUME = {38},
ISBN = {0097-5397},
DOI = {10.1137/060670511},
YEAR = {2009},
PAGES = {2303--2329},
}
@INPROCEEDINGS{CDHMSW12,
AUTHOR = {Chen, Xujin and Doerr, Benjamin and Hu, Xiaodong and Ma, Weidong and van Stee, Rob and Winzen, Carola},
EDITOR = {Goldberg, Paul W.},
TITLE = {The Price of Anarchy for Selfish Ring Routing is Two},
BOOKTITLE = {Internet and Network Economics : 8th International Workshop, WINE 2012},
PADDRESS = {Berlin},
ADDRESS = {Liverpool, UK},
PUBLISHER = {Springer},
MONTH = {December},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7695},
ISBN = {978-3-642-35310-9},
DOI = {10.1007/978-3-642-35311-6_31},
YEAR = {2012},
PAGES = {420--433},
ABSTRACT = {We analyze the network congestion game with atomic players, asymmetric
strategies, and the maximum latency among all players as social cost.
This important social cost function is much less understood than the average
latency.
We show that the price of anarchy is at most two, when the network is a ring
and the link latencies are linear.
Our bound is tight. This is the first sharp
bound for the maximum latency objective.},
}
@MISC{CDoerrSP2006,
AUTHOR = {Cooper, Joshua and Doerr, Benjamin and Spencer, Joel and Tardos, Gabor},
JOURNAL = {???},
TITLE = {Deterministic Random Walks on the Integers},
HOWPUBLISHED = {Internet},
YEAR = {2006},
PAGES = {1--27},
ABSTRACT = {Jim Propp's P-machine, also known as the "rotor router model" is a simple
deterministic process that simulates a random walk on a graph. Instead of
distributing chips to randomly chosen neighbors, it serves the neighbors in a
fixed order.
We investigate how well this process simulates a random walk. For the graph
being the infinite path, we show that, independent of the starting
configuration, at each time and on each vertex, the number of chips on this
vertex deviates from the expected number of chips in the random walk model by
at most a constant c_1, which is approximately 2.29. For intervals of length L,
this improves to a difference of O(log L), for the L_2 average of a contiguous
set of intervals even to O(sqrt{log L}). All these bounds are tight. },
}
@ARTICLE{CDoerrST2007,
AUTHOR = {Cooper, Joshua and Doerr, Benjamin and Spencer, Joel and Tardos, G{\'a}bor},
JOURNAL = {European Journal of Combinatorics},
TITLE = {Deterministic random walks on the integers},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {8},
PUBLISHER = {Elsevier},
VOLUME = {28},
ISBN = {0195-6698},
DOI = {10.1016/j.ejc.2007.04.018},
YEAR = {2007},
PAGES = {2072--2090},
ABSTRACT = {Jim Propp’s P-machine, also known as the ‘rotor router model’, is a simple
deterministic process that simulates a random walk on a graph. Instead of
distributing chips to randomly chosen neighbors, it serves the neighbors in a
fixed order.
We investigate how well this process simulates a random walk. For the graph
being the infinite path, we show that, independent of the starting
configuration, at each time and on each vertex, the number of chips on this
vertex deviates from the expected number of chips in the random walk model by
at most a constant c1, which is approximately 2.29. For intervals of length L,
this improves to a difference of O(logL), for the L2 average of a contiguous
set of intervals even to . All these bounds are tight. },
}
@INPROCEEDINGS{celikikbast2009spire,
AUTHOR = {Celikik, Marjan and Bast, Hannah},
EDITOR = {Karlgren, Jussi and Tarhio, Jorma and Hyyr{\"o}, Heikki},
TITLE = {Fast Single-Pass Construction of a Half-Inverted Index},
BOOKTITLE = {String processing and information retrieval : 16th International Symposium, SPIRE 2009},
ORGANIZATION = {Springer},
PADDRESS = {Berlin, Germany},
ADDRESS = {Saariselk{\"a}, Finland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5721},
ISBN = {978-3-642-03783-2},
DOI = {10.1007/978-3-642-03784-9_19},
YEAR = {2009},
PAGES = {194--205},
}
@UNPUBLISHED{Certifying3EdgeConnectivity2012,
AUTHOR = {Mehlhorn, Kurt and Neumann, Adrian and Schmidt, Jens M.},
TITLE = {Certifying 3-Edge-Connectivity},
MONTH = {November},
YEAR = {2012},
NOTE = {Manuscript},
}
@UNPUBLISHED{CertifyingAlgs,
AUTHOR = {Mehlhorn, Kurt and Eigenwillig, Arno and Kaligosi, Kanela and Kratsch, Dieter and McConnell, Ross and Meyer, Ulrich and Spinrad, Jeremy P.},
TITLE = {Certifying Algorithms (draft)},
YEAR = {2005},
NOTE = {draft},
}
@INPROCEEDINGS{CFGKPR2003,
AUTHOR = {Cheng, Siu-Wing and Funke, Stefan and Golin, Mordecai J. and Kumar, Piyush and Poon, Sheung-Hung and Ramos, Edgar A.},
TITLE = {Curve Reconstruction from Noisy Samples},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03)},
ORGANIZATION = {Association of Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {San Diego, USA},
PUBLISHER = {ACM},
YEAR = {2003},
PAGES = {420--429},
}
@INPROCEEDINGS{CFMMR1999,
AUTHOR = {Crauser, Andreas and Ferragina, Paolo and Mehlhorn, Kurt and Meyer, Ulrich and Ramos, Edgar A.},
EDITOR = {Abello, James M. and Vitter, Jeffrey Scott},
TITLE = {I/O-optimal computation of segment intersections},
BOOKTITLE = {Proceedings of the DIMACS Workshop on External Algorithms and Visualization},
ORGANIZATION = {DIMACS},
PADDRESS = {Providence, USA},
ADDRESS = {New Brunswick, New Jersey},
PUBLISHER = {AMS},
MONTH = {October},
SERIES = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
VOLUME = {50},
ISBN = {0-8218-1184-3},
YEAR = {1999},
PAGES = {131--138},
}
@ARTICLE{CFMMR2001,
AUTHOR = {Crauser, Andreas and Ferragina, Paolo and Mehlhorn, Kurt and Meyer, Ulrich and Ramos, Edgar A.},
JOURNAL = {International Journal of Computational Geometry \& Applications},
TITLE = {Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems},
ADDRESS = {Singapore},
NUMBER = {3},
PUBLISHER = {World Scientific},
MONTH = {June},
VOLUME = {11},
ISBN = {0218-1959},
YEAR = {2001},
PAGES = {305--337},
NOTE = {Special issue edited by J Hershberger: Selected Papers from the
Fourteenth ACM Symposium on Computational Geometry, Minneapolis, MN,
June, 1998},
}
@INPROCEEDINGS{CFMMR98,
AUTHOR = {Crauser, Andreas and Ferragina, Paolo and Mehlhorn, Kurt and Meyer, Ulrich and Ramos, Edgar A.},
TITLE = {Randomized External-Memory Algorithms for some Geometric Problems},
BOOKTITLE = {Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98)},
ORGANIZATION = {ACM},
PADDRESS = {New York, USA},
ADDRESS = {Minneapolis, Minnesota},
PUBLISHER = {ACM},
ISBN = {0-89791-973-4},
YEAR = {1998},
PAGES = {259--268},
}
@UNKNOWN{cgal-manual-2001,
AUTHOR = {B{\"a}sken, Matthias and Br{\"o}nnimann, Herv{\'e} and Frank, Da and Devillers, Olivier and Ester, Ezra and Fabri, Andreas and Flato, Eyal and G{\"a}rtner, Bernd and Giezeman, Geert-Jan and Halperin, Dan and Hanniel, Iddo and Har-Peled, Sariel and Herrmann, Thomas and Hert, Susan and Hirsch, Shai and Hoffmann, Michael and Kettner, Lutz and Nechushtan, Oren and Neyer, Gabriele and Pasechnik, Dmitrii and Pion, Sylvain and Schirra, Stefan and Sch{\"o}nherr, Sven and Seel, Michael and Teillaud, Monique and Veltkamp, Remco and Wein, Ron and Wesselink, Wieger and Yvinec, Mariette},
TITLE = {CGAL Reference and User Manuals},
ADDRESS = {-},
PUBLISHER = {CGAL Consortium},
EDITION = {2.3},
MONTH = {August},
YEAR = {2001},
}
@INPROCEEDINGS{CGP2007,
AUTHOR = {Christodoulou, George and Gourves, Laurent and Pascual, Fanny},
EDITOR = {Lin, Guohui},
TITLE = {Scheduling Selfish Tasks: {About} the Performance of Truthful Algorithms},
BOOKTITLE = {Computing and Combinatorics : 13th Annual International Conference, COCOON 2007},
PADDRESS = {Berlin, Germany},
ADDRESS = {Banff, Canada},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4598},
ISBN = {3-540-73544-1},
DOI = {0.1007/978-3-540-73545-8_20},
YEAR = {2007},
PAGES = {187--197},
}
@INPROCEEDINGS{Chan2008,
AUTHOR = {Bansal, Nikhil and Chan, Ho-Leung},
EDITOR = {Mathieu, Claire},
TITLE = {Weighted flow time does not admit O(1)-competitive algorithms},
BOOKTITLE = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009)},
ORGANIZATION = {ACM-SIAM},
PADDRESS = {New York, NY},
ADDRESS = {New York, USA},
PUBLISHER = {ACM},
YEAR = {2009},
PAGES = {1238--1244},
ABSTRACT = {We consider the classic online scheduling problem of minimizing the total
weighted flow time on a single machine
with preemptions. Here, each job $j$ has an arbitrary arrival time $r_j$,
weight $w_j$ and size $p_j$, and given a schedule its
flow time is defined as the duration of time since its arrival until it
completes its service requirement.
The first non-trivial algorithms with poly-logarithmic competitive ratio for
this problem were obtained relatively recently,
and it was widely believed that the problem admits a constant factor
competitive algorithm. In this paper, we show an $\omega(1)$ lower bound on the
competitive ratio of any deterministic online algorithm.
Our result is based on a gap amplification technique for online algorithms.
Starting with a trivial lower bound of 1, we give a procedure to improve the
lower bound sequentially, while ensuring at each step that the size of the
instance increases relatively modestly. },
}
@INPROCEEDINGS{Chan2008b,
AUTHOR = {Bansal, Nikhil and Chan, Ho-Leung and Pruhs, Kirk},
EDITOR = {Mathieu, Claire},
TITLE = {Speed Scaling with an Arbitrary Power Function},
BOOKTITLE = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009)},
ORGANIZATION = {ACM-SIAM},
PADDRESS = {New York, NY},
ADDRESS = {New York, USA},
PUBLISHER = {ACM},
YEAR = {2009},
PAGES = {693--701},
ABSTRACT = {All of the theoretical speed scaling research to date has assumed that the
power function, which expresses the power consumption $P$ as a function
of the processor speed $s$,
is of the form $P=s^\alpha$, where $\alpha > 1$ is some constant.
Motivated in part by technological advances,
we initiate a study of speed scaling with arbitrary
power functions.
We consider the problem of minimizing the total flow plus energy.
Our main result is a $(3+\epsilon)$-competitive algorithm for this problem,
that holds
for essentially any power function.
We also give a $(2+\epsilon)$-competitive algorithm for the objective of
fractional weighted flow plus energy.
Even for power functions of the form $s^\alpha$, it was not previously
known how to obtain competitiveness independent of $\alpha$ for
these problems.
We also introduce a model of allowable speeds that generalizes
all known models in the literature.},
}
@INPROCEEDINGS{Chan2008c,
AUTHOR = {Chan, Ho-Leung and Edmonds, Jeff and Lam, Tak-Wah and Lee, Lap-Kei and Marchetti-Spaccamela, Alberto and Pruhs, Kirk},
EDITOR = {Albers, Susanne and Marion, Jean-Yves},
TITLE = {Nonclairvoyant Speed Scaling for Flow and Energy},
BOOKTITLE = {Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS)},
PADDRESS = {Dagstuhl, Germany},
ADDRESS = {Freiburg, Germany},
PUBLISHER = {LZI},
SERIES = {Leibniz International Proceedings in Informatics},
VOLUME = {3},
ISBN = {978-3-939897-09-5},
DOI = {10.4230/LIPIcs.STACS.2009.1815},
YEAR = {2009},
PAGES = {255--264},
ABSTRACT = {We study online nonclairvoyant speed scaling to minimize
total flow time plus energy. We first consider the traditional
model where the power function is $P(s)=s^\alpha$.
We give a nonclairvoyant algorithm that is shown to be $O( \alpha^3
)$-competitive.
We then show an
$\Omega( \alpha^{1/3-\epsilon} )$ lower bound on the competitive
ratio of any nonclairvoyant algorithm.
We also show that there
are power functions for which no nonclairvoyant algorithm can be
$O(1)$-competitive.},
}
@ARTICLE{Chan2011,
AUTHOR = {Bansal, Nikhil and Chan, Ho-Leung and Pruhs, KIrk},
JOURNAL = {Algorithmica},
TITLE = {Competitive Algorithms for Due Date Schedulin},
ADDRESS = {Berlin},
NUMBER = {4},
PUBLISHER = {Springer},
VOLUME = {59},
ISBN = {0178-4617},
DOI = {10.1007/s00453-009-9321-4},
YEAR = {2011},
PAGES = {569--582},
}
@TECHREPORT{ChandranSivadasan2004,
AUTHOR = {Chandran, L. Sunil and Sivadasan, Naveen},
TITLE = {On the Hadwiger's Conjecture for Graph Products},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
TYPE = {Research Report},
ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-2004-1-006},
PUBLISHER = {AG 1 - Mehlhorn},
ISBN = {0946-011X},
YEAR = {2004},
PAGES = {12},
ABSTRACT = {The Hadwiger number m(G) of a graph G is the
largest integer h such that the complete graph on h nodes is a minor
of G. Equivalently, it is the largest integer such
that any graph on at most m(G) nodes is a minor of G.
The Hadwiger's conjecture states that for any graph G, m(G) >= chi(G),
where
chi(G) is the chromatic number of G. It is well-known
that for any connected undirected graph G, there exists a unique prime
factorization with respect to Cartesian graph products.
If the unique prime factorization of G is given as
G1 X G2 X ... X Gk, where each Gi is prime,
then we say that the product dimension of G is k.
Such a factorization can be computed efficiently.
In this paper, we study the Hadwiger's conjecture for graphs in terms
of their prime factorization.
We show that the Hadwiger's conjecture is true for a graph G if
the product dimension of G is at least 2log(chi(G)) + 3.
In fact, it is enough for G to have a connected graph M as a minor
whose product dimension is at
least 2log(chi(G)) + 3, for G to satisfy the Hadwiger's conjecture.
We show also that
if a graph G is isomorphic to F^d for some F, then
mr(G) >= chi(G)^{\lfloor \frac{d-1}{2} \rfloor}, and thus
G satisfies the Hadwiger's conjecture when d >= 3.
For sufficiently large d, our lower bound is exponentially higher
than what is implied by the Hadwiger's conjecture.
Our approach also yields (almost) sharp lower bounds for the
Hadwiger number of well-known graph products like d--dimensional hypercubes,
Hamming graphs and the d--dimensional grids. In particular, we show that
for a d--dimensional hypercube Hd,
$2^{\lfloor\frac{d-1}{2}\rfloor} <= m(Hd) <= 2^{\frac{d}{2}}\sqrt{d} +1$.
We also derive similar bounds for G^d for almost all
G with n nodes and at least nlog(n) edges.},
}
@INPROCEEDINGS{Chang2006,
AUTHOR = {Chang, Kevin L. and Kannan, Ravi},
TITLE = {The Space Complexity of Pass-Efficient Algorithms for Clustering},
BOOKTITLE = {Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06},
PADDRESS = {New York, USA},
ADDRESS = {Miami, USA},
PUBLISHER = {ACM / Siam},
MONTH = {January},
ISBN = {0-89871-605-5},
YEAR = {2006},
PAGES = {1157--1166},
NOTE = {This is the conference version. Full version under submission to journal.},
ABSTRACT = {We present multiple pass streaming algorithms for a basic clustering problem
for massive data sets. If our algorithm is allotted 2l passes, it will produce
an approximation with error at most $\varepsilon$ using Õ(k3/$\varepsilon$2/l) bits of memory, the most
critical resource for streaming computation. We demonstrate that this tradeoff
between passes and memory allotted is intrinsic to the problem and model of
computation by proving lower bounds on the memory requirements of any l pass
randomized algorithm that are nearly matched by our upper bounds. To the best
of our knowledge, this is the first time nearly matching bounds have been
proved for such an exponential tradeoff for randomized computation.In this
problem, we are given a set of n points drawn randomly according to a mixture
of k uniform distributions and wish to approximate the density function of the
mixture. The points are placed in a datastream (possibly in adversarial order),
which may only be read sequentially by the algorithm. We argue that this
models, among others, the datastream produced by a national census of the
incomes of all citizens.},
}
@INPROCEEDINGS{Chang2007,
AUTHOR = {Chang, Kevin},
TITLE = {Multiple pass streaming algorithms for learning mixtures of distributions in $R^d$},
BOOKTITLE = {Algorithmic Learning Theory, 18th International Conference, Proceedings},
TYPE = {Extended Abstract},
PADDRESS = {Berlin},
ADDRESS = {Sendai, Japan},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Artifical intelligence},
VOLUME = {4754},
YEAR = {2007},
PAGES = {16},
NOTE = {This is an extended abstract. Full version has been submitted to a journal. },
ABSTRACT = {We present a multiple pass streaming algorithm
for learning the density function of
a mixture of $k$ uniform distributions
over rectangles (cells) in $\reals^d$, for any $d>0$.
Our learning model is: samples drawn according to
the mixture are placed in {\it arbitrary order} in a
data stream that may only be accessed sequentially by an
algorithm with a very limited random access memory space.
Our algorithm makes $2\ell+1$ passes, for any $\ell>0$, and
requires memory at most $\tilde O(\epsilon^{-2/\ell}k^2d^4+(2k)^d)$.
This exhibits a
strong memory-space tradeoff: a few more passes significantly
lowers its memory requirements, thus trading one of the two most important
resources in streaming computation for the other.
Chang and Kannan \cite{chang06}
first considered this problem for $d=1, 2$.
Our learning algorithm is
especially appropriate for situations where massive data sets of
samples are available, but practical computation with such
large inputs requires very restricted models of computation.},
}
@INPROCEEDINGS{Chang2008a,
AUTHOR = {Chang, Kevin and Johnson, Aaron},
TITLE = {Online and offline selling in limit order markets},
BOOKTITLE = {4th International Workshop on Internet and Network Economics (WINE 2008)},
PADDRESS = {Berlin},
ADDRESS = {Shanghai, China},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5385},
YEAR = {2008},
PAGES = {41--52},
ABSTRACT = {Completely automated electronic securities exchanges
and algorithms for trading in these exchanges have become
very important for modern finance. In \cite{kkmo04},
Kakade \etal introduced the limit order market model,
which is a prevalent paradigm in electronic markets.
In this paper, we consider both online and offline algorithms
for selling securities in limit order markets in order to
maximize the total revenue realized from the sale. We first
prove that the standard reservation price algorithm has an
optimal competitive ratio for this problem. Since this is
not constant, we turn to offline optimization in order to
compute improved solutions. We show that the offline
optimization problem is \textbf{NP}-hard, even for very restricted
instances, by reducing from \knapsack. We complement the
hardness result by presenting an approximation scheme
that runs in polynomial time for a wide class of instances.},
}
@ARTICLE{ChanGupta2009,
AUTHOR = {Chan, T.-H. Hubert and Gupta, Anupam},
JOURNAL = {Discrete and Computational Geometry},
TITLE = {Small Hop-diameter Sparse Spanners for Doubling Metrics},
ADDRESS = {New York, NY},
NUMBER = {1},
PUBLISHER = {Springer},
MONTH = {January},
VOLUME = {41},
ISBN = {0179-5376},
DOI = {10.1007/s00454-008-9115-5},
YEAR = {2009},
PAGES = {28--44},
ABSTRACT = { Given a metric $M = (V,d)$, a graph $G = (V,E)$ is a $t$-spanner for $M$
if every pair of nodes in $V$ has a ``short'' path (i.e., of length at
most $t$ times their actual distance) between them in the spanner.
Furthermore, this spanner has a \emph{hop diameter} bounded by $D$ if
every pair of nodes has such a short path that also uses at most $D$ edges.
We consider the problem
of constructing sparse $(1+\eps)$-spanners with small hop diameter for
metrics of low doubling dimension.
In this paper, we show that given any metric with constant doubling
dimension $k$, and any $0 < \eps < 1$, one can find $(1 +
\eps)$-spanner for the metric with nearly linear number of edges (i.e.,
only $O(n \log^* n + n\eps^{-O(k)})$ edges) and \emph{constant} hop
diameter; we can also obtain a $(1 + \eps)$-spanner with linear number of
edges
(i.e., only $n\eps^{-O(k)}$ edges) that achieves a hop diameter that
grows like the functional inverse of Ackermann's function.
Moreover, we prove that such tradeoffs between the number of edges and
the hop diameter are asymptotically optimal.},
}
@INPROCEEDINGS{ChanSPAA2009,
AUTHOR = {Chan, Ho-Leung and Edmonds, Jeff and Pruhs, Kirk},
TITLE = {Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor},
BOOKTITLE = {SPAA'09 : proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures},
PADDRESS = {New York, NY},
ADDRESS = {Calgary, Canada},
PUBLISHER = {ACM},
ISBN = {978-1-60558-606-9},
DOI = {10.1145/1583991.1583994},
YEAR = {2009},
PAGES = {1--10},
}
@ARTICLE{Chaudhuri-Radhakrishnan97,
AUTHOR = {Chaudhuri, Shiva and Radhakrishnan, Jaikumar},
JOURNAL = {Information and Computation},
TITLE = {The Complexity of Parallel Prefix Problems on Small Domains},
NUMBER = {1},
VOLUME = {138},
YEAR = {1997},
PAGES = {1--22},
}
@ARTICLE{Chaudhuri-Zaroliagis-2-97,
AUTHOR = {Chaudhuri, Shiva and Zaroliagis, Christos},
JOURNAL = {Theoretical Computer Science},
TITLE = {Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms},
NUMBER = {2},
VOLUME = {203},
ISBN = {0304-3975},
YEAR = {1998},
PAGES = {205--223},
NOTE = {Special issue on ESA'95},
ABSTRACT = {We consider the problem of preprocessing an $n$-vertex digraph with
real edge weights so that subsequent queries for the shortest path or distance
between any two vertices can be efficiently answered.
We give parallel algorithms for the EREW PRAM model of computation
that depend on the {\em treewidth} of
the input graph. When the treewidth is a constant, our algorithms
can answer distance queries in $O(\alpha(n))$ time using a single
processor, after a preprocessing of $O(\log^2n)$ time and $O(n)$ work,
where $\alpha(n)$ is the inverse of Ackermann's function.
The class of constant treewidth graphs
contains outerplanar graphs and series-parallel graphs, among
others. To the best of our knowledge, these
are the first parallel algorithms which achieve these bounds
for any class of graphs except trees.
We also give a dynamic algorithm which, after a change in
an edge weight, updates our data structures in $O(\log n)$ time
using $O(n^\beta)$ work, for any constant $0 < \beta < 1$.
Moreover, we give an algorithm of independent interest:
computing a shortest path tree, or finding a negative cycle in
$O(\log^2 n)$ time using $O(n)$ work.},
}
@ARTICLE{Chaudhuri-Zaroliagis-96,
AUTHOR = {Chaudhuri, Shiva and Dimopoulos, Yannis and Zaroliagis, Christos},
JOURNAL = {Parallel Processing Letters},
TITLE = {On the Parallel Complexity of Acyclic Logic Programs},
NUMBER = {2},
VOLUME = {6},
YEAR = {1996},
PAGES = {223--230},
}
@ARTICLE{Chaudhuri96,
AUTHOR = {Chaudhuri, Shiva},
JOURNAL = {Information and Computation},
TITLE = {Sensitive functions and approximate problems},
PUBLISHER = {Academic Press},
VOLUME = {126},
ISBN = {0890-5401},
YEAR = {1996},
PAGES = {161--168},
}
@ARTICLE{ChaudhuriDubhashi97,
AUTHOR = {Chaudhuri, Shiva and Dubhashi, Devdatt},
JOURNAL = {Theoretical Computer Science},
TITLE = {Probabilistic recurrence relations revisited},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {1},
PUBLISHER = {Elsevier},
VOLUME = {181},
YEAR = {1997},
PAGES = {45--56},
}
@ARTICLE{ChaudhuriGargRavi,
AUTHOR = {Chaudhuri, Shiva and Garg, Naveen and Ravi, R.},
JOURNAL = {Information Processing Letters},
TITLE = {The $p$-neighbor $k$-center problem},
PUBLISHER = {Elsevier},
VOLUME = {65},
ISBN = {0020-0190},
YEAR = {1998},
PAGES = {131--134},
}
@INPROCEEDINGS{ChaudhuriRadhakrishnan96,
AUTHOR = {Chaudhuri, Shiva and Radhakrishnan, Jaikumar},
TITLE = {Deterministic restrictions in circuit complexity},
BOOKTITLE = {Theory of Computing : 28th Annual ACM Symposium (STOC-28)},
PADDRESS = {New York},
ADDRESS = {Philadelphia, PA, USA},
PUBLISHER = {ACM Press},
ISBN = {0-89791-785-5},
YEAR = {1996},
PAGES = {30--36},
}
@ARTICLE{ChaudhuriSubrahmanyamWagnerZaroliagis2000,
AUTHOR = {Chaudhuri, Shiva and Subrahmanyam, K. V. and Wagner, Frank and Zaroliagis, Christos},
JOURNAL = {Algorithmica},
TITLE = {Computing mimicking networks},
ADDRESS = {New York, USA},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {26},
ISBN = {0178-4617},
YEAR = {2000},
PAGES = {31--49},
ABSTRACT = {A mimicking network for a k -terminal network, N , is one whose realizable
external flows are the same as those of N . Let S(k) denote the minimum size of
a mimicking network for a k-terminal network. In this paper we give new
constructions of mimicking networks and prove the following results (the values
in brackets are the previously best known results): S(4)=5 [216] , S(5)=6 [232]
. For bounded treewidth networks we show S(k)= O(k) [2^ 2k ] , and for
outerplanar networks we show S(k) $\leq$ 10k-6 [k22k+2] .},
}
@ARTICLE{ChaudhuriZaroliagis2000,
AUTHOR = {Chaudhuri, Shiva and Zaroliagis, Christos},
JOURNAL = {Algorithmica},
TITLE = {Shortest paths in digraphs of small treewidth. {Part} I, {Sequential} algorithms},
ADDRESS = {New York, USA},
NUMBER = {3/4},
PUBLISHER = {Springer},
VOLUME = {27},
ISBN = {0178-4617},
YEAR = {2000},
PAGES = {212--226},
ABSTRACT = {We consider the problem of preprocessing an n -vertex digraph with real edge
weights so that subsequent queries for the shortest path or distance between
any two vertices can be efficiently answered. We give algorithms that depend
on the treewidth of the input graph. When the treewidth is a constant, our
algorithms can answer distance queries in O(\α(n)) time after O(n)
preprocessing. This improves upon previously known results for the same
problem. We also give a dynamic algorithm which, after a change in an edge
weight, updates the data structure in time O(n\β) , for any
constant 0 < \β < 1 . Furthermore, an algorithm of independent interest is
given: computing a shortest path tree, or finding a negative cycle in linear
time. },
}
@INPROCEEDINGS{Chauduri-Subrahmanyam-Wagner-Zaroliagis-98,
AUTHOR = {Chaudhuri, Shiva and Subrahmanyam, K. V. and Wagner, Frank and Zaroliagis, Christos},
EDITOR = {Larsen, Kim G. and Skyum, Sven and Winskel, Glynn},
TITLE = {Computing Mimicking Networks},
BOOKTITLE = {Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Aalborg, Denmark},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1443},
YEAR = {1998},
PAGES = {556--567},
ABSTRACT = {A {\em mimicking network} for a $k$-terminal network, $N$, is one
whose realizable external flows are the same as those of $N$. Let
$S(k)$ denote the minimum size of a mimicking network for a
$k$-terminal network. In this paper we give new constructions
of mimicking networks and prove the following results (the values in
brackets are the previously best known results): $S(4)=5~[2^{16}]$,
$S(5)=6~[2^{32}]$. For bounded treewidth networks we show $S(k)=
O(k)~[2^{2^{k}}]$, and for outerplanar networks we show
$S(k) \leq 10k-6~[k^22^{k+2}]$.},
}
@INPROCEEDINGS{Chen-Das-Smid96,
AUTHOR = {Chen, Danny Z. and Das, Gautam and Smid, Michiel},
TITLE = {Lower bounds for computing geometric spanners and approximate shortest paths},
BOOKTITLE = {8th Canadian Conference on Computing},
PADDRESS = {-},
ADDRESS = {Ottawa, Canada},
PUBLISHER = {Carleton},
YEAR = {1996},
PAGES = {155--160},
}
@ARTICLE{ChEpKS13,
AUTHOR = {Chen, Xujin and Epstein, Leah and Kleiman, Elena and van Stee, Rob},
JOURNAL = {Theoretical Computer Science},
TITLE = {Maximizing the minimum load: The cost of selfishness},
PUBLISHER = {Elsevier},
MONTH = {April},
VOLUME = {482},
ISBN = {0304-3975},
YEAR = {2013},
PAGES = {9--19},
ABSTRACT = {We consider a scheduling problem where each job is controlled by a
selfish agent, who is only interested in minimizing its own cost,
defined as the total load of the machine that its job is assigned
to. We consider the objective of maximizing the minimum load (the
value of the cover) over the machines. Unlike the regular makespan
minimization problem, which was extensively studied in a game
theoretic context, this problem has not been considered in this
setting before.
We study the price of anarchy (\poa) and the price of stability
(\pos). These measures are unbounded already for two uniformly
related machines \cite{EpKS10}, and therefore we focus on
identical machines. We show that the $\pos$ is 1, and derive tight
bounds on the pure $\poa$ for $m\leq 7$ and on the overall pure
$\poa$, showing that its value is exactly 1.7. To achieve the
upper bound of 1.7, we make an unusual use of weighting functions.
Finally, we show that the mixed $\poa$ grows exponentially with
$m$ for this problem.
In addition, we consider a similar setting of selfish jobs with a
different objective of minimizing the maximum ratio between the
loads of any pair of machines in the schedule. We show that under
this objective the $\pos$ is 1 and the pure $\poa$ is 2, for any
$m\geq 2$.},
}
@ARTICLE{Cheriyan-Hagerup-Mehlhorn96,
AUTHOR = {Cheriyan, Joseph and Hagerup, Torben and Mehlhorn, Kurt},
JOURNAL = {SIAM Journal on Computing},
TITLE = {An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?},
NUMBER = {6},
PUBLISHER = {SIAM},
VOLUME = {25},
ISBN = {0097-5397},
YEAR = {1996},
PAGES = {1144--1170},
}
@ARTICLE{Cheriyan-Hagerup95,
AUTHOR = {Cheriyan, Joseph and Hagerup, Torben},
JOURNAL = {SIAM Journal on Computing},
TITLE = {A Randomized Maximum-Flow Algorithm},
NUMBER = {2},
PUBLISHER = {Society for Industrial and Applied Mathematics},
VOLUME = {24},
ISBN = {0097-5397},
YEAR = {1995},
PAGES = {203--226},
}
@ARTICLE{Cheriyan-Mehlhorn96,
AUTHOR = {Cheriyan, Joseph and Mehlhorn, Kurt},
JOURNAL = {Algorithmica},
TITLE = {{Algorithms for Dense Graphs and Networks on the Random Access Computer}},
NUMBER = {5},
PUBLISHER = {Springer},
VOLUME = {15},
ISBN = {0178-4617},
YEAR = {1996},
PAGES = {521--549},
}
@ARTICLE{Cheriyan-Mehlhorn99,
AUTHOR = {Cheriyan, Joseph and Mehlhorn, Kurt},
JOURNAL = {Information Processing Letters},
TITLE = {An analysis of the highest-level selection rule in the preflow-push max-flow algorithm},
NUMBER = {5},
PUBLISHER = {Elsevier},
VOLUME = {69},
DOI = {10.1016/S0020-0190(99)00019-8},
YEAR = {1999},
PAGES = {239--242},
ABSTRACT = {Consider the problem of finding a maximum flow in a network. Goldberg and
Tarjan introduced the preflow-push method for solving this problem. When this
method is implemented with the highest-level selection rule, then both the
running time and the number of pushes are known to be , where n is the number
of nodes and m is the number of edges. We give a new proof based on a potential
function argument. Potential function arguments may be preferable for analyzing
preflow-push algorithms, since they are simple and generic.},
}
@ARTICLE{Ching:1990:DDD,
AUTHOR = {Ching, Yu-Tai and Mehlhorn, Kurt and Smid, Michiel H. M.},
JOURNAL = {Information Processing Letters},
TITLE = {Dynamic deferred data structuring},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {1},
PUBLISHER = {Elsevier},
VOLUME = {35},
ISBN = {0020-0190},
YEAR = {1990},
PAGES = {37--40},
}
@INPROCEEDINGS{ChKoSt10,
AUTHOR = {Christodoulou, George and Kovacs, Annamaria and van Stee, Rob},
EDITOR = {Saberi, Amin},
TITLE = {A truthful constant approximation for maximizing the minimum load on related machines},
BOOKTITLE = {Internet and Network Economics : 6th International Workshop, WINE 2010},
PADDRESS = {Berlin},
ADDRESS = {Stanford, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6484},
ISBN = {978-3-642-17571-8},
DOI = {10.1007/978-3-642-17572-5_15},
YEAR = {2010},
PAGES = {182--193},
ABSTRACT = {Designing truthful mechanisms for scheduling on related machines is a very
important problem in single-parameter mechanism design. We consider the
covering objective, that is we are
interested in maximizing the minimum completion time of a
machine. This problem falls into the class of problems where the
optimal allocation can be truthfully implemented. A major open issue for
this class is whether truthfulness affects the polynomial-time implementation.
We provide the first
constant factor approxi\-mation for deterministic truthful mechanisms.
In particular we come up with a $2+\eps$ approximation guarantee,
significantly improving on the previous upper bound of
$\min(m,(2+\eps)s_m/s_1)$.},
}
@ARTICLE{ChKoSt2013,
AUTHOR = {Christodoulou, George and Kovacs, Annamaria and van Stee, Rob},
JOURNAL = {Theoretical Computer Science},
TITLE = {A truthful constant approximation for maximizing the minimum load on related machines},
PUBLISHER = {Elsevier},
MONTH = {June},
VOLUME = {489-490},
ISBN = {0304-3975},
YEAR = {2013},
PAGES = {88--98},
ABSTRACT = {Designing truthful mechanisms for scheduling on related machines is a very
important problem in single-parameter mechanism design. We consider the
covering objective, that is we are
interested in maximizing the minimum completion time of a
machine. This problem falls into the class of problems where the
optimal allocation can be truthfully implemented. A major open issue for
this class is whether truthfulness affects the polynomial-time implementation.
We provide the first
constant factor approxi\-mation for deterministic truthful mechanisms.
In particular we come up with a approximation guarantee of $2+\eps$,
significantly improving on the previous upper bound of
$\min(m,(2+\eps)s_m/s_1)$.},
}
@INPROCEEDINGS{ChlebusCzumajSibeyn97,
AUTHOR = {Chlebus, Bogdan S. and Czumaj, Artur and Sibeyn, Jop F.},
EDITOR = {Lengauer, Christian and Griebl, Martin and Gorlatch, Sergei},
TITLE = {Routing on the PADAM: Degrees of Optimality},
BOOKTITLE = {Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97)},
PADDRESS = {Berlin},
ADDRESS = {Passau, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1300},
YEAR = {1997},
PAGES = {272--279},
ABSTRACT = { Routing problems are studied for the Parallel Alternating-Direction
Access Machine.
The goal is to investigate what level of
optimality can be achieved depending on loads of packets per memory unit.
In the case of typical moderate loads, our algorithms are optimal
to within a small multiplicative constant; a deterministic and a
randomized algorithm are developed,
both faster than the best previously known routing algorithm.
Moreover, for sufficiently large loads, an algorithm which misses optimality
by only an additive lower-order term is designed.
We consider also off-line routing problems, and multidimensional
extension of the model.},
}
@ARTICLE{ChMeSS12,
AUTHOR = {Chan, Ho-Leung and Megow, Nicole and Sitters, Ren{\'e} and van Stee, Rob},
JOURNAL = {Theoretical Computer Science},
TITLE = {A note on sorting buffers offline},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
MONTH = {March},
VOLUME = {423},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2011.12.077},
YEAR = {2012},
PAGES = {11--18},
ABSTRACT = { We consider the offline sorting buffer problem. The input is a
sequence of items of different types. All items must be processed
one by one by a server. The server is equipped with a random-access
buffer of limited capacity which can be used to rearrange items. The
problem is to design a scheduling strategy that decides upon the
order in which items from the buffer are sent to the server. Each
type change incurs unit cost, and thus, the
objective is to minimize the total number of type changes for
serving the entire sequence. This problem is motivated by various
applications in manufacturing processes and computer science, and it
has attracted significant attention in the last few years. The main
focus has been on online competitive algorithms. Surprisingly little
is known on the basic offline problem.
In this paper, we show that the sorting buffer problem with
uniform cost is NP-hard and, thus, close one of the most fundamental
questions for the offline problem. On the positive side, we give
an~$O(1)$-approximation algorithm when the scheduler is given a
buffer only slightly larger than double the original size.
We also give a dynamic programming algorithm for the special case of
buffer size two that solves the problem exactly in linear time,
improving on the standard DP which runs in cubic time.},
}
@INPROCEEDINGS{Chong-1-96,
AUTHOR = {Chong, Ka Wong},
TITLE = {Finding minimum spanning trees on the EREW PRAM},
BOOKTITLE = {International Computer Symposium},
PADDRESS = {-},
ADDRESS = {Taiwan},
PUBLISHER = {-},
YEAR = {1996},
PAGES = {7--14},
}
@INPROCEEDINGS{Chong-Lam96,
AUTHOR = {Chong, Ka Wong and Lam, Tak Wah},
TITLE = {Towards more precise parallel biconnectivity approximation},
BOOKTITLE = {7th Annual International Symposium on Algorithms and Computation},
PADDRESS = {-},
ADDRESS = {Osaka},
PUBLISHER = {-},
YEAR = {1996},
PAGES = {223--232},
}
@INPROCEEDINGS{Chong-Ramos1998,
AUTHOR = {Chong, Ka Wong and Ramos, Edgar A.},
EDITOR = {Bilardi, Gianfranco and Italiano, Giuseppe F. and Pietracaprina, Andrea and Pucci, Geppino},
TITLE = {Improved deterministic parallel padded sorting},
BOOKTITLE = {Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Venice, Italy},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1461},
ISBN = {3-540-64848-8},
YEAR = {1998},
PAGES = {405--416},
ABSTRACT = {Given an input array of $n$ real numbers, sorting with padding
$\lambda$ consists in writing those numbers in order in an array of
size $(1+\lambda)n$, thus leaving $\lambda n$ entries {\em empty}.
Only comparisons are allowed between the numbers to be sorted. We
describe an algorithm that, with $nk$ processors in the CRCW PRAM
model, sorts the input array with padding $o(1)$ using time
$
O(\log_k n \log^*(\log_k n)+\loglog k)
$.
This improves a previous algorithm %by Hagerup and Raman %\cite{HaRa93}
with time bound %(after an improvement in \cite{GoZw95})
$
O(\log_k n $ $(\loglog k)^3\cdot 2^{C(\log^* n-\log^*k)})
$.
The best known lower bound is $\Omega(\log_k n)$.},
}
@ARTICLE{Chong1998,
AUTHOR = {Chong, Ka Wong and Lam, Tak Wah},
JOURNAL = {Algorithmica},
TITLE = {Approximating Biconnectivity in Parallel},
PUBLISHER = {Springer},
VOLUME = {21},
ISBN = {0178-4617},
YEAR = {1998},
PAGES = {395--410},
}
@INCOLLECTION{Christodoulou2008,
AUTHOR = {Christodoulou, George},
EDITOR = {Kao, Ming-Yang},
TITLE = {Price of Anarchy},
BOOKTITLE = {Encyclopedia of Algorithms},
ADDRESS = {New York},
PUBLISHER = {Springer US},
MONTH = {June},
YEAR = {2008},
PAGES = {1--99},
}
@INPROCEEDINGS{ChristodoulouKavacs2010,
AUTHOR = {Christodoulou, George and Kov{\'a}cs, Annam{\'a}ria},
EDITOR = {Charikar, Moses},
TITLE = {A deterministic truthful {PTAS} for scheduling related machines},
BOOKTITLE = {21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010)},
PADDRESS = {Philadelphia, Pa.},
ADDRESS = {Austin, Tx., USA},
PUBLISHER = {SIAM},
ISBN = {978-0-898716-98-6},
YEAR = {2010},
PAGES = {1005--1016},
}
@INPROCEEDINGS{ChristodoulouKS2008,
AUTHOR = {Christodoulou, George and Kov{\'a}cs, Annam{\'a}ria and Schapira, Michael},
EDITOR = {Aceto, Luca and Damg{\aa}rd, Ivan and Goldberg, Leslie Ann and Halld{\'o}rsson, Magn{\'u}s M. and Ing{\'o}lfsd{\'o}ttir, Anna and Walukiewicz, Igor},
TITLE = {Bayesian Combinatorial Auctions},
BOOKTITLE = {Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I},
PADDRESS = {Berlin},
ADDRESS = {Reykjavik, Iceland},
PUBLISHER = {Springer},
MONTH = {July},
YEAR = {2008},
PAGES = {820--832},
}
@INPROCEEDINGS{ChristodoulouKV2008,
AUTHOR = {Christodoulou, George and Koutsoupias, Elias and Vidali, Angelina},
EDITOR = {Halperin, Dan and Mehlhorn, Kurt},
TITLE = {A Characterization of 2-Player Mechanisms for Scheduling},
BOOKTITLE = {Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings.},
PADDRESS = {Berlin},
ADDRESS = {Karlsruhe, Germany},
PUBLISHER = {Springer},
MONTH = {September},
YEAR = {2008},
PAGES = {297--307},
}
@ARTICLE{Chrobak2007,
AUTHOR = {Chrobak, Marek and Gasieniec, Leszek and Kowalski, Dariusz R.},
JOURNAL = {SIAM Journal on Computing},
TITLE = {The wake-up problem in multihop radio networks},
ADDRESS = {Philadelphie, PA, USA},
NUMBER = {5},
PUBLISHER = {SIAM},
MONTH = {January},
VOLUME = {36},
ISBN = {0097-5397},
DOI = {10.1137/S0097539704442726},
YEAR = {2007},
PAGES = {1453--1471},
ABSTRACT = {We study the problem of waking up a collection of $n$ processors connected by a
multihop ad hoc ratio network with unknown topology, no access to a global
clock, and no collision detection mechanism available. Each node in the network
either wakes up spontaneously or gets activated by receiving a wake-up signal
from another node. All active nodes transmit the wake-up signals according to a
given protocol $\calW$. The running time of $\calW$ is the number of steps
counted from the first spontaneous wake-up until all nodes become activated. We
provide two protocols for this problem. The first one is a deterministic
protocol with running time $O(n^{5/3}\log n)$. Our protocol is based on a novel
concept of a shift-tolerant selector to which we refer as a (radio)
synchronizer. The second protocol is randomized, and its expected running time
is $O(D \log^2 n)$, where $D$ is the diameter of the network. Subsequently we
show how to employ our wake-up protocols to solve two other communication
primitives: leader election and clock synchronization. },
}
@ARTICLE{Cilleruelo2009,
AUTHOR = {Cilleruelo, Javier and Hebbinghaus, Nils},
JOURNAL = {European Journal of Combinatorics},
TITLE = {Discrepancy in generalized arithmetic progressions},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {7},
PUBLISHER = {Elsevier},
VOLUME = {30},
ISBN = {0195-6698},
DOI = {10.1016/j.ejc.2009.03.006},
YEAR = {2009},
PAGES = {1607--1611},
}
@ARTICLE{CJKMR97,
AUTHOR = {Christof, Thomas and J{\"u}nger, Michael and Kececioglu, John and Mutzel, Petra and Reinelt, Gerhard},
JOURNAL = {Journal of Computational Biology},
TITLE = {A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes},
NUMBER = {4},
VOLUME = {4},
YEAR = {1997},
PAGES = {433--447},
}
@INPROCEEDINGS{CK-PODC,
AUTHOR = {Chlebus, Bogdan S. and Kowalski, Dariusz},
EDITOR = {Chaudhuri, Soma and Kutten, Shay},
TITLE = {A better wake-up in radio networks},
BOOKTITLE = {Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {St. John's, Newfoundland, Canada},
PUBLISHER = {ACM},
ISBN = {1-58113-802-4},
YEAR = {2004},
PAGES = {266--274},
}
@INPROCEEDINGS{CK-STOC,
AUTHOR = {Chlebus, Bogdan S. and Kowalski, Dariusz},
EDITOR = {Gabow, Harold N. and Fagin, Ronald},
TITLE = {Cooperative asynchronous update of shared memory},
BOOKTITLE = {Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005)},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Baltimore, USA},
PUBLISHER = {ACM},
ISBN = {1-58113-960-8},
YEAR = {2005},
PAGES = {733--739},
}
@ARTICLE{CK2009,
AUTHOR = {Christodoulou, George and Koutsoupias, Elias},
JOURNAL = {Bulletin of European Association for Theoretical Computer Science},
TITLE = {Mechanism Design for Scheduling},
ADDRESS = {Leiden},
PUBLISHER = {EATCS},
VOLUME = {97},
ISBN = {0252-9742},
YEAR = {2009},
PAGES = {40--59},
}
@INPROCEEDINGS{CKK07,
AUTHOR = {Christodoulou, George and Koutsoupias, Elias and Kov{\'a}cs, Annam{\'a}ria},
EDITOR = {Arge, Lars and Cachin, Christian and Jurdzi´nski, Tomasz and Tarlecki, Andrzej},
TITLE = {Mechanism design for fractional scheduling on unrelated machines},
BOOKTITLE = {Automata, Languages and Programming : 34th International Colloquium, ICALP 2007},
PADDRESS = {Berlin, Germany},
ADDRESS = {Wrocław, Poland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4596},
ISBN = {3-540-73419-2},
DOI = {10.1007/978-3-540-73420-8_6},
YEAR = {2007},
PAGES = {40--52},
NOTE = {To appear at ICALP 07.},
}
@ARTICLE{CKK2009,
AUTHOR = {Christodoulou, George and Koutsoupias, Elias and Kov{\'a}cs, Annam{\'a}ria},
JOURNAL = {ACM Transactions on Algorithms},
TITLE = {Mechanism Design for Fractional Scheduling on Unrelated Machines},
ADDRESS = {New York, NY},
NUMBER = {2},
PUBLISHER = {ACM},
MONTH = {March},
VOLUME = {6},
ISBN = {1549-6325},
DOI = {10.1145/1721837.1721854},
YEAR = {2010},
PAGES = {38:1--38:18},
}
@UNPUBLISHED{CKMP-manus,
AUTHOR = {Czyzowicz, Jurek and Kowalski, Dariusz and Markou, Euripides and Pelc, Andrzej},
TITLE = {Complexity of searching for a black hole},
YEAR = {2006},
NOTE = {Submitted},
}
@INPROCEEDINGS{CKMP-OPODIS,
AUTHOR = {Czyzowicz, Jurek and Kowalski, Dariusz and Markou, Euripides and Pelc, Andrzej},
EDITOR = {Higashino, Teruo},
TITLE = {Searching for a black hole in tree networks},
BOOKTITLE = {Principles of distributed systems : 8th International Conference, OPODIS 2004},
PADDRESS = {Berlin, Germany},
ADDRESS = {Grenoble, France},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3544},
ISBN = {3-540-27324-7},
YEAR = {2005},
PAGES = {67--80},
}
@INPROCEEDINGS{CKV07,
AUTHOR = {Christodoulou, George and Koutsoupias, Elias and Vidali, Angelina},
TITLE = {A lower bound for scheduling mechanisms},
BOOKTITLE = {ACM-SIAM Symposium on Discrete Algorithms (SODA)},
PADDRESS = {New Orleans},
ADDRESS = {Philadelphia},
PUBLISHER = {SIAM},
YEAR = {2007},
PAGES = {1163--1170},
}
@ARTICLE{CKV2009,
AUTHOR = {Christodoulou, George and Koutsoupias, Elias and Nanavati, Akash},
JOURNAL = {Theoretical Computer Science},
TITLE = {Coordination Mechanisms},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {36},
PUBLISHER = {Elsevier},
VOLUME = {410},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2009.01.005},
YEAR = {2009},
PAGES = {3327--3336},
}
@ARTICLE{CKValgorithmica2008,
AUTHOR = {Christodoulou, George and Koutsoupias, Elias and Vidali, Angelina},
JOURNAL = {Algorithmica},
TITLE = {A lower bound for scheduling mechanisms},
ADDRESS = {New York, NY},
NUMBER = {4},
PUBLISHER = {Springer},
VOLUME = {85},
ISBN = {0178-4617},
DOI = {10.1007/s00453-008-9165-3},
YEAR = {2009},
PAGES = {729--740},
}
@MASTERSTHESIS{Clanget1999,
AUTHOR = {Clanget, Ulrich},
TITLE = {{Plattformunabh{\"a}ngiges Toolkit f{\"u}r Grafische Benutzerschnittstellen (GUI)}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {May},
YEAR = {1999},
}
@INPROCEEDINGS{CMMS1998a,
AUTHOR = {Crauser, Andreas and Mehlhorn, Kurt and Meyer, Ulrich and Sanders, Peter},
EDITOR = {Brim, Lubos and Gruska, Jozef and Zlatuska, Jiri},
TITLE = {A Parallelization of Dijkstra's Shortest Path Algorithm},
BOOKTITLE = {Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Brno, Czech Republic},
PUBLISHER = {Springer},
MONTH = {August},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1450},
ISBN = {3-540-64827-5},
DOI = {10.1007/BFb0055823},
YEAR = {1998},
PAGES = {722--731},
ABSTRACT = {The single source shortest path (SSSP) problem
lacks parallel solutions which are fast and simultaneously
work-efficient.
We propose simple criteria which divide
Dijkstra's sequential SSSP algorithm into a number of phases,
such that the operations within a phase can be done
in parallel. We give a PRAM algorithm based on these criteria
and analyze its performance on random digraphs
with random edge weights uniformly distributed in $[0,1]$.
We use the ${\cal G}(n,d/n)$ model: the graph consists of
$n$~nodes and each edge is chosen with probability $d/n$.
Our PRAM algorithm needs ${\cal O}(n^{1/3} \log n)$
time and ${\cal O}(n \log n+dn)$ work with high probability (whp).
We also give extensions to external memory computation.
Simulations show the applicability of our approach
even on non-random graphs.},
}
@INPROCEEDINGS{COCOA07,
AUTHOR = {Mehlhorn, Kurt},
EDITOR = {Dress, Andreas and Xu, Yinfeng and Zhu, Binhai},
TITLE = {Matchings in Graphs Variations of the Problem},
BOOKTITLE = {Combinatorial Optimization and Applications : First International Conference, COCOA 2007},
PADDRESS = {Berlin, Germany},
ADDRESS = {Xi’an, China},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4616},
ISBN = {3-540-73555-7},
DOI = {10.1007/978-3-540-73556-4_1},
YEAR = {2007},
PAGES = {1--2},
}
@INPROCEEDINGS{Cole-Hariharan96,
AUTHOR = {Cole, Richard and Hariharan, Ramesh},
TITLE = {An O(n log n) algorithm for the maximum agreement subtree problem for binary trees},
BOOKTITLE = {7th ACM-SIAM Symposium on Discrete Algorithms (SODA96)},
PADDRESS = {New York},
ADDRESS = {Georgia, USA},
PUBLISHER = {acm},
YEAR = {1996},
PAGES = {323--332},
}
@ARTICLE{ColeFarachetal2000,
AUTHOR = {Cole, Richard and Farach-Colton, Martin and Hariharan, Ramesh and Przytycka, Teresa and Thorup, Mikkel},
JOURNAL = {SIAM Journal on Computing},
TITLE = {An {O}(n log n) algorithm for the maximum agreement subtree problem for binary trees},
ADDRESS = {Philadelphia, USA},
NUMBER = {5},
PUBLISHER = {SIAM},
VOLUME = {30},
ISBN = {0097-5397},
YEAR = {2000},
PAGES = {1385--1404},
}
@INPROCEEDINGS{conf/compgeom/GaoJKMR89,
AUTHOR = {Gao, Shaodi and Jerrum, Mark and Kaufmann, Michael and Mehlhorn, Kurt and R{\"u}lling, Wolfgang},
TITLE = {On Continuous Homotopic One Layer Routing},
BOOKTITLE = {Computational geometry (SCG-88) : 4th symposium},
PADDRESS = {New York, USA},
ADDRESS = {Urbana-Champaign, IL, USA},
PUBLISHER = {ACM},
ISBN = {0-89791-270-5},
YEAR = {1988},
PAGES = {392--402},
}
@INPROCEEDINGS{conf/esa/Bar-YehudaFMR2007,
AUTHOR = {Bar-Yehuda, Reuven and Flysher, Guy and Mestre, Juli{\'a}n and Rawitz, Dror},
EDITOR = {Arge, Lars and Hoffmann, Michael and Welzl, Emo},
TITLE = {Approximation of Partial Capacitated Vertex Cover},
BOOKTITLE = {15th Annual European Symposium on Algorithms},
PADDRESS = {Berlin / Heidelberg},
ADDRESS = {Eilat, Israel},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4698},
ISBN = {978-3-540-75519-7},
DOI = {10.1007/978-3-540-75520-3_31},
YEAR = {2007},
PAGES = {335--346},
ABSTRACT = {We study the \emph{partial capacitated vertex cover problem} (PCVC)
in which the input consists of a graph $G$ and a covering requirement
$L$. Each edge $e$ in $G$ is associated with a \emph{demand} (or
\emph{load}) $\ell(e)$, and each vertex $v$ is associated with a
(soft) \emph{capacity} $c(v)$ and a \emph{weight} $w(v)$. A feasible
solution is an assignment of edges to vertices such that the total
demand of assigned edges is at least $L$. The weight of a solution is
$\sum_v \alpha(v) w(v)$, where $\alpha(v)$ is the number of copies of
$v$ required to cover the demand of the edges that are assigned to
$v$. The goal is to find a solution of minimum weight.
We consider three variants of PCVC. In PCVC with \emph{separable
demands} the only requirement is that total demand of edges assigned
to $v$ is at most $\alpha(v) c(v)$. In \pcvc\ with \emph{inseparable
demands} there is an additional requirement that if an edge is
assigned to $v$ then it must be assigned to one of its copies. The
third variant is the unit demands version.
We present $3$-approximation algorithms for both PCVC with separable
demands and PCVC with inseparable demands. We also present a
$2$-approximation algorithm for PCVC with unit demands. We show
that similar results can be obtained for PCVC in hypergraphs and for
the \emph{prize collecting} version of capacitated vertex cover.
Our algorithms are based on a unified approach for designing and
analyzing approximation algorithms for capacitated covering problems.
This approach yields simple algorithms whose analyses rely on the
local ratio technique and sophisticated charging schemes.},
}
@INPROCEEDINGS{conf/esa/KhullerM2008,
AUTHOR = {Khuller, Samir and Mestre, Juli{\'a}n},
TITLE = {An Optimal Incremental Algorithm for Minimizing Lateness with Rejection},
BOOKTITLE = {16th Annual European Symposium on Algorithms (ESA)},
PADDRESS = {Heidelberg, Germany},
ADDRESS = {Karlsruhe, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5193},
DOI = {10.1007/978-3-540-87744-8_50},
YEAR = {2008},
PAGES = {601--610},
}
@INPROCEEDINGS{conf/esa/KhullerMM2007,
AUTHOR = {Khuller, Samir and Malekian, Azarakhsh and Mestre, Juli{\'a}n},
EDITOR = {Arge, Lars and Hoffmann, Michael and Welzl, Emo},
TITLE = {To Fill or Not to Fill: The Gas Station Problem},
BOOKTITLE = {15th Annual European Symposium on Algorithms},
PADDRESS = {Berlin / Heidelberg},
ADDRESS = {Eilat, Israel},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4698},
ISBN = {978-3-540-75519-7},
DOI = {10.1007/978-3-540-75520-3_48},
YEAR = {2007},
PAGES = {534--545},
ABSTRACT = {In this paper we study several routing problems that generalize shortest paths
and the Traveling Salesman Problem. We consider a more general model that
incorporates the actual cost in terms of gas prices. We have a vehicle with a
given tank capacity. We assume that at each vertex gas may be purchased at a
certain price. The objective is to find the cheapest route to go from s to t,
or the cheapest tour visiting a given set of locations. Surprisingly, the
problem of find the cheapest way to go from s to t can be solved in polynomial
time and is not NP-complete. For most other versions however, the problem is
NP-complete and we develop polynomial time approximation algorithms for these
versions.},
}
@INPROCEEDINGS{conf/gi/MehlhornZ88,
AUTHOR = {Mehlhorn, Kurt},
EDITOR = {Valk, R{\"u}diger},
TITLE = {{SFB 124: VLSI-Entwurfsmethoden und Parallelit{\"a}t}},
BOOKTITLE = {GI - 18. Jahrestagung II, Vernetzte and komplexe Informatik-Systems},
PADDRESS = {Berlin, Germany},
ADDRESS = {Hamburg, Germany},
PUBLISHER = {Springer},
SERIES = {Informatik-Fachberichte},
VOLUME = {188},
ISBN = {3-540-50360-9},
YEAR = {1988},
PAGES = {3--29},
}
@INPROCEEDINGS{conf/soda/Mestre2008,
AUTHOR = {Mestre, Juli{\'a}n},
TITLE = {Adaptive Local Ratio},
BOOKTITLE = {19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
PADDRESS = {Philadelphia, USA},
ADDRESS = {San Francisco, USA},
PUBLISHER = {Society for Industrial and Applied Mathematics},
MONTH = {January},
YEAR = {2008},
PAGES = {152--160},
ABSTRACT = {Local Ratio is a well-known paradigm for designing approximation algorithms for
combinatorial optimization problems. At a very high level, a local ratio
algorithm first decomposes the input weight function $w$ into a positive linear
combination of simpler weight functions or \emph{models}. Guided by this
process a solution $S$ is constructed such that $S$ is $\alpha$-approximate
with respect to each model used in the decomposition. As a result, $S$ is
$\alpha$-approximate under $w$ as well.
These models usually have a very simple structure that remains ``unchanged''
throughout the execution of the algorithm. In this work we show that adaptively
choosing a model from a richer spectrum of functions can lead to a better local
ratio. Indeed, by turning the search for a good model into an optimization
problem of its own, we get improved approximations for a data migration
problem.},
}
@INPROCEEDINGS{conf/stacs/ElbassioniKMMS2009,
AUTHOR = {Elbassioni, Khaled and Krohn, Erik and Matijevic, Domagoj and Mestre, Juli{\'a}n and Severdija, Domagoj},
EDITOR = {Albers, Susanne and Marion, Jean-Yves},
TITLE = {Improved Approximation Algorithms for {1.5D} Terrain Guarding},
BOOKTITLE = {Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS)},
PADDRESS = {Dagstuhl, Germany},
ADDRESS = {Freiburg - Germany},
PUBLISHER = {LZI},
SERIES = {Leibniz International Proceedings in Informatics},
VOLUME = {3},
ISBN = {978-3-939897-09-5},
DOI = {10.4230/LIPIcs.STACS.2009.1841},
YEAR = {2009},
PAGES = {361--371},
}
@INPROCEEDINGS{conf/stacs/MehlhornP86,
AUTHOR = {Mehlhorn, Kurt and Preparata, Franco P.},
EDITOR = {Monien, Burkhard and Vidal-Naquet, Guy},
TITLE = {Area-time Optimal Division for {T}=Omega(log n)$^1+epsilon$"},
BOOKTITLE = {STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science},
PADDRESS = {Berlin, Germany},
ADDRESS = {Orsay, France},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {210},
ISBN = {3-540-16078-7},
YEAR = {1986},
PAGES = {341--352},
}
@INPROCEEDINGS{conf/stacs/Mestre2008,
AUTHOR = {Mestre, Juli{\'a}n},
TITLE = {Lagrangian Relaxation and Partial Cover (Extended Abstract)},
BOOKTITLE = {25th International Symposium on Theoretical Aspects of Computer Science (STACS)},
PADDRESS = {Dagstuhl, Germany},
ADDRESS = {Bordeaux, France},
PUBLISHER = {Internationales Begegnungs- und Forschungszentrum f{"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
MONTH = {February},
YEAR = {2008},
PAGES = {539--550},
}
@INPROCEEDINGS{conf/swat/AlthausCEKM2008,
AUTHOR = {Althaus, Ernst and Canzar, Stefan and Elbassioni, Khaled and Karrenbauer, Andreas and Mestre, Juli{\'a}n},
TITLE = {Approximating the Interval Constrained Coloring Problem},
BOOKTITLE = {11th Scandinavian Workshop on Algorithm Theory (SWAT)},
PADDRESS = {Heidelberg, Germany},
ADDRESS = {Gothenburg, Sweden},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5124},
YEAR = {2008},
PAGES = {210--221},
}
@ARTICLE{ContRound2006,
AUTHOR = {Doerr, Benjamin and Klein, Christian},
JOURNAL = {Electronic Notes in Discrete Mathematics},
TITLE = {Controlled Randomized Rounding},
ADDRESS = {Amsterdam, The Netherlands},
PUBLISHER = {Elsevier},
VOLUME = {25},
ISBN = {1571-0653},
YEAR = {2006},
PAGES = {39--40},
}
@ARTICLE{CooperFriezeMehlhornPriebe00,
AUTHOR = {Cooper, Colin and Frieze, Alan M. and Mehlhorn, Kurt and Priebe, Volker},
JOURNAL = {Random Structures \& Algorithms},
TITLE = {Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model},
ADDRESS = {New York, USA},
NUMBER = {1},
PUBLISHER = {Wiley},
VOLUME = {16},
ISBN = {1042-9832},
YEAR = {2000},
PAGES = {33--46},
ABSTRACT = {We study the average-case complexity of shortest-paths problems in the
vertex-potential model. The vertex-potential model is a family of probability
distributions on complete directed graphs with arbitrary real edge lengths but
without negative cycles. We show that on a graph with $n$ vertices and with
respect to this model, the single-source shortest-paths problem can be solved
in $O(n^2)$ expected time, and the all-pairs shortest-paths problem can be
solved in $O(n^2 \log n)$ expected time.},
}
@INPROCEEDINGS{CooperFriezeMehlhornPriebe97,
AUTHOR = {Cooper, Colin and Frieze, Alan M. and Mehlhorn, Kurt and Priebe, Volker},
EDITOR = {Rolim, Jos{\'e}},
TITLE = {Average-case complexity of shortest-paths problems in the vertex-potential model},
BOOKTITLE = {International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Bologna, Italy},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1269},
ISBN = {3-540-63248-4},
YEAR = {1997},
PAGES = {15--26},
ABSTRACT = {We study the average-case complexity of shortest-paths problems in the
vertex-potential model. The vertex-potential model is a family of probability
distributions on
complete directed graphs with \emph{arbitrary} real edge lengths but
without negative cycles. We show that on a graph with $n$ vertices and
with respect to this model, the single-source shortest-paths problem can be
solved in $O(n^2)$
expected time, and the all-pairs shortest-paths problem can be solved in $O(n^2
\log n)$
expected time.},
}
@INPROCEEDINGS{CorreaMRS2009,
AUTHOR = {Correa, Jose R. and Megow, Nicole and Raman, Rajiv and Suchan, Karol},
EDITOR = {Cafieri, Sonia and Mucherino, Antonio and Nannicini, Giacomo and Tarissan, Fabien and Liberti, Leo},
TITLE = {Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs},
BOOKTITLE = {8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009)},
PADDRESS = {Paris, France},
ADDRESS = {Paris, France},
PUBLISHER = {École Polytechnique},
YEAR = {2009},
PAGES = {347--350},
}
@INPROCEEDINGS{CPL2010,
AUTHOR = {Christodoulou, Giorgos and Ligett, Katrina and Pyrga, Evangelia},
EDITOR = {Abramsky, Samson and Gavoille, Cyril and Kirchner, Claude and Meyer auf der Heide, Friedhelm and Spirakis, Paul},
TITLE = {Contention Resolution under Selfishness},
BOOKTITLE = {Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II},
PADDRESS = {Berlin},
ADDRESS = {Bordeaux, France},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6199},
ISBN = {978-3-642-14161-4},
DOI = {10.1007/978-3-642-14162-1_36},
YEAR = {2010},
PAGES = {430--441},
ABSTRACT = {In many communications settings, such as wired and wireless local-area
networks, when multiple users attempt to access a communication channel at the
same time, a conflict results and none of the communications are
successful. Contention resolution is the study of distributed transmission and
retransmission protocols designed to maximize notions of utility such as
channel utilization in the face of blocking communications.
An additional issue to be considered in the design of such protocols
is that selfish users may have incentive to deviate from the
prescribed behavior, if another transmission strategy increases their
utility. The work of Fiat et al.~\cite{Fiat07} addresses this issue by
constructing an asymptotically optimal incentive-compatible
protocol. However, their protocol assumes the cost of any single
transmission is zero, and the protocol completely collapses under non-zero
transmission costs.
In this paper, we treat the case of non-zero transmission cost $c$.
We present asymptotically optimal contention resolution protocols that
are robust to selfish users, in two different channel feedback
models. Our main result is in the Collision Multiplicity Feedback
model, where after each time slot, the number of attempted
transmissions is returned as feedback to the users. In this setting,
we give a protocol that has expected cost $2n+c\log n$ and is in
$o(1)$-equilibrium, where $n$ is the number of users.},
}
@INPROCEEDINGS{CraMehMey97,
AUTHOR = {Crauser, Andreas and Mehlhorn, Kurt and Meyer, Ulrich},
EDITOR = {Spaniol, Otto},
TITLE = {{K{\"u}rzeste-Wege-Berechnung bei sehr gro{\ss}en Datenmengen}},
BOOKTITLE = {Promotion tut not: Innovationsmotor "Graduiertenkolleg"},
PADDRESS = {Aachen, Germany},
ADDRESS = {Aachen, Germany},
PUBLISHER = {Augustinus},
MONTH = {September},
SERIES = {Aachener Beitr{\"a}ge zur Informatik},
VOLUME = {21},
ISBN = {3-86073-477-6},
YEAR = {1997},
PAGES = {113--132},
ABSTRACT = {In diesem Report untersuchen wir die Ein/Ausgabe-Komplexit{\"a}t (I/O Komplexit{\"a}t)
des K{\"u}rzesten-Wege-Problems mit einem Startknoten (single source shortest path)
auf Graphen mit nicht-negativen Kantengewichten. Wir pr{\"a}sentieren einen
Algorithmus, der f{\"u}r eine gro{\ss}e Klasse zuf{\"a}lliger Graphen eine I/O Komplexit{\"a}t
von ${\cal O}(\frac{n}{D}+\frac{m}{DB}\log_{S/B}\frac{m}{B})$ erreicht. Dabei
bezeichnen $n,m$ die Anzahl der Knoten bzw. Kanten im Graphen, $S$ ist die
Gr{\"o}{\ss}e des verf{\"u}gbaren Internspeichers, $B$ bezeichnet die Gr{\"o}{\ss}e eines
Blocktransfers und $D$ ist die Anzahl der unabh{\"a}ngigen
parallelen Harddisks; $D$ ist beschr{\"a}nkt auf ${\cal O}(\sqrt{n/d})$.
Weiterhin pr{\"a}sentieren wir ein effizientes Phasen-Verfahren f{\"u}r
Probleminstanzen, die so gro{\ss} sind, da{\ss} selbst ein boolsches Feld f{\"u}r die
Knotenmenge nicht mehr im Hauptspeicher gehalten werden kann.},
}
@ARTICLE{Crauser-Ferragina2001,
AUTHOR = {Crauser, Andreas and Ferragina, Paolo},
JOURNAL = {Algorithmica},
TITLE = {A theoretical and experimental study on the construction of suffix arrays in external memory},
ADDRESS = {New York, USA},
NUMBER = {1},
PUBLISHER = {Springer},
MONTH = {January},
VOLUME = {32},
ISBN = {0178-4617},
YEAR = {2002},
PAGES = {1--35},
ABSTRACT = { The construction of full-text indexes on very large text collections
is nowadays a hot problem. The suffix array [Manber-Myers,~1993] is
one of the most attractive full-text indexing data structures due to
its simplicity, space efficiency and powerful/fast search operations
supported. In this paper we analyze, both theoretically and
experimentally, the I/O-complexity and the working space of six
algorithms for constructing large suffix arrays. Three of them are
the state-of-the-art, the other three algorithms are our new
proposals. We perform a set of experiments based on three different
data sets (English texts, Amino-acid sequences and random texts) and
give a precise hierarchy of these algorithms according to their
working-space vs. construction-time tradeoff. Given the current
trends in model design~\cite{Farach-et-al,Vitter} and disk
technology~\cite{quantum,Ruemmler-Wilkes}, we will pose particular
attention to differentiate between ``random'' and ``contiguous''
disk accesses, in order to reasonably explain some practical
I/O-phenomena which are related to the experimental behavior of
these algorithms and that would be otherwise meaningless in the
light of other simpler external-memory models.
At the best of our knowledge, this is the first study which provides
a wide spectrum of possible approaches to the construction of suffix
arrays in external memory, and thus it should be helpful to anyone
who is interested in building full-text indexes on very large text
collections.
Finally, we conclude our paper by addressing two other issues. The
former concerns with the problem of building word-indexes; we show
that our results can be successfully applied to this case too,
without any loss in efficiency and without compromising the
simplicity of programming so to achieve a uniform, simple and
efficient approach to both the two indexing models. The latter issue
is related to the intriguing and apparently counterintuitive
``contradiction'' between the effective practical performance of the
well-known BaezaYates-Gonnet-Snider's algorithm~\cite{book-info},
verified in our experiments, and its unappealing (i.e., cubic)
worst-case behavior. We devise a new external-memory algorithm that
follows the basic philosophy underlying that algorithm but in a
significantly different manner, thus resulting in a novel approach
which combines good worst-case bounds with efficient practical
performance. },
}
@INPROCEEDINGS{Crauser1999,
AUTHOR = {Crauser, Andreas and Ferragina, Paolo},
EDITOR = {Nesetril, Jaroslav},
TITLE = {On Constructing Suffix Arrays in External Memory},
BOOKTITLE = {Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99)},
PADDRESS = {Berlin},
ADDRESS = {Prague, Czech Republic},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1643},
YEAR = {1999},
PAGES = {224--235},
ABSTRACT = { The construction of full-text indexes on very large text collections
is nowadays a hot problem. The suffix array~\cite{Manber-Myers} is
one of the most attractive full-text indexing data structures due to
its simplicity, space efficiency and powerful/fast search operations
supported. In this paper we analyze theoretically and
experimentally, the I/O-complexity and the working space of six
algorithms for constructing large suffix arrays. Additionally, we
design a new external-memory algorithm that follows the basic
philosophy underlying the algorithm in~\cite{book-info} but in a
significantly different manner, thus combining its good practical
qualities with efficient worst-case performances. At the best of our
knowledge, this is the first study which provides a wide spectrum of
possible approaches to the construction of suffix arrays in external
memory, and thus it should be helpful to anyone who is interested in
building full-text indexes on very large text collections. },
}
@INPROCEEDINGS{Crauser1999a,
AUTHOR = {Crauser, Andreas and Mehlhorn, Kurt},
EDITOR = {Vitter, Jeffrey S. and Zaroliagis, Christos D.},
TITLE = {LEDA-SM : Extending LEDA to Secondary Memory},
BOOKTITLE = {Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99},
PADDRESS = {Berlin, Germany},
ADDRESS = {London, UK},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1668},
ISBN = {3-540-66427-0},
YEAR = {1999},
PAGES = {228--242},
ABSTRACT = {During the last years, many software libraries for \emph{in-core} computation
have been developed. Most internal memory algorithms perform very badly when
used in an \emph{external memory} setting. We introduce LEDA-SM that extends
the LEDA-library~\cite{LEDAbook} towards secondary memory computation. LEDA-SM
uses I/O-efficient algorithms and data structures that do not suffer from the
so called {\em I/O bottleneck}. LEDA is used for in-core computation. We
explain the design of LEDA-SM and report on performance results. },
}
@UNPUBLISHED{Crauser2000,
AUTHOR = {Crauser, Andreas and Meyer, Ulrich and Brengel, Klaus},
JOURNAL = {Journal of Experimental Algorithmics},
TITLE = {An experimental study of priority queues in external memory},
ADDRESS = {New York, USA},
PUBLISHER = {ACM},
VOLUME = {5},
ISBN = {1084-6654},
YEAR = {2001},
PAGES = {24},
ABSTRACT = { In this paper we compare the performance of eight different priority
queue implementations: four of them are explicitly designed to work
in an external-memory setting, the others are standard
internal-memory queues available in the LEDA library~\cite{leda}.
Two of the external-memory priority queues are obtained by
engineering known internal-memory priority queues with the aim of
achieving effective performance on external storage devices (i.e.,
Radix heaps~\cite{Ahuja-et-al} and array heaps~\cite{Thorup}). Our
experimental framework includes some simple tests, like random
sequences of insert or delete-minimum operations, as well as more
advanced tests consisting of intermixed sequences of update
operations and ``application driven'' update sequences originated
by simulations of Dijkstra's algorithm on large graph instances.
Our variegate spectrum of experimental results gives a good picture
of the features of these priority queues, thus being helpful to
anyone interested in the use of such data structures on very large
data sets. },
}
@PHDTHESIS{Crauser2001,
AUTHOR = {Crauser, Andreas},
TITLE = {LEDA-SM:External Memory Algorithms and Data Structures in Theory and Practice},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
MONTH = {March},
YEAR = {2001},
}
@ARTICLE{Crochemore-et-al.97,
AUTHOR = {Crochemore, Maxime and Galil, Zvi and Gasieniec, Leszek and Park, Kunsoo and Rytter, Wojciech},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Constant-time Randomized Parallel String Matching},
NUMBER = {4},
VOLUME = {26},
YEAR = {1997},
PAGES = {950--960},
}
@INPROCEEDINGS{Crochemore-Gasieniec-Rytter97,
AUTHOR = {Crochemore, Maxime and Gasieniec, Leszek and Rytter, Wojciech},
EDITOR = {Carpentieri, B. and De Santis, A. and Vaccaro, U. and Storer, J. A.},
TITLE = {Constant-space string-matching in sublinear average time},
BOOKTITLE = {Compression and Complexity of SEQUENCES 1997},
PADDRESS = {-},
ADDRESS = {Positano,Italy},
PUBLISHER = {-},
YEAR = {1998},
PAGES = {230--239},
}
@INPROCEEDINGS{croi13,
AUTHOR = {Croitoru, Cosmina},
TITLE = {Abstract Debates},
BOOKTITLE = {IEEE International Conference on Tools with Artificial Intelligence (ICTAI) - 2013},
PADDRESS = {Washington, USA},
ADDRESS = {Washington, USA},
PUBLISHER = {IEEE Computer Society},
MONTH = {November},
YEAR = {2013},
}
@INPROCEEDINGS{croikotzi12,
AUTHOR = {Croitoru, Cosmina and K{\"o}tzing, Timo},
EDITOR = {Kersting, Kristian and Toussaint, Marc},
TITLE = {Deliberative Acceptability of Arguments},
BOOKTITLE = {STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium},
PADDRESS = {Amsterdam},
ADDRESS = {Montpellier, France},
PUBLISHER = {IOS Press},
MONTH = {August},
SERIES = {Frontiers in Artificial Intelligence and Applications},
VOLUME = {241},
ISBN = {978-1-61499-095-6},
DOI = {10.3233/978-1-61499-096-3-71},
YEAR = {2012},
PAGES = {71--82},
}
@INPROCEEDINGS{croikotzi13,
AUTHOR = {Croitoru, Cosmina and K{\"o}tzing, Timo},
TITLE = {A Normal Form for Argumentation Frameworks},
BOOKTITLE = {Theory and Applications of Formal Argumentation (TAFA'13)},
PADDRESS = {New York, USA},
ADDRESS = {Beijing, China},
PUBLISHER = {SPRINGER},
MONTH = {February},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {8306},
ISBN = {978-3-642-54372-2},
YEAR = {2014},
PAGES = {32--45},
}
@MASTERSTHESIS{CroitoruMaster2012,
AUTHOR = {Croitoru, Cosima},
TITLE = {Algorithmic aspects of abstract argumentation frameworks},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {September},
YEAR = {2012},
PAGES = {X,75p.},
}
@ARTICLE{CromemoreGasienicHariharanMuthukrishnanRytterSIAMJCOMPUT1998,
AUTHOR = {Crochemore, Maxime and Gasieniec, Leszek and Hariharan, Ramesh and Muthukrishnan, S. and Rytter, Wojciech},
JOURNAL = {SIAM Journal on Computing},
TITLE = {A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching},
NUMBER = {3},
PUBLISHER = {SIAM},
MONTH = {June},
VOLUME = {27},
ISBN = {0097-5397},
YEAR = {1998},
PAGES = {668--681},
}
@ARTICLE{crs98a,
AUTHOR = {Sridharan, K and Subramanian, C. R. and Sudha, N},
JOURNAL = {Applied Mathematics Letters},
TITLE = {Some Properties of Touching Distances for Polygons and Polyhedra},
NUMBER = {5},
PUBLISHER = {Elsevier},
MONTH = {August},
VOLUME = {11},
ISBN = {0893-9659},
YEAR = {1998},
PAGES = {1--7},
}
@ARTICLE{CRS98b,
AUTHOR = {Subramanian, C. R. and F{\"u}rer, Martin and Veni Madhavan, C. E.},
JOURNAL = {Random Structures \& Algorithms},
TITLE = {Algorithms for Coloring Semi-random Graphs},
NUMBER = {2},
PUBLISHER = {Wiley},
MONTH = {September},
VOLUME = {13},
ISBN = {1042-9832},
YEAR = {1998},
PAGES = {125--158},
ABSTRACT = {Polynomial average time algorithms for $k$-coloring semi-random $k$-colorable
graphs are presented and analyzed. Semi-random graphs are a generalization of
random graphs and in terms of randomness, this model lies between random graphs
and worst-case model. },
}
@INPROCEEDINGS{crs98c,
AUTHOR = {Schnorr, C. P. and Subramanian, C. R.},
EDITOR = {Luby, Michael and Rolim, Jos{\'e} and Serna, Maria},
TITLE = {Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter},
BOOKTITLE = {Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Barcelona, Spain},
PUBLISHER = {Springer},
MONTH = {October},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1518},
ISBN = {3-540-65142-X},
YEAR = {1998},
PAGES = {218--231},
}
@ARTICLE{crscpc,
AUTHOR = {Subramanian, C. R.},
JOURNAL = {Combinatorics, Probability and Computing},
TITLE = {Algorithms for Colouring Random k-colourable Graphs},
ADDRESS = {Cambridge},
NUMBER = {1},
PUBLISHER = {Cambridge University Press},
VOLUME = {9},
ISBN = {0963-5483},
YEAR = {2000},
PAGES = {45--77},
NOTE = {The results of this paper have recently been improved to wider
range of distributions. },
ABSTRACT = {Almost surely succeeding and polynomial average time
algorithms for coloring random k-colorable graphs are presented. },
}
@ARTICLE{crsjalg,
AUTHOR = {Subramanian, C. R.},
JOURNAL = {Journal of Algorithms},
TITLE = {Minimum Coloring k-Colorable Graphs in Polynomial Average Time},
PUBLISHER = {Academic Press},
MONTH = {October},
VOLUME = {33},
YEAR = {1999},
PAGES = {112--123},
ABSTRACT = {We present algorithms for minimum coloring k-colorable graphs
drawn from random and semi-random models. In the first model,
each allowed edge is included with indpendent probability p.
In the second model, an adversary is given the power to
vary the edge probability as the random instance is built.
Semi-random models were introduced as a way of striking a balance
between random graphs and worst-case adversaries. Our algorithms
run in polynomial time on the average. Minimum coloring is harder
than k-coloring because even a ''short certificate'' is not presently
known for the optimality of a coloring. },
}
@INPROCEEDINGS{crsoda99,
AUTHOR = {Subramanian, C. R.},
TITLE = {A Generalization of {Janson} inequalities and its application to finding shortest paths},
BOOKTITLE = {Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99)},
ORGANIZATION = {Association for Computing Machinery and Society for Industrial and Applied Mathematics},
PADDRESS = {New York, USA},
ADDRESS = {Baltimore, USA},
PUBLISHER = {ACM},
MONTH = {January},
YEAR = {1999},
PAGES = {795--804},
}
@ARTICLE{Csaba06,
AUTHOR = {Csaba, Bela and Lodha, S.},
JOURNAL = {Random Structures and Algorithms},
TITLE = {A randomized on-line algorithm for the k-server problem on the line},
NUMBER = {1},
MONTH = {August},
VOLUME = {29},
YEAR = {2006},
PAGES = {82--104},
}
@ARTICLE{Csaba07,
AUTHOR = {Csaba, Bela},
JOURNAL = {Combinatorics, Probability and Computing},
TITLE = {On the Bollobas-Eidrigde conjecture for bipartite graphs},
NUMBER = {1},
PUBLISHER = {Cambridge University Press},
MONTH = {January},
VOLUME = {16},
YEAR = {2007},
PAGES = {1--31},
}
@TECHREPORT{Csaba2001,
AUTHOR = {Csaba, Bela and Lodha, Sachin},
TITLE = {A randomized on-line algorithm for the k-server problem on a line},
INSTITUTION = {DIMACS-Center for Discrete Mathematics \& Theoretical Computer Science},
TYPE = {Technical Report},
ADDRESS = {Piscataway, NJ},
NUMBER = {DIMACS TechReport 2001-34},
MONTH = {October},
YEAR = {2001},
PAGES = {15},
ABSTRACT = {We give a $O(n^{2 \over 3}\log{n})$-competitive randomized $k$--server
algorithm when the underlying metric space is given by $n$ equally spaced
points on a line. For $n = k + o(k^{3 \over 2}/\log{k})$, this algorithm is
$o(k)$--competitive.},
}
@ARTICLE{Csaba2003a,
AUTHOR = {Csaba, Bela},
JOURNAL = {Combinatorica},
TITLE = {Proof of a conjecture of {Bollobas} and {Eldridge} for graphs of maximum degree three},
ADDRESS = {Berlin, Germany},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {23},
ISBN = {0209-9683},
YEAR = {2003},
PAGES = {35--72},
ABSTRACT = {Let $G_1$ and $G_2$ be simple graphs on $n$ vertices. If there are
edge-disjoint copies of $G_1$ and $G_2$ in $K_n$, then we say there is
a packing of $G_1$ and $G_2$. A conjecture of Bollob\'as and Eldridge
~\cite{be78} asserts that if $(\Delta(G_1)+1)(\Delta(G_2)+1)\le n+1$ then
there is a packing of $G_1$ and $G_2$. We prove this conjecture when
$\Delta(G_1)=3$, for sufficiently large $n$.},
}
@INPROCEEDINGS{CurticapeanK2013,
AUTHOR = {Curticapean, Radu and K{\"u}nnemann, Marvin},
EDITOR = {Bodlaender, Hans L. and Italiano, Giuseppe F.},
TITLE = {A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems},
BOOKTITLE = {21st Annual European Symposium on Algorithms (ESA 2013)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Sophia Antipolis, France},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8125},
ISBN = {978-3-642-40449-8},
DOI = {10.1007/978-3-642-40450-4_30},
YEAR = {2013},
PAGES = {349--360},
}
@ARTICLE{CycleBasisSimplified,
AUTHOR = {Mehlhorn, K. and Michail, D.},
JOURNAL = {ACM Transactions on Algorithms},
TITLE = {Minimum Cycle Bases: Faster and Simpler},
ADDRESS = {New York, NY},
NUMBER = {1},
PUBLISHER = {ACM},
VOLUME = {6},
ISBN = {1549-6325},
DOI = {10.1145/1644015.1644023},
YEAR = {2009},
PAGES = {8:1--8:13},
}
@INPROCEEDINGS{CyganKratschPilipczukPilipczukWahlstroem2012,
AUTHOR = {Cygan, Marek and Kratsch, Stefan and Pilipczuk, Marcin and Pilipczuk, Michał and Wahlstr{\"o}m, Magnus},
EDITOR = {Czumaj, Artur and Mehlhorn, Kurt and Pitts, Andrew M. and Wattenhofer, Roger},
TITLE = {Clique Cover and Graph Separation: {New} Incompressibility Results},
BOOKTITLE = {Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012},
PADDRESS = {Berlin},
ADDRESS = {Warwick, UK},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7391},
ISBN = {978-3-642-31593-0},
DOI = {10.1007/978-3-642-31594-7_22},
YEAR = {2012},
PAGES = {254--265},
}
@ARTICLE{CyganPhilipPilipczukPilipczukWojtaszczyk2011,
AUTHOR = {Cygan, Marek and Philip, Geevarghese and Pilipczuk, Marcin and Pilipczuk, Micha\l{} and Wojtaszczyk, Jakub Onufry},
JOURNAL = {Theoretical Computer Science},
TITLE = {Dominating set is fixed parameter tractable in claw-free graphs},
NUMBER = {50},
PUBLISHER = {Elsevier},
MONTH = {November},
VOLUME = {412},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2011.09.010},
YEAR = {2011},
PAGES = {6982--7000},
ABSTRACT = {We show that the Dominating Set problem parameterized by solution size is
fixed-parameter tractable (FPT) in graphs that do not contain
the claw (\(K_{1,3}\), the complete bipartite graph on four
vertices where the two parts have one and three vertices,
respectively) as an \emph{induced} subgraph. We present an
algorithm that uses $2^{O(k^2)} n^{O(1)}$ time and polynomial
space to decide whether a claw-free graph on \(n\) vertices has
a dominating set of size at most \(k\). Note that this
parameterization of Dominating Set is W[2]-hard on the set of all graphs,
and thus is unlikely to have an FPT algorithm for graphs in
general.
The most general class of graphs for which an FPT algorithm was
previously known for this parameterization of Dominating Set is the class
of \(K_{i,j}\)-free graphs, which exclude, for some fixed
\(i,j\in\mathbb{N}\), the complete bipartite graph \(K_{i,j}\)
as a \emph{subgraph}. For \(i,j\ge 2\), the class of claw-free
graphs and any class of \(K_{i,j}\)-free graphs are not
comparable with respect to set inclusion. We thus \emph{extend}
the range of graphs over which this parameterization of Dominating Set is
known to be fixed-parameter tractable.
We also show that, in some sense, it is the presence of the claw
that makes this parameterization of the Dominating Set problem hard. More
precisely, we show that for any \(t\ge 4\), the Dominating Set problem
parameterized by the solution size is W[2]-hard in graphs that
exclude the \(t\)-claw \(K_{1,t}\) as an induced subgraph. Our
arguments also imply that the related Connected Dominating
Set and Dominating Clique problems are W[2]-hard in these
graph classes.
Finally, we show that for any \(t\in\mathbb{N}\), the Clique
problem parameterized by solution size, which is W[1]-hard
on general graphs, is FPT in \(t\)-claw-free graphs. Our results
add to the small and growing collection of FPT results for graph
classes defined by excluded \emph{subgraphs}, rather than by
excluded \emph{minors}.},
}
@INPROCEEDINGS{CzumajBV02+,
AUTHOR = {Czumaj, Artur and V{\"o}cking, Berthold},
TITLE = {Tight bounds for worst-case equilibria},
BOOKTITLE = {Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02)},
ORGANIZATION = {ACM/ SIAM},
PADDRESS = {New York, USA},
ADDRESS = {San Francisco, USA},
PUBLISHER = {ACM},
ISBN = {0-89871-513-X},
YEAR = {2002},
PAGES = {413--420},
}
@INPROCEEDINGS{DamsHK2013,
AUTHOR = {Dams, Johannes and Hoefer, Martin and Kesselheim, Thomas},
EDITOR = {Afek, Yehuda},
TITLE = {Sleeping Experts in Wireless Networks},
BOOKTITLE = {27th International Symposium on Distributed Computing (DISC-13)},
PADDRESS = {New York, USA},
ADDRESS = {Jerusalem, Israel},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8205},
YEAR = {2013},
PAGES = {344--357},
}
@INPROCEEDINGS{Das-et-al97,
AUTHOR = {Das, Gautam and Fleischer, Rudolf and Gasieniec, Leszek and Gunopulos, Dimitrios and K{\"a}rkk{\"a}inen, Juha},
EDITOR = {Apostolico, Alberto and Hein, Jotun},
TITLE = {Episode matching},
BOOKTITLE = {Combinatorial pattern matching : 8th annual symposium (CPM-97)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Aarhus, Denmark},
PUBLISHER = {Springer},
MONTH = {June},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1264},
ISBN = {0302-9743},
YEAR = {1997},
PAGES = {12--27},
}
@INPROCEEDINGS{Das-Kapoor-Smid96,
AUTHOR = {Das, Gautam and Kapoor, Sanjiv and Smid, Michiel},
EDITOR = {Chandru, V. and Vinay, V.},
TITLE = {On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees},
BOOKTITLE = {Foundations of software technology and theoretical computer science (FSTTCS-96) : 16th conference},
PADDRESS = {Berlin, Germany},
ADDRESS = {Hyderabad, India},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1180},
YEAR = {1996},
PAGES = {64--75},
}
@ARTICLE{Das-Kapoor-Smid97,
AUTHOR = {Das, Gautam and Kapoor, Sanjiv and Smid, Michiel},
EDITOR = {Chandru, V. and Vinay, V.},
JOURNAL = {Algorithmica},
TITLE = {On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees},
BOOKTITLE = {16th Conference on Foundations of Software Technology and Theoretical Computer Science},
ADDRESS = {Berlin, Germany},
PUBLISHER = {Springer},
VOLUME = {19},
ISBN = {0178-4617},
YEAR = {1997},
PAGES = {447--460},
}
@INPROCEEDINGS{DBLP:conf/gi/NaherM90,
AUTHOR = {N{\"a}her, Stefan and Mehlhorn, Kurt},
EDITOR = {Reuter, Andreas},
TITLE = {LEDA - A Library of Efficient Data Types and Algorithms},
BOOKTITLE = {GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender},
PADDRESS = {Berlin, Germany},
ADDRESS = {Stuttgart, Germany},
PUBLISHER = {Springer},
SERIES = {Informatik-Fachberichte},
VOLUME = {257},
ISBN = {3-540-53212-9},
YEAR = {1990},
PAGES = {35--39},
}
@INPROCEEDINGS{DBLP:conf/stacs/Meyer08,
AUTHOR = {Meyer, Ulrich},
EDITOR = {Albers, Susanne and Weil, Pascal and Rochange, Christine},
TITLE = {On Dynamic Breadth-First Search in External-Memory},
BOOKTITLE = {Proc. 25th Annual Symposium on Theoretical Aspects (STACS)},
PADDRESS = {Dagstuhl},
ADDRESS = {Bordeaux, France},
PUBLISHER = {IBFI},
MONTH = {February},
SERIES = {Dagstuhl Seminar Proceedings},
VOLUME = {08001},
ISBN = {978-3-939897-06-4},
YEAR = {2008},
PAGES = {551--560},
}
@ARTICLE{DBLP:journals/corr/abs-1304-8069,
AUTHOR = {Kobel, Alexander and Sagraloff, Michael},
JOURNAL = {arXiv},
TITLE = {Fast Approximate Polynomial Multipoint Evaluation and Applications},
ADDRESS = {Ithaca, NY},
PUBLISHER = {Cornell University Library},
MONTH = {April},
VOLUME = {abs/1304.8069},
YEAR = {2013},
PAGES = {17},
ABSTRACT = {It is well known that, using fast algorithms for polynomial multiplication and
division, evaluation of a polynomial $F\in\mathbb{C}[x]$ of degree $n$ at $n$
complex-valued points can be done with $\tilde{O}(n)$ exact field operations in
$\mathbb{C},$ where $\tilde{O}(\cdot)$ means that we omit polylogarithmic
factors. We complement this result by an analysis of \emph{approximate
multipoint evaluation} of $F$ to a precision of $L$ bits after the binary point
and prove a bit complexity of $\tilde{O} (n(L + \tau + n\Gamma)),$ where
$2^\tau$ and $2^\Gamma,$ with $\tau, \Gamma \in \mathbb{N}_{\ge 1},$ are bounds
on the magnitude of the coefficients of $F$ and the evaluation points,
respectively. In particular, in the important case where the precision demand
dominates the other input parameters, the complexity is soft-linear in $n$ and
$L.$ Our result on approximate multipoint evaluation has some interesting
consequences on the bit complexity of three further approximation algorithms
which all use polynomial evaluation as a key subroutine. This comprises an
algorithm to approximate the real roots of a polynomial, an algorithm for
polynomial interpolation, and a method for computing a Taylor shift of a
polynomial. For all of the latter algorithms, we derive near optimal running
times.},
}
@ARTICLE{DCFS2010,
AUTHOR = {Cooper, Joshua and Doerr, Benjamin and Friedrich, Tobias and Spencer, Joel},
JOURNAL = {Random Structures and Algorithms},
TITLE = {Deterministic Random Walks on Regular Trees},
ADDRESS = {Chichester},
NUMBER = {3},
PUBLISHER = {Wiley},
MONTH = {October},
VOLUME = {37},
ISBN = {1042-9832},
DOI = {10.1002/rsa.20314},
YEAR = {2010},
PAGES = {353--366},
}
@ARTICLE{DDJMRR96,
AUTHOR = {De Simone, Caterina and Diehl, Martin and J{\"u}nger, Michael and Mutzel, Petra and Reinelt, Gerhard and Rinaldi, Giovanni},
JOURNAL = {Journal of Statistical Physics},
TITLE = {Exact Ground States of Two-Dimensional +-J Ising Spin Glasses},
NUMBER = {5/6},
VOLUME = {84},
YEAR = {1996},
PAGES = {1363--1371},
}
@ARTICLE{deBerg-vanKreveld-Schirra1998,
AUTHOR = {de Berg, Marc and van Kreveld, Marc and Schirra, Stefan},
JOURNAL = {Cartography and Geographic Information Systems},
TITLE = {Topologically correct subdivision simplification using the bandwidth criterion},
NUMBER = {4},
PUBLISHER = {American Congress on Surveying and Mapping},
MONTH = {October},
VOLUME = {25},
YEAR = {1998},
PAGES = {243--257},
ABSTRACT = {The line simplification problem is an old and well studied
problem in cartography. Although there are several algorithms to compute a
simplification there seems to be no algorithms that perform line simplification
in the context of other geographical objects. This paper presents a nearly
quadratic time algorithm for the following line simplification problem: Given a
polygonal line, a set of extra points, and a real $\epsilon > 0$, compute a
simplification that guarantees (i) a maximum error $\epsilon$; (ii) that the
extra points remain on the same side of the simplified chain as on the original
chain; and (iii) that the simplified chain has no self-intersections. The
algorithm is applied as the main subroutine for subdivision simplification and
guarantees that the resulting subdivision is topologically correct.},
}
@INPROCEEDINGS{deBerg-vanKreveld-Schirra95,
AUTHOR = {Berg, Marc de and Kreveld, Marc van and Schirra, Stefan},
TITLE = {A new approach to subdivision simplification},
BOOKTITLE = {ACSM/ASPRS Annual Convention \& Exposition Technical Papers},
PADDRESS = {Bethesda, USA},
ADDRESS = {Charlotte, North Carolina, USA},
PUBLISHER = {ACSM},
YEAR = {1995},
PAGES = {79--88},
}
@PROCEEDINGS{deBergSchirra2002,
EDITOR = {de Berg, Marc and Schirra, Stefan},
TITLE = {Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00)},
PADDRESS = {Singapore},
ADDRESS = {Hong Kong University of Science and Technology, China},
NUMBER = {1/2},
PUBLISHER = {World Scientific},
SERIES = {International Journal of Computational Geometry \& Applications},
VOLUME = {12},
ISBN = {0218-1959},
YEAR = {2002},
PAGES = {172},
}
@INPROCEEDINGS{deBergSchirraSoCG2002,
AUTHOR = {de Berg, Marc and Schirra, Stefan},
EDITOR = {de Berg, Marc and Schirra, Stefan},
TITLE = {Guest Editors' Foreword},
BOOKTITLE = {Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00)},
PADDRESS = {Singapore},
ADDRESS = {Hong Kong University of Science and Technology, China},
NUMBER = {1/2},
PUBLISHER = {World Scientific},
SERIES = {International Journal of Computational Geometry \& Applications},
VOLUME = {12},
ISBN = {0218-1959},
YEAR = {2002},
PAGES = {1--2},
}
@INPROCEEDINGS{Dedo-Gergov-Hagerup95,
AUTHOR = {Dedorath, J{\"u}rgen and Gergov, Jordan and Hagerup, Torben},
EDITOR = {Staples, John and Eades, Peter and Katoh, Naoki and Moffat, Alistair},
TITLE = {More Efficient Parallel Flow Algorithms},
BOOKTITLE = {Algorithms and Computation: 6th International Symposium (ISAAC95)},
PADDRESS = {Berlin},
ADDRESS = {Cairns, Australia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1004},
YEAR = {1995},
PAGES = {234--243},
}
@INPROCEEDINGS{Dementiev2004SearchTree,
AUTHOR = {Dementiev, Roman and Kettner, Lutz and Mehnert, Jens and Sanders, Peter},
EDITOR = {Arge, Lars and Italiano, Giuseppe F. and Sedgewick, Robert},
TITLE = {Engineering a Sorted List Data Structure for 32 Bit Key},
BOOKTITLE = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04)},
PADDRESS = {Philadelphia, USA},
ADDRESS = {New Orleans, LA, USA},
PUBLISHER = {SIAM},
MONTH = {January},
ISBN = {0-89871-564-4},
YEAR = {2004},
PAGES = {142--151},
ABSTRACT = {Search tree data structures like van Emde Boas trees are a theoretically
attractive alternative to comparison based search trees because they have
better asymptotic performance for small integer keys and large inputs. This
paper studies their practicability using 32 bit keys as an example. While
direct implementations of van Emde Boas trees cannot compete with good
implementations of comparison based data structures, our tuned data structure
significantly outperforms comparison based implementations for searching and
shows at least comparable performance for insertion and deletion.},
}
@INPROCEEDINGS{DeMeRa1999,
AUTHOR = {Dey, Tamal K. and Mehlhorn, Kurt and Ramos, Edgar A.},
TITLE = {Curve reconstruction: Connecting dots with good reason},
BOOKTITLE = {Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99)},
PADDRESS = {New York, USA},
ADDRESS = {Miami Beach, Florida},
PUBLISHER = {ACM},
YEAR = {1999},
PAGES = {197--206},
ABSTRACT = {Curve reconstruction algorithms are supposed to reconstruct curves from point
samples. Recent papers present algorithms that come with a guarantee: Given a
sufficiently dense sample of a closed smooth curve, the algorithms construct
the correct polygonal reconstruction. Nothing is claimed about the output of
the algorithms, if the input is not a dense sample of a closed smooth curve,
e.g., a sample of a curve with endpoints. We present an algorithm that comes
with a guarantee for any set $P$ of input points. The algorithm constructs a
polygonal reconstruction $G$ and a smooth curve $\Gamma$ that justifies $G$
as the reconstruction from $P$.},
}
@INPROCEEDINGS{DemSan03,
AUTHOR = {Dementiev, Roman and Sanders, Peter},
TITLE = {Asynchronous Parallel Disk Sorting},
BOOKTITLE = {Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03)},
ORGANIZATION = {ACM},
PADDRESS = {New York, USA},
ADDRESS = {San Diego, USA},
PUBLISHER = {ACM},
ISBN = {1581136617},
YEAR = {2003},
PAGES = {138--148},
}
@ARTICLE{Deng-Mahajan97,
AUTHOR = {Deng, Xiaotie and Mahajan, Sanjeev},
JOURNAL = {SIAM Journal on Computing},
TITLE = {The Cost of Derandomization: Computability or Competitiveness},
NUMBER = {3},
VOLUME = {26},
YEAR = {1997},
PAGES = {786--802},
}
@INPROCEEDINGS{Denny03,
AUTHOR = {Denny, Markus},
EDITOR = {Brunet, Pere and Fellner, Dieter W.},
TITLE = {Solving geometric optimization problems using graphics hardware},
BOOKTITLE = {EUROGRAPHICS 2003 : the European Association for Computer Graphics 24th Annual Conference},
ORGANIZATION = {European Association for Computer Graphics},
PADDRESS = {Oxford, UK},
ADDRESS = {Granada, Spain},
PUBLISHER = {Blackwell},
SERIES = {Computer Graphics Forum},
VOLUME = {22},
YEAR = {2003},
PAGES = {441--451},
}
@MASTERSTHESIS{Denny94,
AUTHOR = {Denny, Markus},
TITLE = {{Monotones H{\"a}ufen und Token Distribution auf dem Hypercube}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1994},
}
@UNPUBLISHED{DeSterckDescent,
AUTHOR = {De Sterck, Hans},
TITLE = {Steepest Descent Preconditioning for Nonlinear GMRES Optimization},
YEAR = {2012},
NOTE = {accepted for "Numerical Linear Algebra with Applications"},
}
@ARTICLE{DeSterckNGMRES,
AUTHOR = {De Sterck, Hans},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {A Nonlinear {GMRES} Optimization Algorithm for Canonical Tensor Decomposition},
ADDRESS = {Philadelphia, PA},
PUBLISHER = {SIAM},
VOLUME = {34},
ISBN = {1064-8275},
DOI = {10.1137/110835530},
YEAR = {2012},
PAGES = {A1351--A1379},
}
@ARTICLE{DeSterckSVD,
AUTHOR = {De Sterck, Hans},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs},
ADDRESS = {Philadelphia, PA},
NUMBER = {4},
PUBLISHER = {SIAM},
VOLUME = {34},
ISBN = {1064-8275},
DOI = {10.1137/110823316},
YEAR = {2012},
PAGES = {A2092--A2117},
}
@INPROCEEDINGS{DF2006,
AUTHOR = {Doerr, Benjamin and Friedrich, Tobias},
EDITOR = {Asano, Tetsuo},
TITLE = {Deterministic Random Walks on the Two-Dimensional Grid},
BOOKTITLE = {Algorithms and Computation : 17th International Symposium, ISAAC 2006},
PADDRESS = {Berlin, Germany},
ADDRESS = {Kolkata, India},
PUBLISHER = {Springer},
MONTH = {December},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4288},
ISBN = {3-540-49694-6},
YEAR = {2006},
PAGES = {474--483},
ABSTRACT = {Deterministic and randomized balancing schemes are used to distribute workload
evenly in networks. In this paper, we compare two very general ones: The random
walk and the (deterministic) Propp machine. Roughly speaking, we show that on
the two-dimensional grid, the Propp machine always has the same number of
tokens on a node as does the random walk in expectation, apart from an additive
error of less than eight. This constant is independent of the total number of
tokens and the runtime of the two processes. However, we also show that it
makes a difference whether the Propp machine serves the neighbors in a circular
or non-circular order.},
}
@ARTICLE{DF2009,
AUTHOR = {Doerr, Benjamin and Friedrich, Tobias},
JOURNAL = {Combinatorics, Probability and Computing},
TITLE = {Deterministic Random Walks on the Two-Dimensional Grid},
ADDRESS = {Cambridge},
NUMBER = {1-2},
PUBLISHER = {Cambridge University Press},
VOLUME = {18},
ISBN = {0963-5483},
DOI = {10.1017/S0963548308009589},
YEAR = {2009},
PAGES = {123--144},
}
@ARTICLE{DF2010b,
AUTHOR = {Doerr, Benjamin and Fouz, Mahmoud},
JOURNAL = {Information Processing Letters},
TITLE = {Quasi-random rumor spreading: {Reducing} randomness can be costly},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {5},
PUBLISHER = {Elsevier},
MONTH = {February},
VOLUME = {111},
ISBN = {0020-0190},
DOI = {10.1016/j.ipl.2010.11.006},
YEAR = {2011},
PAGES = {227--230},
}
@INPROCEEDINGS{DFF11,
AUTHOR = {Doerr, Benjamin and Fouz, Mahmoud and Friedrich, Tobias},
EDITOR = {Ne{\v{s}}et{\v{r}}il, Jarik and Gy{\H{o}}ri, Ervin and Sali, Attila},
JOURNAL = {Electronic Notes in Discrete Mathematics},
TITLE = {Social Networks Spread Rumors in Sublogarithmic Time},
BOOKTITLE = {The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011},
PADDRESS = {Amsterdam},
ADDRESS = {Budapaest},
PUBLISHER = {Elsevier},
SERIES = {Electronic Notes in Discrete Mathematics},
VOLUME = {38},
DOI = {10.1016/j.endm.2011.09.050},
YEAR = {2011},
PAGES = {303--308},
}
@INPROCEEDINGS{DFKM08,
AUTHOR = {Dumitriu, Daniel and Funke, Stefan and Kutz, Martin and Milosavljevic, Nikola},
TITLE = {How much {G}eometry it takes to {R}econstruct a 2-{M}anifold in $R^3$},
BOOKTITLE = {10th Workshop on Algorithm Engineering and Experiments (ALENEX-2008)},
ORGANIZATION = {ACM-SIAM},
PADDRESS = {Philadelphia, USA},
ADDRESS = {San Francisco, USA},
PUBLISHER = {SIAM},
YEAR = {2008},
PAGES = {65--74},
ABSTRACT = {Known algorithms for reconstructing a 2-manifold from
a point sample in R3 are naturally based on deci-
sions/predicates that take the geometry of the point sample
into account. Facing the always present problem of round-off
errors that easily compromise the exactness of those predi-
cate decisions, an exact and robust implementation of these
algorithms is far from being trivial and typically requires
the employment of advanced datatypes for exact arithmetic
as provided by libraries like CORE, LEDA or GMP. In this
paper we present a new reconstruction algorithm, one of
whose main novelties is to throw away geometry informa-
tion early on in the reconstruction process and to mainly
operate combinatorially on a graph structure. As such it
is less susceptible to robustness problems due to round-off
errors and also benefits from not requiring expensive exact
arithmetic by faster running times. A more theoretical view
on our algorithm including correctness proofs under suitable
sampling conditions can be found in a companion paper [3].},
}
@INPROCEEDINGS{DFKM2008b,
AUTHOR = {Dumitriu, Daniel and Funke, Stefan and Kutz, Martin and Milosavljevic, Nikola},
EDITOR = {Gudmundsson, Joachim},
TITLE = {On the Locality of Extracting a 2-Manifold in $R^3$},
BOOKTITLE = {11th Scandinavian Workshop on Algorithm Theory (SWAT-2008)},
PADDRESS = {Heidelberg, Germany},
ADDRESS = {G{\"o}teborg, Sweden},
PUBLISHER = {Springer},
MONTH = {July},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5124},
ISBN = {978-3-540-69900-2},
YEAR = {2008},
PAGES = {270--281},
ABSTRACT = {Algorithms for reconstructing a 2-manifold from a point sample in R^3 based on
Voronoi-ﬁltering like CRUST or CoCone still
require -- after identifying a set of candidate triangles -- a so-called
manifold extraction step which identiﬁes a subset of the candidate triangles to
form the ﬁnal reconstruction surface. Non-locality of the latter step is caused
by so-called slivers -- conﬁgurations of four almost cocircular points having
an empty circumsphere with center close to the manifold surface.
We prove that under a certain mild condition -- local uniformity -- which
typically holds in practice but can also be enforced theoretically, one can
compute a reconstruction using an algorithm whose decisions about the
adjacencies of a point only depend on nearby points.
While the theoretical proof requires an extremely high sampling density, our
prototype implementation, described in a companion paper, performs well on
typical sample sets. Due to its local mode of computation, it might be
particularly suited for parallel computing or external memory scenarios.},
}
@ARTICLE{DFKM2009,
AUTHOR = {Dumitriu, Daniel and Funke, Stefan and Kutz, Martin and Milosavljevic, Nikola},
JOURNAL = {ACM Journal of Experimental Algorithms},
TITLE = {How Much Geometry It Takes to Reconstruct a 2-Manifold in {R} 3},
ADDRESS = {New York, NY},
PUBLISHER = {ACM},
MONTH = {May},
VOLUME = {14},
ISBN = {1084-6654},
DOI = {10.1145/1498698.1537597},
YEAR = {2009},
PAGES = {2.2:1--2.2:17},
ABSTRACT = {Known algorithms for reconstructing a 2-manifold from a point sample in R3 are
naturally based
on decisions/predicates that take the geometry of the point sample into
account. Facing the always
present problem of round-off errors that easily compromise the exactness of
those predicate
decisions, an exact and robust implementation of these algorithms is far from
being trivial and
typically requires employment of advanced datatypes for exact arithmetic, as
provided by libraries
like CORE, LEDA, or GMP. In this article, we present a new reconstruction
algorithm, one whose
main novelties is to throw away geometry information early on in the
reconstruction process and to
mainly operate combinatorially on a graph structure. More precisely, our
algorithm only requires
distances between the sample points and not the actual embedding in R3. As
such, it is less susceptible
to robustness problems due to round-off errors and also benefits from not
requiring expensive
exact arithmetic by faster running times. A more theoretical view on our
algorithm including correctness
proofs under suitable sampling conditions can be found in a companion article.},
}
@INPROCEEDINGS{dfkmsssw2003,
AUTHOR = {Dhiflaoui, Marcel and Funke, Stefan and Kwappik, Carsten and Mehlhorn, Kurt and Seel, Michael and Sch{\"o}mer, Elmar and Schulte, Ralph and Weber, Dennis},
TITLE = {Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?},
BOOKTITLE = {Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03)},
ORGANIZATION = {Association of Computing Machinery (ACM); Society for Industrial and Applied Mathematics (SIAM)},
PADDRESS = {New York, USA},
ADDRESS = {Baltimore, USA},
PUBLISHER = {ACM},
MONTH = {January},
YEAR = {2003},
PAGES = {255--256},
}
@INPROCEEDINGS{DFKO05,
AUTHOR = {Doerr, Benjamin and Friedrich, Tobias and Klein, Christian and Osbild, Ralf},
EDITOR = {Erlebach, Thomas and Persiano, Pino},
TITLE = {Rounding of Sequences and Matrices, with Applications},
BOOKTITLE = {Third Workshop on Approximation and Online Algorithms (WAOA 2005)},
PADDRESS = {Heidelberg, Germany},
ADDRESS = {Palma de Mallorca, Spain},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3879},
ISBN = {3-540-32207-8},
YEAR = {2005},
PAGES = {96--109},
ABSTRACT = {We show that any real matrix can be rounded to an integer matrix in such a way
that the rounding errors of all row sums are less than one, and the rounding
errors of all column sums as well as all sums of consecutive row entries are
less than two. Such roundings can be computed in linear time. This extends and
improves previous results on rounding sequences and matrices in several
directions. It has particular applications in just-in-time scheduling, where
balanced schedules on machines with negligible switch over costs are sought
after. Here we extend existing results to multiple machines and non-constant
production rates.},
}
@INPROCEEDINGS{DFKO06,
AUTHOR = {Doerr, Benjamin and Friedrich, Tobias and Klein, Christian and Osbild, Ralf},
EDITOR = {Arge, Lars and Freivalds, Rusins},
TITLE = {Unbiased Matrix Rounding},
BOOKTITLE = {Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory},
PADDRESS = {Berlin, Germany},
ADDRESS = {Riga, Latvia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4059},
ISBN = {978-3-540-35753-7},
YEAR = {2006},
PAGES = {102--112},
ABSTRACT = {We show several ways to round a real matrix to an integer one in such a way
that the rounding errors in all rows and columns as well as the whole matrix
are less than one. This is a classical problem with applications in many
fields, in particular, statistics.
We improve earlier solutions of different authors in two ways. For rounding $m
\times n$ matrices, we reduce the runtime from $O( (m n)^2 ) $ to $O(m n \log(m
n))$. Second, our roundings also have a rounding error of less than one in all
initial intervals of rows and columns. Consequently, arbitrary intervals have
an error of at most two. This is particularly useful in the statistics
application of controlled rounding.
The same result can be obtained via (dependent) randomized rounding. This has
the additional advantage that the rounding is unbiased, that is, for all
entries $y_{ij}$ of our rounding, we have $E(y_{ij}) = x_{ij}$, where $x_{ij}$
is the corresponding entry of the input matrix.},
}
@UNPUBLISHED{DFKP,
AUTHOR = {Dessmark, Anders and Fraigniaud, Pierre and Kowalski, Dariusz and Pelc, Andrzej},
TITLE = {Deterministic rendezvous in graphs},
YEAR = {2006},
NOTE = {Invited to Algorithmica.
Part of this work was published in ISAAC 2004.},
}
@ARTICLE{DFKP2006,
AUTHOR = {Dessmark, Anders and Fraigniaud, Pierre and Kowalski, Dariusz and Pelc, Andrzej},
JOURNAL = {Algorithmica},
TITLE = {Deterministic Rendezvous in Graphs},
NUMBER = {1},
VOLUME = {46},
ISBN = {0178-4617},
YEAR = {2006},
PAGES = {69--96},
NOTE = {Part of this work was published in ISAAC 2004.},
ABSTRACT = {Two mobile agents having distinct identifiers and located in nodes of an
unknown anonymous connected graph, have to meet at some node of the graph. We
seek fast deterministic algorithms for this rendezvous problem, under two
scenarios: simultaneous startup, when both agents start executing the algorithm
at the same time, and arbitrary startup, when starting times of the agents are
arbitrarily decided by an adversary. The measure of performance of a rendezvous
algorithm is its cost: for a given initial location of agents in a graph, this
is the number of steps since the startup of the later agent until rendezvous is
achieved. We first show that rendezvous can be completed at cost O(n + log l)
on any n-node tree, where l is the smaller of the two identifiers, even with
arbitrary startup. This complexity of the cost cannot be improved for some
trees, even with simultaneous startup. Efficient rendezvous in trees relies on
fast network exploration and cannot be used when the graph contains cycles. We
further study the simplest such network, i.e., the ring. We prove that, with
simultaneous startup, optimal cost of rendezvous on any ring is Θ(D log l),
where D is the initial distance between agents. We also establish bounds on
rendezvous cost in rings with arbitrary startup. For arbitrary connected
graphs, our main contribution is a deterministic rendezvous algorithm with cost
polynomial in n, τ and log l, where τ is the difference between startup times
of the agents. We also show a lower bound Ω (n2) on the cost of rendezvous in
some family of graphs. If simultaneous startup is assumed, we construct a
generic rendezvous algorithm, working for all connected graphs, which is
optimal for the class of graphs of bounded degree, if the initial distance
between agents is bounded.},
}
@INPROCEEDINGS{DFKS09,
AUTHOR = {Doerr, Benjamin and Friedrich, Tobias and K{\"u}nnemann, Marvin and Sauerwald, Thomas},
EDITOR = {Finocchi, Irene and Hershberger, John},
TITLE = {Quasirandom Rumor Spreading: An Experimental Analysis},
BOOKTITLE = {2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX)},
PADDRESS = {Philadelphia, Pa.},
ADDRESS = {New York, USA},
PUBLISHER = {SIAM},
ISBN = {978-0-898719-30-7},
YEAR = {2009},
PAGES = {145--153},
}
@INPROCEEDINGS{DFR2001,
AUTHOR = {Dey, Tamal K. and Funke, Stefan and Ramos, Edgar A.},
TITLE = {Surface Reconstruction in almost Linear Time under Locally Uniform Sampling},
BOOKTITLE = {Proceedings of the 17th European Workshop on Computational Geometry (EWCG-01)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Berlin, Germany},
PUBLISHER = {Freie Universit{\"a}t Berlin},
MONTH = {March},
YEAR = {2001},
PAGES = {129--132},
}
@INPROCEEDINGS{DG2010a,
AUTHOR = {Doerr, Benjamin and Goldberg, Leslie Ann},
EDITOR = {Schaefer, Robert and Cotta, Carlos and Kolodziej, Joanna and Rudolph, G{\"u}nter},
TITLE = {Drift Analysis with Tail Bounds},
BOOKTITLE = {Parallel Problem Solving from Nature – PPSN XI. - Pt. 1},
PADDRESS = {Berlin},
ADDRESS = {Krakow, Poland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6238},
ISBN = {978-3-642-15843-8},
DOI = {10.1007/978-3-642-15844-5_18},
YEAR = {2010},
PAGES = {174--183},
}
@INPROCEEDINGS{DG2010b,
AUTHOR = {Doerr, Benjamin and Goldberg, Leslie Ann},
EDITOR = {Schaefer, Robert and Cotta, Carlos and Kolodziej, Joanna and Rudolph, G{\"u}nter},
TITLE = {Adaptive Drift Analysis},
BOOKTITLE = {Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1},
PADDRESS = {Berlin},
ADDRESS = {Krakow, Poland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6238},
ISBN = {978-3-642-15843-8},
DOI = {10.1007/978-3-642-15844-5_4},
YEAR = {2010},
PAGES = {32--41},
}
@ARTICLE{DGW10,
AUTHOR = {Doerr, Benjamin and Gnewuch, Michael and Wahlstr{\"o}m, Magnus},
JOURNAL = {Journal of Complexity},
TITLE = {Algorithmic construction of low-discrepancy point sets via dependent randomized rounding},
ADDRESS = {Amsterdam},
NUMBER = {5},
PUBLISHER = {Elsevier},
VOLUME = {26},
ISBN = {0885-064X},
DOI = {10.1016/j.jco.2010.03.004},
YEAR = {2010},
PAGES = {490--507},
}
@INPROCEEDINGS{DHL2009,
AUTHOR = {Doerr, Benjamin and Huber, Anna and Levavi, Ariel},
EDITOR = {Dong, Yingfei and Du, Ding-Zhu and Ibarra, Oscar},
TITLE = {Strong robustness of randomized rumor spreading protocols},
BOOKTITLE = {Algorithms and Computation : 20th International Symposium, ISAAC 2009},
PADDRESS = {Berlin},
ADDRESS = {Hawaii, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5878},
ISBN = {978-3-642-10630-9},
DOI = {10.1007/978-3-642-10631-6_82},
YEAR = {2009},
PAGES = {812--821},
NOTE = {Full version available from arXiv:1001.3056},
ABSTRACT = {Randomized rumor spreading is a classical protocol to disseminate information
across a network. At SODA 2008, a quasirandom version of this protocol was
proposed and competitive bounds for its run-time were proven. This prompts the
question: to what extent does the quasirandom protocol inherit the second
principal advantage of randomized rumor spreading, namely robustness against
transmission failures?
In this paper, we present a result precise up to $(1 \pm o(1))$ factors. We
limit ourselves to the network in which every two vertices are connected by a
direct link. Run-times accurate to their leading constants are unknown for all
other non-trivial networks.
We show that if each transmission reaches its destination with a probability
of $p \in (0,1]$, after
$(1+\e)\left(\frac{1}{\log_2(1+p)}\log_2n+\frac{1}{p}\ln n\right)$ rounds the
quasirandom protocol has informed all $n$ nodes in the network with probability
at least $1-n^{-p\e/40}$. Note that this is faster than the intuitively natural
$1/p$ factor increase over the run-time of approximately $\log_2 n + \ln n $
for the non-corrupted case.
We also provide a corresponding lower bound for the classical model. This
demonstrates that the quasirandom model is at least as robust as the fully
random model despite the greatly reduced degree of independent randomness.},
}
@UNPUBLISHED{DHS2011,
AUTHOR = {De Sterck, Hans and Henson, Van Emden and Sanders, Geoff},
TITLE = {Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk Ranking},
YEAR = {2011},
NOTE = {to appear in Computing and Informatics},
}
@MASTERSTHESIS{Dickert2000,
AUTHOR = {Dickert, Peter},
TITLE = {{Berechnung von Einfach-und Zweifachzusammenhangskomponenten auf einer PRAM}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {February},
YEAR = {2000},
}
@ARTICLE{DiedrichHarrenJansenThoeleThomas2008,
AUTHOR = {Diedrich, Florian and Harren, Rolf and Jansen, Klaus and Th{\"o}le, Ralf and Thomas, Henning},
JOURNAL = {Journal of Science and Technology},
TITLE = {Approximation Algorithms for 3D Orthogonal Knapsack},
ADDRESS = {Berlin / Heidelberg},
NUMBER = {5},
PUBLISHER = {Springer},
MONTH = {November},
VOLUME = {23},
ISBN = {1860-4749},
DOI = {10.1007/s11390-008-9170-7},
YEAR = {2008},
PAGES = {749--762},
ABSTRACT = {We study non-overlapping axis-parallel packings of 3D boxes with profits into a
dedicated bigger box where rotation is either forbidden or permitted; we wish
to maximize the total profit. Since this optimization problem is NP-hard, we
focus on approximation algorithms. We obtain fast and simple algorithms for the
non-rotational scenario with approximation ratios $9+\epsilon$ and $8+\epsilon$
as well as an algorithm with approximation ratio $7+\epsilon$ that uses more
sophisticated techniques; these are the smallest approximation ratios known for
this problem. Furthermore, we show how the used techniques can be adapted to
the case where rotation by $90^{\circ}$ either around the $z$-axis or around
all axes is permitted, where we obtain algorithms with approximation ratios
$6+\epsilon$ and $5+\epsilon$, respectively. Finally our methods yield a 3D
generalization of a packability criterion and a strip packing algorithm with
absolute approximation ratio $\textfrac{29}{4}$, improving the previously best
known result of $\textfrac{45}{4}$.},
}
@INPROCEEDINGS{DieKehNeu2008,
AUTHOR = {Diedrich, Florian and Kehden, Britta and Neumann, Frank},
EDITOR = {Berghammer, Rudolf and M{\"o}ller, Bernhard and Struth, Georg},
TITLE = {Multi-objective Problems in Terms of Relational Algebra},
BOOKTITLE = {Relations and Kleene Algebra in Computer Science 2008},
PADDRESS = {Berlin},
ADDRESS = {Frauenw{\"o}rth, Germany},
PUBLISHER = {Springer},
MONTH = {April},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4988},
YEAR = {2008},
PAGES = {84--98},
}
@INPROCEEDINGS{DieNeuCEC2008,
AUTHOR = {Diedrich, Florian and Neumann, Frank},
TITLE = {Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems},
BOOKTITLE = {IEEE Congress on Evolutionary Computation 2008},
PADDRESS = {Vancouver, CA},
ADDRESS = {Hong Kong},
PUBLISHER = {IEEE},
YEAR = {2008},
PAGES = {3828--3833},
}
@MASTERSTHESIS{Diete95,
AUTHOR = {Diete, Iris},
TITLE = {{Berechnung der Kontaktoberfl{\"a}che eines Molek{\"u}ls}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1995},
}
@ARTICLE{DigHalf2003,
AUTHOR = {Doerr, Benjamin},
JOURNAL = {Eurocomb '03},
TITLE = {Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning},
VOLUME = {3},
YEAR = {2006},
PAGES = {95--99},
}
@INPROCEEDINGS{Diks-Hagerup96,
AUTHOR = {Diks, Krzysztof and Hagerup, Torben},
TITLE = {More general parallel tree contraction: Register allocation and broadcasting in a tree},
BOOKTITLE = {Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, Cadenabbia, Italy,Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop},
PADDRESS = {Berlin, Germany},
ADDRESS = {Cadenabbia, Italy},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1197},
YEAR = {1996},
PAGES = {126--140},
}
@ARTICLE{DiksHagerup1998,
AUTHOR = {Diks, Krzysztof and Hagerup, Torben},
JOURNAL = {Theoretical Computer Science},
TITLE = {More general parallel tree contraction: Register allocation and broadcasting in a tree},
NUMBER = {1},
PUBLISHER = {Elsevier},
VOLUME = {203},
ISBN = {0304-3975},
YEAR = {1998},
PAGES = {3--29},
}
@ARTICLE{Dimitrios2007,
AUTHOR = {Michail, Dimitrios},
JOURNAL = {Theoretical Computer Science},
TITLE = {Reducing rank-maximal to maximum weight matching},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {1-2},
PUBLISHER = {Elsevier},
MONTH = {December},
VOLUME = {389},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2007.08.004},
YEAR = {2007},
PAGES = {125--132},
ABSTRACT = {Given a bipartite graph G(V,E), where |V|=n,|E|=m and a partition of the edge
set into r≤m disjoint subsets , which are called ranks, the rank-maximal
matching problem is to find a matching M of G such that |M∩E1| is maximized and
given that |M∩E1| is maximized, |M∩E2| is also maximized, and so on. Such a
problem arises as an optimization criteria over a possible assignment of a set
of applicants to a set of posts. The matching represents the assignment and the
ranks on the edges correspond to a ranking of the posts submitted by the
applicants.
The rank-maximal matching problem and several other optimization variants, e.g.
fair matching and maximum cardinality rank-maximal matching, can be solved by a
reduction to the weight matching problem in time . Recently, Irving et al.
developed a combinatorial approach which improves the running time for the
rank-maximal matching problem to . They raised the open questions on (a)
whether such a running time can be achieved by the weight matching reduction
and (b) whether such a running time can be achieved for the other variants of
the problem.
In this work we show how the reduction to the weight matching problem can also
be used to achieve the same running time. Our algorithm is simpler and more
intuitive. },
}
@ARTICLE{DinitzGargGoemans1999,
AUTHOR = {Dinitz, Yefim and Garg, Naveen and Goemans, Michel X.},
JOURNAL = {Combinatorica},
TITLE = {On the single-source unsplittable flow problem},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {19},
ISBN = {0209-9683},
YEAR = {1999},
PAGES = {17--41},
}
@ARTICLE{DinitzZeev1999,
AUTHOR = {Dinitz, Yefim and Nutov, Zeev},
JOURNAL = {Journal of Algorithms},
TITLE = {A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs},
NUMBER = {1},
PUBLISHER = {Academic Press},
VOLUME = {32},
YEAR = {1999},
PAGES = {21--30},
}
@MASTERSTHESIS{Dipl03/Ding,
AUTHOR = {Ding, Wei},
TITLE = {Geometric Rounding without changing the Topology},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {December},
YEAR = {2003},
}
@MASTERSTHESIS{Dipl03/Eigenwillig,
AUTHOR = {Eigenwillig, Arno},
TITLE = {Exact Arrangement Computation for Cubic Curves},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {October},
YEAR = {2003},
}
@MASTERSTHESIS{Dipl03/Fontaine,
AUTHOR = {Fontaine, Marc},
TITLE = {Computing the Filtration Efficiency of Shape-Index-Filters for Approximate String Matching},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {November},
YEAR = {2003},
}
@MASTERSTHESIS{Dipl04/Berberich,
AUTHOR = {Berberich, Eric},
TITLE = {Exact Arrangements of Quadric Intersection Curves},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {March},
YEAR = {2004},
}
@MASTERSTHESIS{DiplPohl06,
AUTHOR = {Pohl, Sebastian},
TITLE = {Exact Integer Linear Programming with Bounded Variables in a Branch- and Cut Algorithm},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {March},
YEAR = {2006},
}
@MASTERSTHESIS{DiplWeber06,
AUTHOR = {Weber, Dennis},
TITLE = {Solving large Sparse Linear Systems exactly},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {August},
YEAR = {2006},
}
@PHDTHESIS{Diss06Dementiev,
AUTHOR = {Dementiev, Roman},
TITLE = {Algorithm Engineering for Large Data Sets},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
MONTH = {December},
YEAR = {2006},
NOTE = {http://frweb.cs.uni-sb.de/dissdaten/Dissertation_3650_Deme_Roma_2006.pdf},
}
@PHDTHESIS{Diss06Hach,
AUTHOR = {Hachenberger, Peter},
TITLE = {Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
MONTH = {December},
YEAR = {2006},
}
@PHDTHESIS{DissReichel06,
AUTHOR = {Reichel, Joachim},
TITLE = {Combinatorial Approaches for the Trunk Packing Problem},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
MONTH = {July},
YEAR = {2006},
}
@INPROCEEDINGS{Djidjev-Pantziou-Zaro-1-95,
AUTHOR = {Djidjev, Hristo N. and Pantziou, Grammati E. and Zaroliagis, Christos},
EDITOR = {Mayr, Ernst W. and Puech, Claude},
TITLE = {On-line and Dynamic Algorithms for Shortest Path Problems},
BOOKTITLE = {STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science},
PADDRESS = {Berlin},
ADDRESS = {Munich, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {900},
YEAR = {1995},
PAGES = {193--204},
}
@INPROCEEDINGS{Djidjev-Pantziou-Zaro-2-95,
AUTHOR = {Djidjev, Hristo N. and Pantziou, Grammati E. and Zaroliagis, Christos},
EDITOR = {Reichel, Horst},
TITLE = {Fast Algorithms for Maintaining Shortest Paths},
BOOKTITLE = {Fundamentals of Computation Theory: 10th International Conference (FCT95)},
PADDRESS = {Berlin},
ADDRESS = {Dresden, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {965},
YEAR = {1995},
PAGES = {191--200},
}
@ARTICLE{DjidjevPantziouZaroliagis2000,
AUTHOR = {Djidjev, Hristo N. and Pantziou, G. E. and Zaroliagis, Christos},
JOURNAL = {Algorithmica},
TITLE = {Improved algorithms for dynamic shortest paths},
ADDRESS = {New York, USA},
NUMBER = {4},
PUBLISHER = {Springer},
VOLUME = {28},
YEAR = {2000},
PAGES = {367--389},
}
@ARTICLE{DK2012,
AUTHOR = {Duan, Ran and Mehlhorn, Kurt},
JOURNAL = {arXiv},
TITLE = {A Combinatorial Polynomial Algorithm for the Linear {A}rrow-{D}ebreu Market},
ADDRESS = {Ithaca, NY},
PUBLISHER = {Cornell University Library},
MONTH = {December},
VOLUME = {abs/1212.0979v1},
YEAR = {2012},
PAGES = {1--8},
}
@INPROCEEDINGS{DKMS05,
AUTHOR = {Dementiev, Roman and K{\"a}rkk{\"a}inen, Juha and Mehnert, Jens and Sanders, Peter},
EDITOR = {Demetrescu, Camil and Sedgewick, Robert and Tamassia, Roberto},
TITLE = {Better External Memory Suffix Array Construction},
BOOKTITLE = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005)},
ORGANIZATION = {Society for Industrial and Applied Mathematics (SIAM), ACM Special Interest Group on Algorithms and Computation Theory (SIGACT)},
PADDRESS = {Philadelphia, USA},
ADDRESS = {Vancouver, British Columbia, Canada},
PUBLISHER = {SIAM},
MONTH = {January},
ISBN = {0-89871-596-2},
YEAR = {2005},
PAGES = {86--97},
ABSTRACT = {Suffix arrays are a simple and powerful data structure for text processing
that can be used for full text indexes, data compression, and many
other applications in particular in bioinformatics.
However, so far it looked prohibitive to build suffix arrays
for huge inputs that do not fit into main memory.
This paper presents design, analysis, implementation, and
experimental evaluation of
several new and improved algorithms for suffix array construction.
The algorithms are asymptotically optimal in the worst case
or on the average. Our implementation can construct
suffix arrays for inputs of up to 4GByte in hours
on a low cost machine where
all previous implementations we are aware of would fail or take days.
We also present a simple and efficient external algorithm for checking
whether an array of indexes is a suffix array.
As a tool of possible independent interest we present a systematic way
to design, analyze, and implement \emph{pipelined}
algorithms.},
}
@INPROCEEDINGS{DKW2011,
AUTHOR = {Doerr, Benjamin and K{\"u}nnemann, Marvin and Wahlstr{\"o}m, Magnus},
EDITOR = {M{\"u}ller-Hannemann, Matthias and Werneck, Renato},
TITLE = {Dependent Randomized Rounding: {The} Bipartite Case},
BOOKTITLE = {2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX)},
PADDRESS = {Philadelphia, PA},
ADDRESS = {San Francisco, California, USA},
PUBLISHER = {SIAM},
ISBN = {978-0-898719-31-4},
YEAR = {2011},
PAGES = {96--106},
}
@INPROCEEDINGS{DLMNOPSW2012,
AUTHOR = {Cygan, Marek and Dell, Holger and Lokshtanov, Daniel and Marx, Daniel and Nederlof, Jesper and Okamoto, Yoshio and Paturi, Ramamohan and Saurabh, Saket and Wahlstr{\"o}m, Magnus},
TITLE = {On Problems as Hard as {CNF-SAT}},
BOOKTITLE = {2012 IEEE 27th Conference on Computational Complexity (CCC 2012)},
PADDRESS = {Piscataway, NJ},
ADDRESS = {Porto, Portugal},
PUBLISHER = {IEEE},
ISBN = {978-1-4673-1663-7},
DOI = {10.1109/CCC.2012.36},
YEAR = {2012},
PAGES = {74--84},
}
@ARTICLE{DMSW2010,
AUTHOR = {De Sterck, Hans and Miller, Killian and Sanders, Geoff and Winlaw, Manda},
JOURNAL = {SIAM Journal on Scientific Computing},
TITLE = {Recursively accelerated multilevel aggregation for {Markov} chains},
ADDRESS = {Philadelphia, Pa.},
NUMBER = {3},
PUBLISHER = {SIAM},
VOLUME = {32},
DOI = {10.1137/090770114},
YEAR = {2011},
PAGES = {1652--1671},
}
@INPROCEEDINGS{Dobkin-Gunopulos96,
AUTHOR = {Dobkin, David P. and Gunopulos, Dimitrios},
EDITOR = {Lin, Ming C. and Manocha, Dinesh},
TITLE = {Geometric problems in machine learning},
BOOKTITLE = {Applied Computational Geometry: Towards Geometric Engineering (FCRC96 Workshop, WACG96)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Philadelphia, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1148},
YEAR = {1996},
PAGES = {121--132},
}
@INPROCEEDINGS{Doe-Joh-Koe-Neu-The:c:10:APSPCrossover,
AUTHOR = {Doerr, Benjamin and Johannsen, Daniel and K{\"o}tzing, Timo and Neumann, Frank and Theile, Madeleine},
EDITOR = {Schaefer, Robert and Cotta, Carlos and Kolodziej, Joanna and Rudolph, G{\"u}nter},
TITLE = {More Effective Crossover Operators for the All-Pairs Shortest Path Problem},
BOOKTITLE = {Parallel Problem Solving from Nature - PPSN XI. - Pt. 1},
PADDRESS = {Berlin},
ADDRESS = {Krakow, Poland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6238},
ISBN = {978-3-642-15843-8},
DOI = {10.1007/978-3-642-15844-5_19},
YEAR = {2010},
PAGES = {184--193},
ABSTRACT = {The All-Pairs Shortest Path problem is the first non-artificial problem for
which it was shown that adding crossover can significantly speed up a
mutation-only evolutionary algorithm. Recently, the analysis of this algorithm
was refined and it was shown to have an expected optimization time of
$\Theta(n^{3.25}(\log n)^{0.25})$.
In this work, we study two variants of the algorithm. These are based on two
central concepts in recombination, \emph{repair mechanisms} and \emph{parent
selection}. We show that repairing infeasible offspring leads to an improved
expected optimization time of $\mathord{O}(n^{3.2}(\log n)^{0.2})$.
Furthermore, we prove that choosing parents that guarantee feasible offspring
results in an optimization time of $\mathord{O}(n^{3}\log n)$.},
}
@INPROCEEDINGS{Doerr11,
AUTHOR = {Doerr, Benjamin},
EDITOR = {Krasnogor, Natalio and Lanzi, Pier Luca},
TITLE = {Drift analysis},
BOOKTITLE = {GECCO 2011 : Genetic and Evolutionary Computation Conference},
PADDRESS = {New York, NY},
ADDRESS = {Dublin, Ireland},
PUBLISHER = {ACM},
ISBN = {978-1-4503-0690-4},
DOI = {10.1145/2001858.2002138},
YEAR = {2011},
PAGES = {1311--1320},
}
@INPROCEEDINGS{Doerr12GECCO,
AUTHOR = {Doerr, Benjamin},
EDITOR = {Soule, Terence and Moore, Jason H.},
TITLE = {Black-box complexity: from complexity theory to playing mastermind},
BOOKTITLE = {GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation},
PADDRESS = {New York, NY},
ADDRESS = {Philadelphia, PA},
PUBLISHER = {ACM},
ISBN = {978-1-4503-1177-9},
DOI = {10.1145/2330784.2330931},
YEAR = {2012},
PAGES = {1079--1092},
}
@INPROCEEDINGS{Doerr2005,
AUTHOR = {Doerr, Benjamin},
TITLE = {Matrix Rounding with Low Error in Small Submatrices},
BOOKTITLE = {Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005)},
PADDRESS = {New York, USA},
ADDRESS = {Vancouver, Canada},
PUBLISHER = {ACM},
ISBN = {0898715857},
YEAR = {2005},
PAGES = {1067--1068},
}
@INPROCEEDINGS{Doerr2005EurocombPropp,
AUTHOR = {Cooper, Joshua and Doerr, Benjamin and Spencer, Joel and Tardos, Gabor},
EDITOR = {Felsner, Stefan},
JOURNAL = {Discrete Mathematics \& Theoretical Computer Science},
TITLE = {Deterministic Random Walks on the Integers},
BOOKTITLE = {2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
PADDRESS = {Nancy, France},
ADDRESS = {Berlin, Germany},
PUBLISHER = {DMTCS},
MONTH = {September},
SERIES = {DMTCS Proceedings},
VOLUME = {AE},
YEAR = {2005},
PAGES = {73--76},
}
@ARTICLE{Doerr2005gitter,
AUTHOR = {Doerr, Benjamin and Gnewuch, Michael and Srivastav, Anand},
JOURNAL = {Journal of Complexity},
TITLE = {Bounds and Constructions for the Star-Discrepancy via Delta-Covers},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {5},
PUBLISHER = {Elsevier},
MONTH = {October},
VOLUME = {21},
ISBN = {0885-064X},
YEAR = {2005},
PAGES = {691--709},
ABSTRACT = {For numerical integration in higher dimensions, bounds for the
star-dis\-cre\-pan\-cy with polynomial dependence on the dimension $d$ are
desirable.
Furthermore, it is still a great challenge to
give construction methods for low-discrepancy point sets.
In this paper we give upper bounds for the star-discrepancy and
its inverse for subsets of the
$d$-di\-men\-sio\-nal unit cube. They improve known results.
In particular, we determine the usually only implicitly given
constants.
The bounds are based on the construction of nearly optimal $\delta$-covers
of anchored boxes in the $d$-dimensional unit cube.
We give an explicit construction of low-discrepancy points with a derandomized
algorithm.
The running time of the algorithm, which is exponentially in $d$, is discussed
in
detail and comparisons with other methods are given.},
}
@PHDTHESIS{Doerr2005Habil,
AUTHOR = {Doerr, Benjamin},
TITLE = {Integral Approximation},
SCHOOL = {Christian-Albrechts-Universit{\"a}t zu Kiel},
TYPE = {Habilitation thesis},
YEAR = {2005},
}
@INPROCEEDINGS{Doerr2005minload,
AUTHOR = {Ahuja, Nitin and Baltz, Andreas and Doerr, Benjamin and Privetivy, Ales and Srivastav, Anand},
EDITOR = {Erlebach, Thomas and Persiano, Pino},
TITLE = {On the Minimum Load Coloring Problem},
BOOKTITLE = {Third Workshop on Approximation and Online Algorithms (WAOA 2005)},
PADDRESS = {Heidelberg},
ADDRESS = {Palma de Mallorca, Spain},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3879},
ISBN = {3-540-32207-8},
YEAR = {2005},
PAGES = {15--26},
}
@ARTICLE{Doerr2006gametrees,
AUTHOR = {Doerr, Benjamin and Lorenz, Ulf},
JOURNAL = {Mathematical Methods of Operations Research},
TITLE = {Error Propagation in Game Trees},
ADDRESS = {Berlin, Germany},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {64},
ISBN = {1432-2994},
YEAR = {2006},
PAGES = {79--93},
ABSTRACT = {Game tree search is the core of most attempts to teach computers play games. We
present a fairly general theoretical analysis on how evaluation error influence
the value estimation of a game position. We extend the work of Lorenz and
Monien [7] in two directions. Firstly, we allow arbitrary game values. By a
different approach, we show that also in this setting the number of
leaf-disjoint strategies proving a particular property is a key notion. This
number precisely describes the order of growth of the heuristic game value in
the terms of the quality of the leaf evaluation heuristics. Secondly, in allow
random nodes (rolls of a die). Surprisingly, this changes the situation: Still
the number of leaf-disjoint strategies ensures robustness against leaf
evaulation errors, but the converse is not true. An average node may produce
additional robustness like further leaf-disjoint strategies.},
}
@INPROCEEDINGS{Doerr2007-CECa,
AUTHOR = {Doerr, Benjamin and Happ, Edda and Klein, Christian},
TITLE = {A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem},
BOOKTITLE = {IEEE Congress on Evolutionary Computation 2007},
PADDRESS = {Vancouver, CA},
ADDRESS = {Singapore},
PUBLISHER = {IEEE},
ISBN = {1-4244-1339-7},
YEAR = {2007},
PAGES = {1890--1895},
}
@INPROCEEDINGS{Doerr2007-CECb,
AUTHOR = {Doerr, Benjamin and Gnewuch, Michael and Hebbinghaus, Nils and Neumann, Frank},
TITLE = {A Rigorous View On Neutrality},
BOOKTITLE = {IEEE Congress on Evolutionary Computation 2007},
PADDRESS = {Vancouver, CA},
ADDRESS = {Singapore},
PUBLISHER = {IEEE},
ISBN = {1-4244-1339-7},
YEAR = {2007},
PAGES = {2591--2597},
}
@ARTICLE{Doerr2007-ENDMa,
AUTHOR = {Cooper, Joshua and Doerr, Benjamin and Friedrich, Tobias and Spencer, Joel},
JOURNAL = {Electronic Notes in Discrete Mathematics},
TITLE = {Deterministic Random Walks on Regular Trees},
VOLUME = {29},
ISBN = {1571-0653},
DOI = {10.1016/j.endm.2007.07.082},
YEAR = {2007},
PAGES = {509--513},
}
@ARTICLE{Doerr2007-ENDMb,
AUTHOR = {Doerr, Benjamin and Friedrich, Tobias and Klein, Christian and Osbild, Ralf},
JOURNAL = {Electronic Notes in Discrete Mathematics},
TITLE = {Unbiased Matrix Rounding},
VOLUME = {28},
ISBN = {1571-0653},
DOI = {10.1016/j.endm.2007.01.007},
YEAR = {2007},
PAGES = {41--46},
}
@PROCEEDINGS{Doerr2007GeccoProc,
EDITOR = {Thierens, Dirk and Beyer, Hans-Georg and Bongard, Joshua and Branke, Juergen and Clark, John and Cliff, Dave and Congdon, Clare and Deb, Kalyanmoy and Doerr, Benjamin and Kovacs, Tim and Kumar, Sanjeev and Miller, Julian and Moore, Jason and Neumann, Frank and Pelikan, Martin and Poli, Ricardo and Sastry, Kumara and Stanley, Ken and St{\"u}tzle, Thomas and Watson, Richard and Wegener, Ingo},
TITLE = {GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation},
PADDRESS = {New York},
ADDRESS = {London, UK},
PUBLISHER = {ACM},
ISBN = {978-1-59593-697-4},
YEAR = {2007},
PAGES = {1--2269},
}
@ARTICLE{Doerr2007nitin,
AUTHOR = {Ahuja, Nitin and Baltz, Andreas and Doerr, Benjamin and Privetivy, Ales and Srivastav, Anand},
JOURNAL = {Journal of Discrete Algorithms},
TITLE = {On the Minimum Load Coloring Problem},
VOLUME = {5},
ISBN = {1570-8667},
YEAR = {2007},
PAGES = {533--545},
}
@ARTICLE{Doerr2007partial,
AUTHOR = {Doerr, Benjamin},
JOURNAL = {Electronic Notes in Discrete Mathematics},
TITLE = {Partial Colorings of Unimodular Hypergraphs},
VOLUME = {29},
ISBN = {1571-0653},
YEAR = {2007},
PAGES = {359--363},
}
@INPROCEEDINGS{Doerr2008-SODA,
AUTHOR = {Doerr, Benjamin and Friedrich, Tobias and Sauerwald, Thomas},
TITLE = {Quasirandom Rumor Spreading},
BOOKTITLE = {Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008},
PADDRESS = {San Francisco, USA},
ADDRESS = {San Francisco, USA},
PUBLISHER = {ACM},
ISBN = {in_press},
YEAR = {2008},
PAGES = {773--781},
}
@INPROCEEDINGS{Doerr2008-SODAb,
AUTHOR = {Cooper, Joshua and Doerr, Benjamin and Friedrich, Tobias and Spencer, Joel},
TITLE = {Deterministic Random Walks on Regular Trees},
BOOKTITLE = {Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008},
PADDRESS = {San Francisco, USA},
ADDRESS = {San Francisco, USA},
PUBLISHER = {ACM},
MONTH = {January},
ISBN = {in_press},
YEAR = {2008},
PAGES = {766--772},
}
@PROCEEDINGS{Doerr2008GeccoProc,
EDITOR = {Keizer, Marten and Antoniol, Giulio and Congdon, Clare and Deb, Kalyanmoy and Doerr, Benjamin and Hansen, Nikolaus and Holmes, John and Hornby, Gergory and Howard, Daniel and Kennedy, John and Kumar, Sanjeev and Lobo, Ferdinando and Miller, Julian and Moore, Jason and Neumann, Frank and Pelikan, Martin and Pollack, Jordan and Sastry, Kumara and Stanley, Ken and Stoica, Adrian and Talbi, El Ghazli and Wegener, Ingo},
TITLE = {GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation},
PADDRESS = {New York},
ADDRESS = {Atlanta, GA, USA},
PUBLISHER = {ACM},
ISBN = {978-1-60558-130-9},
YEAR = {2008},
PAGES = {1--1768},
}
@INCOLLECTION{Doerr2009,
AUTHOR = {Doerr, Benjamin},
EDITOR = {Albers, Susanne and Alt, Helmut and N{\"a}her, Stefan},
JOURNAL = {Lecture Notes in Computer Science},
TITLE = {Introducing Quasirandomness to Computer Science},
BOOKTITLE = {Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday},
ADDRESS = {Berlin, Germany},
PUBLISHER = {Springer},
MONTH = {September},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5760},
ISBN = {978-3-642-03455-8},
DOI = {10.1007/978-3-642-03456-5_6},
YEAR = {2009},
PAGES = {99--111},
}
@INPROCEEDINGS{Doerr2011,
AUTHOR = {Doerr, Benjamin and Johannsen, Daniel and K{\"o}tzing, Timo and Lehre, Per Christian and Wagner, Markus and Winzen, Carola},
EDITOR = {Beyer, Hans- Georg and Langdon, William},
TITLE = {Faster black-box algorithms through higher arity operators},
BOOKTITLE = {Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011)},
PADDRESS = {New York, NY},
ADDRESS = {Schwarzenberg, Austria},
PUBLISHER = {ACM},
ISBN = {978-1-4503-0633-1},
DOI = {10.1145/1967654.1967669},
YEAR = {2011},
PAGES = {163--172},
}
@ARTICLE{Doerr2012x,
AUTHOR = {Doerr, Benjamin and Doerr, Carola and Sp{\"o}hel, Reto and Thomas, Henning},
JOURNAL = {arXiv},
TITLE = {Playing {Mastermind} with Many Colors},
ADDRESS = {Ithaca, NY},
PUBLISHER = {Cornell University Library},
VOLUME = {abs/1207.0773},
YEAR = {2013},
PAGES = {1--22},
}
@ARTICLE{Doerr2013AppAlg,
AUTHOR = {Doerr, Benjamin},
JOURNAL = {Information Processing Letters},
TITLE = {Improved approximation algorithms for the Min-Max Selecting Items problem},
ADDRESS = {Amsterdam},
PUBLISHER = {Eslevier},
VOLUME = {113},
ISBN = {0020-0190},
YEAR = {2013},
PAGES = {747--749},
}
@INPROCEEDINGS{Doerr2013CECemo,
AUTHOR = {Doerr, Benjamin and Kodric, Bojana and Voigt, Marco},
TITLE = {Lower bounds for the runtime of a global multi-objective evolutionary algorithm},
BOOKTITLE = {IEEE Congress on Evolutionary Computation},
PADDRESS = {New York},
ADDRESS = {Cancun, Mexico},
PUBLISHER = {IEEE},
ISBN = {9781479904532},
YEAR = {2013},
PAGES = {432--439},
}
@INPROCEEDINGS{Doerr2013z,
AUTHOR = {Doerr, C. and Schmidt, Jens M. and Ramakrishna, G.},
TITLE = {Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time},
BOOKTITLE = {39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13)},
PADDRESS = {Heidelberg},
ADDRESS = {L{\"u}beck},
PUBLISHER = {Springer},
DOI = {10.1007/978-3-642-45043-3_20},
YEAR = {2013},
PAGES = {225--236},
}
@INPROCEEDINGS{DoerrA11CCCG,
AUTHOR = {Asano, Tetsuo and Doerr, Benjamin},
TITLE = {Memory-constrained algorithms for shortest path problem},
BOOKTITLE = {23rd Annual Canadian Conference on Computational Geometry (CCCG 2011)},
PADDRESS = {-},
ADDRESS = {Toronto, Canada},
YEAR = {2011},
PAGES = {315--319},
}
@INPROCEEDINGS{DoerrANALCO06,
AUTHOR = {Cooper, Joshua and Doerr, Benjamin and Spencer, Joel and Tardos, G{\'a}bor},
EDITOR = {Raman, Rajeev and Sedgewick, Robert and Stallmann, Matthias F.},
TITLE = {Deterministic Random Walks},
BOOKTITLE = {Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06)},
PADDRESS = {Philadelphia, PA, USA},
ADDRESS = {Miami, FL, USA},
PUBLISHER = {SIAM},
ISBN = {0898716101},
YEAR = {2006},
PAGES = {185--197},
ABSTRACT = {Jim Propp’s P-machine, also known as ‘rotor router model’ is a simple
deterministic process that simulates random walk on a graph. Instead of
distributing chips
to randomly chosen neighbors, it serves the neighbors in a fixed order.
We investigate how well this process simulates a random walk. For the graph
being the infinite path, we show that, independent of the starting
configuration, at each time and on each vertex, the number of chips on this
vertex deviates from the expected number of chips in the random walk model by
at most a constant c1, which is approximately 2.29. For intervals of length L,
this improves to a difference of O(log L) (instead of 2.29L), for the L2
average of a contiguous set of intervals even to O(√log L). It seems plausible
that similar results hold for higher-dimensional grids Zd instead of the path
Z.},
}
@INPROCEEDINGS{DoerrDE13,
AUTHOR = {Doerr, Benjamin and Doerr, Carola and Ebel, Franziska},
TITLE = {Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms},
BOOKTITLE = {Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013)},
PADDRESS = {New York, USA},
ADDRESS = {Amsterdam, Netherlands},
PUBLISHER = {ACM},
YEAR = {2013},
PAGES = {781--788},
}
@INPROCEEDINGS{DoerrDR2013,
AUTHOR = {Doerr, Carola and De Rainville, Fran{\c{c}}ois-Michel},
TITLE = {Constructing Low Star Discrepancy Point Sets with Genetic Algorithms},
BOOKTITLE = {Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013)},
PADDRESS = {New York, USA},
ADDRESS = {Amsterdam, Netherlands},
PUBLISHER = {ACM},
YEAR = {2013},
PAGES = {789--796},
ABSTRACT = {The recently active research area of black-box complexity revealed that for
many optimization problems the best possible black-box optimization algorithm
is significantly faster than all known evolutionary approaches. While it is not
to be expected that a general-purpose heuristic competes with a
problem-tailored algorithm, it still makes sense to look for the reasons for
this discrepancy.
In this work, we exhibit one possible reason---most optimal black-box
algorithms profit also from solutions that are inferior to the previous-best
one, whereas evolutionary approaches guided by the ``survival of the fittest''
paradigm often ignore such solutions. Trying to overcome this shortcoming, we
design a simple genetic algorithm that first creates $\lambda$ offspring from a
single parent by mutation with a mutation probability that is $k$ times larger
than the usual one. From the best of these offspring (which often is worse than
the parent) and the parent itself, we generate further offspring via a uniform
crossover operator that takes bits from the winner offspring with probability
$1/k$ only.
A rigorous runtime analysis proves that our new algorithm for suitable
parameter choices on the \onemax test function class is asymptotically faster
(in terms of the number of fitness evaluations) than what has been shown for
$(\mu \stackrel{+}{,} \lambda)$ EAs. This is the first time that crossover is
shown to give an advantage for the $\onemax$ class that is
larger than a constant factor. Using a fitness-dependent choice of $k$
and~$\lambda$, the optimization time can be reduced further to linear in~$n$.
Our experimental analysis on several test function classes shows advantages
already for small problem sizes and broad parameter ranges. Also, a simple
self-adaptive choice of these parameters gives surprisingly good results.},
}
@ARTICLE{DoerrENTT11,
AUTHOR = {Doerr, Benjamin and Eremeev, Anton and Neumann, Frank and Theile, Madeleine and Thyssen, Christian},
JOURNAL = {Theoretical Computer Science},
TITLE = {Evolutionary algorithms and dynamic programming},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
VOLUME = {412},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2011.07.024},
YEAR = {2011},
PAGES = {6020--6035},
}
@INPROCEEDINGS{Doerretal2010b,
AUTHOR = {Doerr, Benjamin and Goldberg, Leslie Ann and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian},
EDITOR = {Lynch, Nancy A. and Shvartsman, Alexander A.},
TITLE = {Brief Announcement: Stabilizing Consensus with the Power of Two Choices},
BOOKTITLE = {Distributed Computing : 24th International Symposium, DISC 2010},
PADDRESS = {Berlin},
ADDRESS = {Cambridge, MA USA},
PUBLISHER = {Springer},
MONTH = {September},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6343},
ISBN = {978-3-642-15762-2},
DOI = {10.1007/978-3-642-15763-9_50},
YEAR = {2010},
PAGES = {528--530},
}
@INPROCEEDINGS{DoerretalGECCO2009,
AUTHOR = {Doerr, Benjamin and Eremeev, Anton and Horoba, Christian and Neumann, Frank and Theile, Madeleine},
EDITOR = {Raidl, G{\"u}nther and Rothlauf, Frank},
TITLE = {Evolutionary Algorithms and Dynamic Programming},
BOOKTITLE = {Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009)},
PADDRESS = {New York, USA},
ADDRESS = {Montreal, Canada},
PUBLISHER = {ACM},
ISBN = {978-1-60558-325-9},
DOI = {10.1145/1569901.1570008},
YEAR = {2009},
PAGES = {771--777},
}
@ARTICLE{DoerrF12,
AUTHOR = {Doerr, Benjamin and Fouz, Mahmoud},
JOURNAL = {Electronic Notes in Discrete Mathematics},
TITLE = {Asymptotically optimal randomized rumor spreading},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
VOLUME = {38},
ISBN = {1571-0653},
DOI = {10.1016/j.endm.2011.09.049},
YEAR = {2011},
PAGES = {297--302},
}
@ARTICLE{DoerrFF12CACM,
AUTHOR = {Doerr, Benjamin and Fouz, Mahmoud and Friedrich, Tobias},
JOURNAL = {Communications of the ACM},
TITLE = {Why Rumors Spread Fast in Social Networks},
ADDRESS = {New York, NY},
PUBLISHER = {ACM},
VOLUME = {55},
ISBN = {0001-0782},
DOI = {10.1145/2184319.2184338},
YEAR = {2012},
PAGES = {70--75},
}
@INPROCEEDINGS{DoerrFF12MedAlg,
AUTHOR = {Doerr, Benjamin and Fouz, Mahmoud and Friedrich, Tobias},
EDITOR = {Even, Guy and Rawitz, Dror},
TITLE = {Experimental analysis of rumor spreading in social networks},
BOOKTITLE = {Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012},
PADDRESS = {Berlin},
ADDRESS = {Ein Gedi, Israel},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7659},
ISBN = {978-3-642-34861-7},
DOI = {10.1007/978-3-642-34862-4_12},
YEAR = {2012},
PAGES = {159--173},
NOTE = {To appear},
}
@INPROCEEDINGS{DoerrFF12SWAT,
AUTHOR = {Doerr, Benjamin and Fouz, Mahmoud and Friedrich, Tobias},
EDITOR = {Fomin, Fedor V. and Kaski, Petteri},
TITLE = {Asynchronous rumor spreading in preferential attachment graphs},
BOOKTITLE = {Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops},
PADDRESS = {Berlin},
ADDRESS = {Helsinki, Finland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7357},
ISBN = {978-3-642-31154-3},
DOI = {10.1007/978-3-642-31155-0_27},
YEAR = {2012},
PAGES = {307--315},
}
@ARTICLE{DoerrFKS12,
AUTHOR = {Doerr, Benjamin and Friedrich, Tobias and K{\"u}nnemann, Marvin and Sauerwald, Thomas},
JOURNAL = {ACM Journal of Experimental Algorithmics},
TITLE = {Quasirandom Rumor Spreading: An Experimental Analysis},
ADDRESS = {New York, NY},
PUBLISHER = {ACM},
VOLUME = {16},
DOI = {10.1145/1963190.2025379},
YEAR = {2011},
PAGES = {Article No. 3.3},
}
@MISC{DoerrFouz2006,
AUTHOR = {Doerr, Benjamin and Fouz, Mahmoud},
JOURNAL = {???},
TITLE = {Hereditary Discrepancies in Different Numbers of Colors II},
HOWPUBLISHED = {Internet},
MONTH = {November},
YEAR = {2006},
PAGES = {1--19},
ABSTRACT = {We bound the hereditary discrepancy of a hypergraph H in two colors in terms of
its hereditary discrepancy in c colors. We show that \herdisc(H,2) \le K c
\herdisc(H,c), where K is some absolute constant. This bound is sharp. },
}
@ARTICLE{doerrfouz2009,
AUTHOR = {Doerr, Benjamin and Fouz, Mahmoud},
JOURNAL = {Electronic Notes in Discrete Mathematics},
TITLE = {A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
VOLUME = {34},
ISBN = {1571-0653},
DOI = {10.1016/j.endm.2009.07.055},
YEAR = {2009},
PAGES = {335 -- 339},
}
@ARTICLE{DoerrFouz2010,
AUTHOR = {Doerr, Benjamin and Fouz, Mahmoud},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {Hereditary Discrepancies in Different Numbers of Colors {II}},
ADDRESS = {Philadelphia, Pa.},
NUMBER = {3},
PUBLISHER = {SIAM},
VOLUME = {24},
ISBN = {0895-4801},
DOI = {10.1137/090669620},
YEAR = {2010},
PAGES = {1205--1213},
}
@INPROCEEDINGS{DoerrFouzSchmidtWahlstroem2009,
AUTHOR = {Doerr, Benjamin and Fouz, Mahmoud and Schmidt, Martin and Wahlstr{\"o}m, Magnus},
EDITOR = {Rothlauf, Franz},
TITLE = {{BBOB}: Nelder-Mead with resize and halfruns},
BOOKTITLE = {Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009)},
PADDRESS = {New York, NY},
ADDRESS = {Montreal, Qu{\'e}bec, Canada},
PUBLISHER = {ACM},
ISBN = {978-1-60558-505-5},
DOI = {10.1145/1570256.1570312},
YEAR = {2009},
PAGES = {2239--2246},
}
@INPROCEEDINGS{DoerrFriedrichSauerwald09,
AUTHOR = {Doerr, Benjamin and Friedrich, Tobias and Sauerwald, Thomas},
EDITOR = {Albers, Susanne and Marchetti-Spaccamela, Alberto and Matias, Yossi and Nikoletseas, Sotiris and Thomas, Wolfgang},
TITLE = {Quasirandom Rumor Spreading: {Expanders,} Push vs. Pull, and Robustness},
BOOKTITLE = {Automata, Languages and Programming : 36th International Colloquium, ICALP 2009},
PADDRESS = {Berlin, Germany},
ADDRESS = {Rhodes, Greece},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5555},
ISBN = {978-3642029264},
DOI = {10.1007/978-3-642-02927-1_31},
YEAR = {2009},
PAGES = {366--377},
}
@ARTICLE{doerrfriedrichsauerwald2009,
AUTHOR = {Doerr, Benjamin and Friedrich, Tobias and Sauerwald, Thomas},
JOURNAL = {Electronic Notes in Discrete Mathematics},
TITLE = {Quasirandom Rumor Spreading on Expanders},
ADDRESS = {Amsterdam, The Netherlands},
PUBLISHER = {Elsevier},
VOLUME = {34},
ISBN = {1571-0653},
DOI = {10.1016/j.endm.2009.07.040},
YEAR = {2009},
PAGES = {243 -- 247},
}
@INPROCEEDINGS{DoerrFW11,
AUTHOR = {Doerr, Benjamin and Fouz, Mahmoud and Witt, Carsten},
EDITOR = {Krasnogor, Natalio and Lanzi, Pier Luca},
TITLE = {Sharp bounds by probability-generating functions and variable drift},
BOOKTITLE = {GECCO 2011 : Genetic and Evolutionary Computation Conference},
PADDRESS = {New York, NY},
ADDRESS = {Dublin, Ireland},
PUBLISHER = {ACM},
ISBN = {978-1-4503-0557-0},
DOI = {10.1145/2001576.2001856},
YEAR = {2011},
PAGES = {2083--2090},
}
@INPROCEEDINGS{DoerrFW2010,
AUTHOR = {Doerr, Benjamin and Fouz, Mahmoud and Witt, Carsten},
EDITOR = {Pelikan, Martin and Branke, J{\"u}rgen},
TITLE = {Quasirandom Evolutionary Algorithms},
BOOKTITLE = {Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010)},
PADDRESS = {New York, NY USA},
ADDRESS = {Portland, USA},
PUBLISHER = {ACM},
MONTH = {July},
ISBN = {978-1-4503-0072-5},
DOI = {10.1145/1830483.1830749},
YEAR = {2010},
PAGES = {1457--1464},
}
@ARTICLE{DoerrG13algo,
AUTHOR = {Doerr, Benjamin and Goldberg, Leslie Ann},
JOURNAL = {Algorithmica},
TITLE = {Adaptive Drift Analysis},
ADDRESS = {New York, NY},
PUBLISHER = {Springer},
VOLUME = {65},
ISBN = {0178-4617},
DOI = {10.1007/s00453-011-9585-3},
YEAR = {2013},
PAGES = {224--250},
}
@ARTICLE{DoerrGKP08,
AUTHOR = {Doerr, Benjamin and Gnewuch, Michael and Kritzer, Peter and Pillichshammer, Peter},
JOURNAL = {Monte Carlo Methods Applications},
TITLE = { Component-by-component construction of low-discrepancy point sets of small size},
NUMBER = {2},
VOLUME = {14},
YEAR = {2008},
PAGES = {129--150},
}
@INPROCEEDINGS{DoerrGMSS11,
AUTHOR = {Doerr, Benjamin and Goldberg, Leslie Ann and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian},
TITLE = {Stabilizing consensus with the power of two choices},
BOOKTITLE = {23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11)},
PADDRESS = {New York, NY},
ADDRESS = {San Jose, USA},
PUBLISHER = {ACM},
ISBN = {978-1-4503-0743-7},
DOI = {10.1145/1989493.1989516},
YEAR = {2011},
PAGES = {149--158},
}
@INPROCEEDINGS{DoerrGnewuch2008,
AUTHOR = {Doerr, Benjamin and Gnewuch, Michael},
EDITOR = {Keller, Alexander and Heinrich, Stefan and Niederreiter, Harald},
TITLE = {Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding},
BOOKTITLE = {Monte Carlo and Quasi-Monte Carlo Methods 2006},
PADDRESS = {New York, USA},
ADDRESS = {Ulm, Germany},
PUBLISHER = {Springer},
ISBN = {978-3-540-74495-5},
YEAR = {2008},
PAGES = {299--312},
}
@ARTICLE{DoerrGnewuchKritzerPillichshammer2008,
AUTHOR = {Doerr, Benjamin and Gnewuch, Michael and Kritzer, Peter and Pillichshammer, Friedrich},
JOURNAL = {Monte Carlo Methods and Applications},
TITLE = {Component-by-component construction of low-discrepancy point sets of small size},
VOLUME = {14},
ISBN = {0929-9629},
YEAR = {2008},
PAGES = {129--149},
}
@INPROCEEDINGS{DoerrGW2009,
AUTHOR = {Doerr, Benjamin and Gnewuch, Michael and Wahlstr{\"o}m, Magnus},
EDITOR = {L'Ecuyer, P. and Owen, A. B.},
TITLE = {Implementation of a component-by-component algorithm to generate small low-discrepancy samples},
BOOKTITLE = {Monte Carlo and Quasi-Monte Carlo Methods 2008},
PADDRESS = {Berlin},
ADDRESS = {Montreal, Canada},
PUBLISHER = {Springer},
MONTH = {July},
ISBN = {978-3-642-04106-8},
YEAR = {2009},
PAGES = {323--338},
}
@INPROCEEDINGS{DoerrHapp2008,
AUTHOR = {Doerr, Benjamin and Happ, Edda},
TITLE = {Directed trees: A Powerful Representation for Sorting and Ordering Problems},
BOOKTITLE = {Proceedings of CEC 2008},
ORGANIZATION = {Institute of Electrical and Electronics Engineers},
PADDRESS = {New York, USA},
ADDRESS = {Hong Kong},
PUBLISHER = {IEEE},
ISBN = {978-1-4244-1823-7},
DOI = {10.1109/CEC.2008.4631286},
YEAR = {2008},
PAGES = {3606--3613},
}
@ARTICLE{DoerrHK11,
AUTHOR = {Doerr, Benjamin and Happ, Edda and Klein, Christian},
JOURNAL = {Evolutionary Computation},
TITLE = {Tight Analysis of the (1+1)-{EA} for the Single Source Shortest Path Problem},
ADDRESS = {Cambridge, MA},
NUMBER = {4},
PUBLISHER = {MIT Press},
VOLUME = {19},
ISBN = {1063-6560},
DOI = {10.1162/EVCO_a_00047},
YEAR = {2011},
PAGES = {673--691},
}
@INPROCEEDINGS{DoerrHK2012GECCO,
AUTHOR = {Doerr, Benjamin and Hota, Ashish and K{\"o}tzing, Timo},
EDITOR = {Soule, Terence and Moore, Jason H.},
TITLE = {Ants easily solve stochastic shortest path problems},
BOOKTITLE = {GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation},
PADDRESS = {New York, NY},
ADDRESS = {Philadelphia, PA},
PUBLISHER = {ACM},
ISBN = {978-1-4503-1177-9},
DOI = {10.1145/2330163.2330167},
YEAR = {2012},
PAGES = {17--24},
}
@ARTICLE{DoerrHK2012TCS,
AUTHOR = {Doerr, Benjamin and Happ, Edda and Klein, Christian},
JOURNAL = {Theoretical Computer Science},
TITLE = {Crossover can provably be useful in evolutionary computation},
ADDRESS = {Amsterdam, The Netherlands},
PUBLISHER = {Elsevier},
VOLUME = {425},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2010.10.035},
YEAR = {2012},
PAGES = {17--33},
}
@ARTICLE{DoerrHL13,
AUTHOR = {Doerr, Benjamin and Huber, Anna and Levavi, Ariel},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Strong robustness of randomized rumor spreading protocols},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {6},
PUBLISHER = {Discrete Applied Mathematics},
VOLUME = {161},
ISBN = {0166-218X},
DOI = {10.1016/j.dam.2012.10.014},
YEAR = {2013},
PAGES = {778--793},
}
@ARTICLE{DoerrJ11,
AUTHOR = {Doerr, Benjamin and Jansen, Thomas},
JOURNAL = {Algorithmica},
TITLE = {Theory of Evolutionary Computation},
ADDRESS = {New York, NY},
NUMBER = {3},
PUBLISHER = {Springer},
VOLUME = {59},
ISBN = {0178-4617},
DOI = {10.1007/s00453-010-9472-3},
YEAR = {2011},
PAGES = {299--300},
}
@INPROCEEDINGS{DoerrJ2010,
AUTHOR = {Doerr, Benjamin and Johannsen, Daniel},
EDITOR = {Pelikan, Martin and Branke, J{\"u}rgen},
TITLE = {Edge-based representation beats vertex-based representation in shortest path problems},
BOOKTITLE = {Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010)},
PADDRESS = {New York, NY USA},
ADDRESS = {Portland, USA},
PUBLISHER = {ACM},
MONTH = {July},
ISBN = {978-1-4503-0072-5},
DOI = {10.1145/1830483.1830618},
YEAR = {2010},
PAGES = {759--766},
}
@INPROCEEDINGS{DoerrJansenKlein2008,
AUTHOR = {Doerr, Benjamin and Jansen, Thomas and Klein, Christian},
EDITOR = {Ryan, Conor and Keijzer, Maarten},
TITLE = {Comparing local and global mutations on bit-strings.},
BOOKTITLE = {Genetic and Evolutionary Computation Conference 2008},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Atlanta, USA},
PUBLISHER = {ACM},
SERIES = {Proceedings of the 10th annual conference on Genetic and evolutionary computation},
ISBN = {978-1-60558-130-9},
YEAR = {2008},
PAGES = {929--936},
}
@ARTICLE{DoerrJKNT13,
AUTHOR = {Doerr, Benjamin and Johannsen, Daniel and K{\"o}tzing, Timo and Neumann, Frank and Theile, Madeleine},
JOURNAL = {Theoretical Computer Science},
TITLE = {More effective crossover operators for the all-pairs shortest path problem},
ADDRESS = {Amsterdam, The Netherlands},
PUBLISHER = {Elsevier},
VOLUME = {471},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2012.10.059},
YEAR = {2013},
PAGES = {12--26},
}
@INPROCEEDINGS{DoerrJohannsen07a,
AUTHOR = {Doerr, Benjamin and Johannsen, Daniel},
EDITOR = {Thierens, Dirk},
TITLE = {Adjacency List Matchings --- An Ideal Genotype for Cycle Covers},
BOOKTITLE = {Genetic and Evolutionary Computation Conference (GECCO-2007)},
PADDRESS = {New York, USA},
ADDRESS = {London, UK},
PUBLISHER = {ACM},
ISBN = {978-1-59593-697-4},
YEAR = {2007},
PAGES = {1203--1210},
ABSTRACT = {We propose and analyze a novel genotype representation for walk and cycle
covers in graphs. Together with a natural mutation operator, it yields superior
algorithms based on randomized local search and (1+1) evolutionary algorithms.
In particular, we derive an evolutionary algorithm that computes an Euler tour
in a graph with $m$ edges in expected run-time $O(m \log m)$. This is
comparable to the best direct algorithm for this problem running in linear
time. Also, a simple coupon collector argument indicates that our run-time is
asymptotically optimal for any randomized search heuristic.},
}
@INPROCEEDINGS{DoerrJohannsen2007b,
AUTHOR = {Doerr, Benjamin and Johannsen, Daniel},
TITLE = {Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm},
BOOKTITLE = {IEEE Congress on Evolutionary Computation 2007},
PADDRESS = {Vancouver, CA},
ADDRESS = {Singapore},
PUBLISHER = {IEEE},
ISBN = {1-4244-1339-7},
YEAR = {2007},
PAGES = {501--507},
ABSTRACT = {Neumann and Witt (2006) analyzed the runtime of
the basic ant colony optimization (ACO) algorithm
{\sc 1-Ant} on pseudo-boolean optimization problems.
For the problem {\sc OneMax} they showed how the runtime depends
on the evaporation factor. In particular, they proved a phase
transition from exponential to polynomial runtime.
In this work, we simplify the view on this problem by
an appropriate translation of the pheromone model.
This results in a profound simplification of
the pheromone update rule and, by that,
a refinement of the results of Neumann and Witt.
In particular, we show how the exponential runtime bound
gradually changes to a polynomial bound inside the phase of
transition.},
}
@INPROCEEDINGS{DoerrJohannsenTang2008a,
AUTHOR = {Doerr, Benjamin and Johannsen, Daniel and Tang, Ching Hoo},
EDITOR = {G{\"u}nter Rudolph and Thomas Jansen and Simon M. Lucas and Carlo Poloni and Nicola Beume},
TITLE = {How Single Ant ACO Systems Optimize Pseudo-Boolean Functions},
BOOKTITLE = {Parallel Problem Solving from Nature – PPSN X},
PADDRESS = {Berlin / Heidelberg},
ADDRESS = {Dortmund, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5199},
ISBN = {978-3-540-87699-1},
DOI = {10.1007/978-3-540-87700-4_38},
YEAR = {2008},
PAGES = {378--388},
ABSTRACT = {We undertake a rigorous experimental analysis of the optimization behavior of
the two most studied single ant ACO systems on several pseudo-boolean
functions. By tracking the behavior of the underlying random processes rather
than just regarding the resulting optimization time, we gain additional insight
into these systems. A main finding is that in those cases where the single ant
ACO system performs well, it basically simulates the much simpler (1+1)
evolutionary algorithm.},
}
@INPROCEEDINGS{DoerrJSWZ10,
AUTHOR = {Doerr, Benjamin and Jansen, Thomas and Sudholt, Dirk and Winzen, Carola and Zarges, Christine},
EDITOR = {Schaefer, Robert and Cotta, Carlos and Kolodziej, Joanna and Rudolph, G{\"u}nter},
TITLE = {Optimizing Monotone Functions Can Be Difficult},
BOOKTITLE = {Parallel Problem Solving from Nature - PPSN XI. - Pt. 1},
PADDRESS = {Berlin},
ADDRESS = {Krakow, Poland},
PUBLISHER = {Springer},
MONTH = {September},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6238},
ISBN = {978-3-642-15843-8},
DOI = {10.1007/978-3-642-15844-5_5},
YEAR = {2010},
PAGES = {42--51},
ABSTRACT = {Extending previous analyses on function classes like linear functions, we
analyze how the simple (1+1) evolutionary algorithm optimizes pseudo-Boolean
functions that are strictly monotone.
Contrary to what one would expect, not all of these functions are easy to
optimize. The choice of the constant $c$ in the mutation probability $p(n) =
c/n$ can make a decisive difference.
We show that if $c < 1$, then the \EA finds the optimum of every such
function in $\Theta(n \log n)$ iterations. For $c=1$, we can still prove an
upper bound of $O(n^{3/2})$.
However, for $c > 33$, we present a strictly monotone function such that the
\EA with overwhelming
probability does not find the optimum within $2^{\Omega(n)}$
iterations. This is the first time that we observe that a constant factor
change of the mutation probability changes the run-time by more than constant
factors.},
}
@ARTICLE{DoerrJSWZ13EvCo,
AUTHOR = {Doerr, Benjamin and Jansen, Thomas and Sudholt, Dirk and Winzen, Carola and Zarges, Christine},
JOURNAL = {Evolutionary Computation},
TITLE = {Mutation rate matters even when optimizing monotonic functions},
ADDRESS = {Cambridge, MA},
NUMBER = {1},
PUBLISHER = {http://www.mitpressjournals.org/},
VOLUME = {21},
ISBN = {1063-6560},
DOI = {10.1162/EVCO_a_00055},
YEAR = {2013},
PAGES = {1--27},
}
@INPROCEEDINGS{DoerrJW10a,
AUTHOR = {Doerr, Benjamin and Johannsen, Daniel and Winzen, Carola},
EDITOR = {Pelikan, Martin and Branke, J{\"u}rgen},
TITLE = {Multiplicative Drift Analysis},
BOOKTITLE = {Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010)},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, NY},
ADDRESS = {Portland, USA},
PUBLISHER = {ACM},
ISBN = {978-1-4503-0072-5},
DOI = {10.1145/1830483.1830748},
YEAR = {2010},
PAGES = {1449--1456},
NOTE = {Best Paper Award},
ABSTRACT = {Drift analysis is one of the strongest tools in the analysis
of evolutionary algorithms. Its main weakness is that it is
often very hard to find a good drift function.
In this paper, we make progress in this direction. We
prove a multiplicative version of the classical drift theorem.
This allows easier analyses in those settings, where the optimization progress
is roughly proportional to the current
objective value.
Our drift theorem immediately gives natural proofs for
the best known run-time bounds for the (1+1) Evolutionary
Algorithm computing minimum spanning trees and shortest
paths, since here we may simply take the objective function
as drift function.
As a more challenging example, we give a relatively simple
proof for the fact that any linear function is optimized in
time $O(n \log n)$. In the multiplicative setting, a simple linear
function can be used as drift function (without taking any
logarithms).
However, we also show that, both in the classical and the
multiplicative setting, drift functions yielding good results
for all linear functions exist only if the mutation probability
is at most $c/n$ for a small constant $c$.},
}
@INPROCEEDINGS{DoerrJW10b,
AUTHOR = {Doerr, Benjamin and Johannsen, Daniel and Winzen, Carola},
TITLE = {Drift Analysis and Linear Functions Revisited},
BOOKTITLE = {Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3},
ORGANIZATION = {IEEE},
PADDRESS = {Piscataway, NJ},
ADDRESS = {Barcelona, Spain},
PUBLISHER = {IEEE},
ISBN = {978-1-4244-6909-3},
DOI = {10.1109/CEC.2010.5586097},
YEAR = {2010},
PAGES = {1967--1974},
ABSTRACT = {We regard the classical problem how the (1+1)~Evolutionary Algorithm optimizes
an arbitrary linear pseudo-Boolean function. We show that any such function is
optimized in time ${(1+o(1)) 1.39 e n\ln (n)}$, where ${n}$ is the length of
the bit string. We also prove a lower bound of ${(1-o(1))e n\ln(n)}$, which in
fact holds for all functions with a unique global optimum.
This shows that for linear functions, even though the optimization behavior
might differ, the resulting runtimes are very similar. Our experimental results
suggest that the true optimization times are even closer than what the
theoretical guarantees promise. },
}
@ARTICLE{DoerrJW12,
AUTHOR = {Doerr, Benjamin and Johannsen, Daniel and Winzen, Carola},
JOURNAL = {Theoretical Computer Science},
TITLE = {Non-existence of linear universal drift functions},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
MONTH = {June},
VOLUME = {436},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2012.01.048},
YEAR = {2012},
PAGES = {71--86},
}
@ARTICLE{DoerrJW12Multi,
AUTHOR = {Doerr, Benjamin and Johannsen, Daniel and Winzen, Carola},
JOURNAL = {Algorithmica},
TITLE = {Multiplicative Drift Analysis},
ADDRESS = {New York, NY},
NUMBER = {4},
PUBLISHER = {Springer},
MONTH = {December},
VOLUME = {64},
ISBN = {0178-4617},
DOI = {10.1007/s00453-012-9622-x},
YEAR = {2012},
PAGES = {673--697},
ABSTRACT = {We introduce multiplicative drift analysis as a suitable way to analyze the
runtime of randomized search heuristics such as evolutionary algorithms. Our
multiplicative version of the classical drift theorem allows easier analyses in
the often encountered situation that the optimization progress is roughly
proportional to the current distance to the optimum.
To display the strength of this tool, we regard the classical problem of how
the (1+1) Evolutionary Algorithm optimizes an arbitrary linear pseudo-Boolean
function. Here, we first give a relatively simple proof for the fact that any
linear function is optimized in expected time $O(n \log n)$, where $n$ is the
length of the bit string. Afterwards, we show that in fact any such function is
optimized in expected time at most $(1+o(1))1.39 e n\ln n$, again using
multiplicative drift analysis. We also prove a corresponding lower bound of
$(1−o(1)) e n \ln n$ which actually holds for all functions with a unique
global optimum.
We further demonstrate how our drift theorem immediately gives natural proofs
(with better constants) for the best known runtime bounds for the (1+1)
Evolutionary Algorithm on combinatorial problems like finding minimum spanning
trees, shortest paths, or Euler tours in graphs.},
}
@INPROCEEDINGS{DoerrK2013a,
AUTHOR = {Doerr, Benjamin and K{\"u}nnemann, Marvin},
TITLE = {Royal Road Functions and the (1 + λ) Evolutionary Algorithm: Almost no Speed-up from Larger Offspring Populations},
BOOKTITLE = {2013 IEEE Congress on Evolutionary Computation (CEC 2013)},
ORGANIZATION = {Institute of Electrical and Electronics Engineers (IEEE)},
PADDRESS = {Piscataway, USA},
ADDRESS = {Cancun, Mexico},
PUBLISHER = {IEEE},
MONTH = {June},
ISBN = {978-1-4799-0453-2},
DOI = {10.1109/CEC.2013.6557600},
YEAR = {2013},
PAGES = {424--431},
ABSTRACT = {We analyze the runtime of the $(1 + \lambda)$ evolutionary algorithm (EA) on
the classic royal road test function class. For a royal road function defined
on bit-strings of length $n$ having block size $d\ge\log
n+(c+1+\varepsilon)\log d$, we prove that the $(1 + \lambda)$ EA with $\lambda
= \Theta(n^c)$ finds the optimum in an expected number of
$O(\frac{2^d}{d^c}\cdot\frac{n}{d} \log \frac{n}{d})$ generations. Together
with our lower bound of $\Omega(\frac{2^d}{d^c})$, this shows that for royal
road functions even very large offspring populations do not reduce the runtime
significantly.},
}
@INPROCEEDINGS{DoerrK2013b,
AUTHOR = {Doerr, Benjamin and K{\"u}nnemann, Marvin},
EDITOR = {Blum, Christian},
TITLE = {How the (1+λ) Evolutionary Algorithm Optimizes Linear Functions},
BOOKTITLE = {15th Annual Conference on Genetic and Evolutionary Computation Conference (GECCO '13)},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Amsterdam, The Netherlands},
PUBLISHER = {ACM},
ISBN = {978-1-4503-1963-8},
DOI = {10.1145/2463372.2463569},
YEAR = {2013},
PAGES = {1589--1596},
}
@ARTICLE{DoerrKLW13,
AUTHOR = {Doerr, Benjamin and K{\"o}tzing, Timo and Lengler, Johannes and Winzen, Carola},
JOURNAL = {Theoretical Computer Science},
TITLE = {Black-Box Complexities of Combinatorial Problems},
PUBLISHER = {Elsevier},
VOLUME = {471},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2012.10.039},
YEAR = {2013},
PAGES = {84--106},
ABSTRACT = {Black-box complexity, counting the number of queries needed to find the optimum
of a problem without having access to an explicit problem description, was
introduced by Droste, Jansen, and Wegener (Theory of Computing Systems
39 (2006) 525--544) to measure the difficulty of solving an optimization
problem via generic search heuristics such as evolutionary algorithms,
simulated annealing or ant colony optimization.
Since then, a number of similar complexity notions were introduced. However, so
far these new notions were only analyzed for artificial test problems. In this
paper, we move a step forward and analyze the different black-box complexity
notions for two classic combinatorial problems, namely the minimum spanning
tree and the single-source shortest path problem. Besides proving bounds for
their black-box complexities, our work reveals that the choice of how to model
the optimization problem has a significant influence on its black-box
complexity. In addition, when regarding the unbiased (symmetry-invariant)
black-box complexity of combinatorial problems, it is important to choose a
meaningful definition of unbiasedness.},
}
@INPROCEEDINGS{DoerrKuennemann2010,
AUTHOR = {Doerr, Benjamin and K{\"u}nnemann, Marvin and Wahlstr{\"o}m, Magnus},
EDITOR = {Festa, Paola},
TITLE = {Randomized Rounding for Routing and Covering Problems: Experiments and Improvements},
BOOKTITLE = {Experimental Algorithms : 9th International Symposium, SEA 2010},
PADDRESS = {Berlin},
ADDRESS = {Naples, Italy},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6049},
ISBN = {978-3-642-13192-9},
DOI = {10.1007/978-3-642-13193-6_17},
YEAR = {2010},
PAGES = {190--201},
}
@INPROCEEDINGS{DoerrKW11,
AUTHOR = {Doerr, Benjamin and K{\"o}tzing, Timo and Winzen, Carola},
EDITOR = {Krasnogor, Natalio and Lanzi, Pier Luca},
TITLE = {Too fast unbiased black-box algorithms},
BOOKTITLE = {GECCO 2011 : Genetic and Evolutionary Computation Conference},
PADDRESS = {New York, NY},
ADDRESS = {Dublin, Ireland},
PUBLISHER = {ACM},
ISBN = {978-1-4503-0557-0},
DOI = {10.1145/2001576.2001851},
YEAR = {2011},
PAGES = {2043--2050},
}
@INPROCEEDINGS{DoerrLKW11,
AUTHOR = {Doerr, Benjamin and Lengler, Johannes and K{\"o}tzing, Timo and Winzen, Carola},
EDITOR = {Krasnogor, Natalio and Lanzi, Pier Luca},
TITLE = {Black-box complexities of combinatorial problems},
BOOKTITLE = {GECCO 2011 : Genetic and Evolutionary Computation Conference},
PADDRESS = {New York, NY},
ADDRESS = {Dublin, Ireland},
PUBLISHER = {ACM},
ISBN = {978-1-4503-0557-0},
DOI = {10.1145/2001576.2001710},
YEAR = {2011},
PAGES = {981--988},
}
@INPROCEEDINGS{DoerrM11,
AUTHOR = {Doerr, Benjamin and Fouz, Mahmoud},
EDITOR = {Aceto, Luca and Henzinger, Monika and Sgall, Jiri},
TITLE = {Asymptotically Optimal Randomized Rumor Spreading},
BOOKTITLE = {Automata, Languages and Programming : 38th International Colloquium, ICALP 2011},
PADDRESS = {Berlin},
ADDRESS = {Z{\"u}rich, Switzerland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6756},
ISBN = {978-3-642-22011-1},
DOI = {10.1007/978-3-642-22012-8_40},
YEAR = {2011},
PAGES = {502--513},
}
@INPROCEEDINGS{DoerrMJ11,
AUTHOR = {Doerr, Benjamin and Johannsen, Daniel and Schmidt, Martin},
EDITOR = {Beyer, Hans- Georg and Langdon, William},
TITLE = {Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets},
BOOKTITLE = {FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI},
PADDRESS = {New York, NY},
ADDRESS = {Schwarzenberg, Austria},
PUBLISHER = {ACM},
ISBN = {978-1-4503-0633-1},
DOI = {10.1145/1967654.1967665},
YEAR = {2011},
PAGES = {119--126},
}
@ARTICLE{DoerrMMW2012arxiv,
AUTHOR = {Doerr, Benjamin and Moran, Shay and Moran, Shlomo and Winzen, Carola},
JOURNAL = {arXiv},
TITLE = {Simple and Optimal Fault-Tolerant Rumor Spreading},
ADDRESS = {Ithaca, NY},
PUBLISHER = {Cornell University Library},
VOLUME = {abs/1209.6158},
YEAR = {2012},
PAGES = {1--18},
}
@ARTICLE{DoerrNeumann,
AUTHOR = {Doerr, Benjamin and Neumann, Frank},
JOURNAL = {Algorithmica},
TITLE = {In Memoriam: Ingo Wegener},
ADDRESS = {New York, NY},
NUMBER = {3},
PUBLISHER = {Springer},
VOLUME = {58},
ISBN = {0178-4617},
DOI = {10.1007/s00453-009-9372-6},
YEAR = {2010},
PAGES = {541--542},
}
@ARTICLE{DoerrNeumannWegener2010,
AUTHOR = {Doerr, Benjamin and Neumann, Frank and Wegener, Ingo},
JOURNAL = {Algorithmica},
TITLE = {Editorial},
ADDRESS = {New York, NY},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {57},
ISBN = {0178-4617},
DOI = {10.1007/s00453-009-9373-5},
YEAR = {2010},
PAGES = {119--120},
}
@ARTICLE{DoerrNSW11,
AUTHOR = {Doerr, Benjamin and Neumann, Frank and Sudholt, Dirk and Witt, Carsten},
JOURNAL = {Theoretical Computer Science},
TITLE = {Runtime analysis of the 1-{ANT} ant colony optimizer},
ADDRESS = {Amsterdam},
NUMBER = {17},
PUBLISHER = {Elsevier},
VOLUME = {412},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2010.12.030},
YEAR = {2011},
PAGES = {1629--1644},
}
@INPROCEEDINGS{DoerrP12GECCO,
AUTHOR = {Doerr, Benjamin and Pohl, Sebastian},
EDITOR = {Soule, Terence and Moore, Jason H.},
TITLE = {Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet},
BOOKTITLE = {GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation},
PADDRESS = {New York, NY},
ADDRESS = {Philadelphia, PA},
PUBLISHER = {ACM},
ISBN = {978-1-4503-1177-9},
DOI = {10.1145/2330163.2330346},
YEAR = {2012},
PAGES = {1317--1324},
}
@INPROCEEDINGS{DoerrSTACS2005,
AUTHOR = {Doerr, Benjamin},
EDITOR = {Diekert, Volker and Durand, Bruno},
TITLE = {Roundings Respecting Hard Constraints},
BOOKTITLE = {STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Stuttgart, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3404},
ISBN = {3-540-24998-2},
YEAR = {2005},
PAGES = {617--628},
}
@INPROCEEDINGS{DoerrStacs2006,
AUTHOR = {Doerr, Benjamin},
EDITOR = {Durand, Bruno and Thomas, Wolfgang},
TITLE = {Generating Randomized Roundings with Cardinality Constraints and Derandomizations},
BOOKTITLE = {STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science},
PADDRESS = {Berlin, Germany},
ADDRESS = {Marseille, France},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3884},
ISBN = {3-540-32301-5},
YEAR = {2006},
PAGES = {571--583},
ABSTRACT = {We provide a general method to generate randomized roundings that satisfy
cardinality constraints. Our approach is different from the one taken by
Srinivasan (FOCS 2001) and Gandhi et al. (FOCS 2002) for one global constraint
and the bipartite edge weight rounding problem.
Also for these special cases, our approach is the first that can be
derandomized. For the bipartite edge weight rounding problem, in addition, we
gain an factor run-time improvement for generating the randomized solution.
We also improve the current best result on the general problem of derandomizing
randomized roundings. Here we obtain a simple O(mnlog n) time algorithm that
works in the RAM model for arbitrary matrices with entries in . This improves
over the O(mn2 log(mn)) time solution of Srivastav and Stangier.},
}
@INPROCEEDINGS{DoerrSTW12,
AUTHOR = {Doerr, Benjamin and Sp{\"o}hel, Reto and Thomas, Henning and Winzen, Carola},
TITLE = {Playing Mastermind with Many Colors},
BOOKTITLE = {Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012)},
PADDRESS = {0},
ADDRESS = {Munich. Germany},
PUBLISHER = {0},
YEAR = {2012},
}
@INPROCEEDINGS{DoerrSTW13,
AUTHOR = {Doerr, Benjamin and Sp{\"o}hel, Reto and Thomas, Henning and Winzen, Carola},
TITLE = {Playing Mastermind with many colors},
BOOKTITLE = {Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013)},
ORGANIZATION = {ACM-SIAM},
PADDRESS = {Philadelphia, USA},
ADDRESS = {New Orleans, USA},
PUBLISHER = {SIAM},
ISBN = {9781627484855},
YEAR = {2013},
PAGES = {695--704},
ABSTRACT = {We analyze the general version of the classic guessing game Mastermind with
$n$~positions and $k$~colors. Since the case $k \le n^{1-\eps}$, $\eps>0$
constant, is well understood, we concentrate on larger numbers of colors. For
the most prominent case $k = n$, our results imply that Codebreaker can find
the secret code with $O(n \log \log n)$ guesses. This bound is valid also when
only black answer-pegs are used. It improves the $O(n \log n)$ bound first
proven by Chv\'atal (Combinatorica 3 (1983), 325--329). We also show that if
both black and white answer-pegs are used, then the $O(n \log\log n)$ bound
holds for up to $n^2 \log\log n$ colors. These bounds are almost tight as the
known lower bound of $\Omega(n)$ shows. Unlike for $k \le n^{1-\eps}$, simply
guessing at random until the secret code is determined is not sufficient. In
fact, we show that any non-adaptive strategy needs an expected number of
$\Omega(n \log n)$ guesses.},
}
@INPROCEEDINGS{DoerrSW2013FOGA,
AUTHOR = {Doerr, Benjamin and Sudholt, Dirk and Witt, Carsten},
TITLE = {When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?},
BOOKTITLE = {ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013)},
PADDRESS = {New York, NY},
ADDRESS = {Adelaide, Australia},
PUBLISHER = {ACM},
ISBN = {978-145-031-990-4},
YEAR = {2013},
PAGES = {51--63},
}
@ARTICLE{DoerrTCS2007,
AUTHOR = {Doerr, Benjamin},
JOURNAL = {Theory of Computing Systems},
TITLE = {Roundings respecting hard constraints},
ADDRESS = {Berlin, Germany},
NUMBER = {4},
PUBLISHER = {Springer},
VOLUME = {40},
ISBN = {1432-4350},
DOI = {10.1007/s00224-006-1318-7},
YEAR = {2007},
PAGES = {467--483},
ABSTRACT = { A problem arising in integer linear programming is transforming a solution of
a linear system to an integer one that is "close." The customary model for
investigating such problems is, given a matrix A and a [0,1]-valued vector x,
finding a binary vector y such that ||A(x - y)||∞, the maximum violation of the
constraints, is small. Randomized rounding and the algorithm of Beck and Fiala
are ways to compute such solutions y, whereas linear discrepancy is a lower
bound measure. In many applications one is looking for roundings that, in
addition to being close to the original solution, satisfy some constraints
without violation. The objective of this paper is to investigate such problems
in a unified way. To this aim, we extend the notion of linear discrepancy to
include such hard cardinality constraints. We extend the algorithm of Beck and
Fiala to cope with this setting. If the constraints contain disjoint sets of
variables, the rounding error increases by only a factor of two. We also show
how to generate and derandomize randomized roundings respecting disjoint
cardinality constraints. However, we also provide some examples showing that
additional hard constraints may seriously increase the linear discrepancy. In
particular, we show that the c-color linear discrepancy of a totally unimodular
matrix can be as high as Ω(log c). },
}
@INPROCEEDINGS{DoerrTheileGECCO2009,
AUTHOR = {Doerr, Benjamin and Theile, Madeleine},
EDITOR = {Raidl, G{\"u}nther and Rothlauf, Frank},
TITLE = {Improved Analysis Methods for Crossover-Based Algorithms},
BOOKTITLE = {Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009)},
PADDRESS = {New York, NY},
ADDRESS = {Montreal, Canada},
PUBLISHER = {ACM},
ISBN = {978-1-60558-325-9},
DOI = {10.1145/1569901.1569937},
YEAR = {2009},
PAGES = {247--254},
}
@ARTICLE{DoerrTusnady,
AUTHOR = {Doerr, Benjamin},
JOURNAL = {European Journal of Combinatorics},
TITLE = {Matrix approximation and {Tusn{\'a}dy's} problem},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {3},
PUBLISHER = {Elsevier},
VOLUME = {28},
ISBN = {0195-6698},
YEAR = {2007},
PAGES = {990--995},
ABSTRACT = {We consider the problem of approximating a given matrix by an integer one such
that in all geometric submatrices the sum of the entries does not change by
much. We show that for all integers m,n≥2 and real matrices there is an integer
matrix such that
holds for all intervals I[m], J[n]. Such a matrix can be computed in time
O(mnlog(min{m,n})). The result remains true if we add the requirement |aij−bij|
<2 for all i[m],j[n]. This is surprising.},
}
@INPROCEEDINGS{DoerrW10,
AUTHOR = {Doerr, Benjamin and Winzen, Carola},
EDITOR = {Kulikov, Alexande and Vereshchagin, Nikolay},
TITLE = {Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity},
BOOKTITLE = {Computer Science - Theory and Applications : 6th International Computer Science Symposium in Russia (CSR 2011)},
PADDRESS = {Berlin},
ADDRESS = {St. Petersburg, Russia},
PUBLISHER = {Springer},
MONTH = {June},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6651},
ISBN = {978-3-642-20711-2},
DOI = {10.1007/978-3-642-20712-9_2},
YEAR = {2011},
PAGES = {15--28},
ABSTRACT = {Randomized search heuristics are a broadly used class of general-purpose
algorithms. Analyzing them via classical methods of theoretical computer
science is a growing field. A big step forward would be a useful complexity
theory for such algorithms. We enrich the two existing black-box complexity
notions due to Wegener and other authors by the restrictions that not actual
objective values, but only the relative quality of the previously evaluated
solutions may be taken into account by the algorithm. Many randomized search
heuristics belong to this class of algorithms. We show that the new
ranking-based model gives more realistic complexity estimates for some
problems, while for others the low complexities of the previous models still
hold.},
}
@ARTICLE{DoerrW11ECCC,
AUTHOR = {Doerr, Benjamin and Winzen, Carola},
JOURNAL = {Electronic Colloquium on Computational Complexity},
TITLE = {Memory-Restricted Black-Box Complexity},
VOLUME = {18},
YEAR = {2011},
PAGES = {7},
}
@ARTICLE{DoerrW12,
AUTHOR = {Doerr, Benjamin and Winzen, Carola},
JOURNAL = {Information Processing Letters},
TITLE = {Memory-restricted black-box complexity of {OneMax}},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
VOLUME = {112},
ISBN = {0020-0190},
DOI = {10.1016/j.ipl.2011.10.004},
YEAR = {2012},
PAGES = {32--34},
}
@INPROCEEDINGS{DoerrW12EA,
AUTHOR = {Doerr, Benjamin and Winzen, Carola},
EDITOR = {Hao, Jin-Kao and Legrand, Pierrick and Collet, Pierre and Monmarch{\'e}, Nicolas and Lutton, Evelyne and Schoenauer, Marc},
TITLE = {Black-box complexity: {Breaking} the {O}(n logn) barrier of {LeadingOnes}},
BOOKTITLE = {Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011},
PADDRESS = {Berlin},
ADDRESS = {Angers, France},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7401},
ISBN = {978-3-642-35532-5},
DOI = {10.1007/978-3-642-35533-2_18},
YEAR = {2012},
PAGES = {205--216},
}
@INPROCEEDINGS{DoerrW12GECCO,
AUTHOR = {Doerr, Benjamin and Winzen, Carola},
EDITOR = {Soule, Terence and Moore, Jason H.},
TITLE = {Reducing the arity in unbiased black-box complexity},
BOOKTITLE = {GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, NY},
ADDRESS = {Philadelphia, PA},
PUBLISHER = {ACM},
ISBN = {978-1-4503-1177-9},
DOI = {10.1145/2330163.2330345},
YEAR = {2012},
PAGES = {1309--1316},
ABSTRACT = {We show that for all $1 0$.
This improves upon the previously known bound of $O(\sqrt{n\log\log n/\log
n}$).},
}
@UNPUBLISHED{Elbassioni2007b,
AUTHOR = {Elbassioni, Khaled M. and Sitters, Rene and Zhang, Yan},
TITLE = {A Quasi-PTAS for Envy-free Pricing on Line Graphs},
MONTH = {January},
YEAR = {2007},
ABSTRACT = {We consider the problem of pricing items so as to maximize the profit made from
selling these items. An
instance is given by a set $E$ of $n$ items and a set of $m$ clients, where
each client is specified by one
subset of $E$ (the bundle of items he wants to buy), and a budget, which is the
maximum price he wants to pay
for the subset.
We restrict to the model where the subsets can be arranged such that they form
intervals of a line graph. We give
a quasi-polynomial time approximation scheme for the capacitated and
uncapacitated problem. In the latter
problem, also known as the highway problem, there is an infinite supply of any
item. Hence, we assume that
any client that can afford its bundle will buy it. In the capacitated problem
there is only a limited supply
of any item. Hence, we have to set prices as well to find a subset of the
clients such that the supply
constraints are satisfied. This problem is closely related to the unsplittable
flow problem on line graphs
for which a quasi-PTAS was developed only recently.},
}
@UNPUBLISHED{Elbassioni2007c,
AUTHOR = {Boros, Endre and Elbassioni, Khaled M. and Gurvich, Vladimir and Makino, Kazuhisa},
TITLE = {Generating Vertices of Polyhedra and Related Monotone Generation Problems},
MONTH = {February},
YEAR = {2007},
ABSTRACT = {The well-known vertex enumeration problem calls for generating all the
vertices of a polyhedron, given by its description as a system of linear
inequalities. Recently, a number of combinatorial techniques have been
developed and applied successfully to a large number of enumeration
problems in different areas. We consider four such techniques and give several
examples where they are
applicable to the vertex enumeration problem, and also discuss some of
their limitations.},
}
@INPROCEEDINGS{Elbassioni2007d,
AUTHOR = {Elbassioni, Khaled and Sitters, Rene and Zhang, Yan},
EDITOR = {Arge, Lars and Hoffmann, Michael and Welzl, Emo},
TITLE = {A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs},
BOOKTITLE = {Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings},
PADDRESS = {Berlin},
ADDRESS = {Eilat, Israel},
PUBLISHER = {Springer},
MONTH = {October},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4698},
YEAR = {2007},
PAGES = {451--462},
ABSTRACT = {We consider the problem of pricing items so as to maximize the profit made from
selling these items. An
instance is given by a set $E$ of $n$ items and a set of $m$ clients, where
each client is specified by one
subset of $E$ (the bundle of items he/she wants to buy), and a budget
(valuation), which is the maximum price he is willing to pay
for that subset.
We restrict our attention to the model where the subsets can be arranged such
that they form intervals of a line graph. Assuming an unlimited supply of any
item, this problem is known as \emph{the
highway problem} and so far only an $O(\log n)$-approximation algorithm is
known. We show that a PTAS is likely to exist by presenting a quasi-polynomial
time approximation scheme.
We also combine our ideas with a recently developed quasi-PTAS for the
unsplittable flow problem on line graphs to extend this approximation scheme to
the limited supply version of the pricing problem.},
}
@INPROCEEDINGS{Elbassioni2007e,
AUTHOR = {Boros, Endre and Borys, Konrad and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa and Rudolf, Gabor},
EDITOR = {Lin, Guohui},
TITLE = {Generating Minimal k-Vertex Connected Spanning Subgraphs},
BOOKTITLE = {Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings},
PADDRESS = {Berlin},
ADDRESS = {Banff, Canada},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4598},
YEAR = {2007},
PAGES = {222--231},
}
@INPROCEEDINGS{Elbassioni2007f,
AUTHOR = {Ajwani, Deepak and Elbassioni, Khaled and Govindarajan, Sathish and Ray, Saurabh},
EDITOR = {Gibbons, Phillip B. and Scheideler, Christian},
TITLE = {Conflict-free coloring for rectangle ranges using $n^{.382}$ colors},
BOOKTITLE = {SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures},
PADDRESS = {New York, USA},
ADDRESS = {San Diego, California},
PUBLISHER = {ACM},
YEAR = {2007},
PAGES = {181--187},
}
@ARTICLE{Elbassioni2007g,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Enumerating disjunctions and conjunctions of paths and cuts in reliability theory},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {2},
PUBLISHER = {Elsevier},
VOLUME = {155},
ISBN = {0166-218X},
DOI = {10.1016/j.dam.2006.04.032},
YEAR = {2007},
PAGES = {137--149},
}
@ARTICLE{Elbassioni2007h,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir},
JOURNAL = {Information Processing Letters},
TITLE = {A global parallel algorithm for the hypergraph transversal problem},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {4},
PUBLISHER = {Elsevier},
VOLUME = {101},
ISBN = {0020-0190},
DOI = {10.1016/j.ipl.2006.09.006},
YEAR = {2007},
PAGES = {148--155},
}
@ARTICLE{Elbassioni2007i,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa},
JOURNAL = {Theoretical Computer Science},
TITLE = {Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {3},
PUBLISHER = {Elsevier},
VOLUME = {379},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2007.02.044},
YEAR = {2007},
PAGES = {361--376},
}
@ARTICLE{Elbassioni2007j,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir},
JOURNAL = {Theoretical Computer Science},
TITLE = {On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {2},
PUBLISHER = {Elsevier},
VOLUME = {382},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2007.03.005},
YEAR = {2007},
PAGES = {139--150},
}
@ARTICLE{Elbassioni2008,
AUTHOR = {Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Tiwary, Hans Raj},
JOURNAL = {CoRR},
TITLE = {Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra},
VOLUME = {abs/0801.3790},
YEAR = {2008},
}
@INPROCEEDINGS{Elbassioni2008a,
AUTHOR = {Tiwary, Hans Raj and Elbassioni, Khaled},
TITLE = {On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism},
BOOKTITLE = {Symposium on Computational Geometry 2008},
PADDRESS = {New York, NY, USA},
ADDRESS = {College Park, MD, USA,},
PUBLISHER = {ACM},
YEAR = {2008},
PAGES = {192--198},
}
@INPROCEEDINGS{Elbassioni2008b,
AUTHOR = {Elbassioni, Khaled and Hagen, Matthias and Rauf, Imran},
TITLE = {Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems},
BOOKTITLE = {Parameterized and Exact Computation, Third International Workshop, IWPEC 2008},
PADDRESS = {Berlin},
ADDRESS = {Victoria, Canada},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5018},
YEAR = {2008},
PAGES = {91--102},
}
@INPROCEEDINGS{Elbassioni2008c,
AUTHOR = {Boros, Endre and Elbassioni, Khaled and Makino, Kazuhisa},
TITLE = {On Berge Multiplication for Monotone Boolean Dualization},
BOOKTITLE = {Automata, Languages and Programming, 35th International Colloquium, ICALP 2008},
PADDRESS = {Berlin},
ADDRESS = {Reykjavik, Iceland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5125},
YEAR = {2008},
PAGES = {48--59},
}
@INPROCEEDINGS{Elbassioni2008d,
AUTHOR = {Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa and Oudalov, Vladimir},
TITLE = {A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames},
BOOKTITLE = {Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008},
PADDRESS = {Berlin},
ADDRESS = {Moscow, Russia},
PUBLISHER = {Springer},
VOLUME = {5010},
YEAR = {2008},
PAGES = {99--109},
}
@INPROCEEDINGS{Elbassioni2008e,
AUTHOR = {Elbassioni, Khaled and Tiwary, Hans Raj},
TITLE = {On a Cone Covering Problem},
BOOKTITLE = {Proceedings of the 20th Annual Canadian Conference on Computational Geometry},
PADDRESS = {Canada},
ADDRESS = {Montreal, Canada},
PUBLISHER = {CCCG},
YEAR = {2008},
PAGES = {171--174},
}
@ARTICLE{Elbassioni2008f,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Borys, Konrad and Elbassioni, Khaled and Gurvich, Vladimir and Rudolf, Gabor and Zhao, Jihui},
JOURNAL = {Theory Comput. Syst.},
TITLE = {On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction},
NUMBER = {2},
VOLUME = {43},
YEAR = {2008},
PAGES = {204--233},
}
@ARTICLE{Elbassioni2008g,
AUTHOR = {Kutz, Martin and Elbassioni, Khaled and Katriel, Irit and Mahajan, Meena},
JOURNAL = {J. Comput. Syst. Sci.},
TITLE = {Simultaneous matchings: Hardness and approximation},
NUMBER = {5},
VOLUME = {74},
YEAR = {2008},
PAGES = {884--897},
}
@ARTICLE{Elbassioni2008h,
AUTHOR = {Elbassioni, Khaled},
JOURNAL = {Fuzzy Sets and Systems},
TITLE = {A note on systems with max-min and max-product constraints},
NUMBER = {17},
VOLUME = {159},
YEAR = {2008},
PAGES = {2272--2277},
}
@ARTICLE{Elbassioni2008i,
AUTHOR = {Elbassioni, Khaled},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {On the complexity of monotone dualization and generating minimal hypergraph transversals},
NUMBER = {11},
VOLUME = {156},
YEAR = {2008},
PAGES = {2109--2123},
}
@ARTICLE{Elbassioni2008j,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions},
NUMBER = {11},
VOLUME = {156},
YEAR = {2008},
PAGES = {2020--2034},
}
@ARTICLE{Elbassioni2008k,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Borys, Konrad and Elbassioni, Khaled and Gurvich, Vladimir},
JOURNAL = {Discrete \& Computational Geometry},
TITLE = {Generating All Vertices of a Polyhedron Is Hard},
NUMBER = {1-3},
VOLUME = {39},
YEAR = {2008},
PAGES = {174--190},
}
@ARTICLE{Elbassioni2008l,
AUTHOR = {Elbassioni, Khaled and Tiwary, Hans Raj},
JOURNAL = {CoRR},
TITLE = {On Computing the Vertex Centroid of a Polyhedron},
VOLUME = {abs/0806.3456},
YEAR = {2008},
}
@ARTICLE{Elbassioni2008m,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Borys, Konrad and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa},
JOURNAL = {Algorithmica},
TITLE = {Generating Cut Conjunctions in Graphs and Related Problems},
NUMBER = {3},
VOLUME = {51},
YEAR = {2008},
PAGES = {239--263},
}
@ARTICLE{Elbassioni2008n,
AUTHOR = {Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir},
JOURNAL = {Algorithmica},
TITLE = {On Enumerating Minimal Dicuts and Strongly Connected Subgraphs},
NUMBER = {1},
VOLUME = {50},
YEAR = {2008},
PAGES = {159--172},
}
@INCOLLECTION{Elbassioni2008o,
AUTHOR = {Elbassioni, Khaled and Elmasry, Amr and Kamel, Ibrahim},
TITLE = {Indexing Schemes for Multi-dimensional Moving Objects},
BOOKTITLE = {Encyclopedia of GIS},
ADDRESS = {Berlin},
PUBLISHER = {Springer},
YEAR = {2008},
PAGES = {523--529},
}
@ARTICLE{Elbassioni2008p,
AUTHOR = {Elbassioni, Khaled},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {Algorithms for Dualization over Products of Partially Ordered Sets},
ADDRESS = {Philadelphia, Pa.},
NUMBER = {1},
PUBLISHER = {SIAM},
VOLUME = {23},
DOI = {10.1137/050622250},
YEAR = {2009},
PAGES = {487--510},
}
@INPROCEEDINGS{Elbassioni2009a,
AUTHOR = {Elbassioni, Khaled and Raman, Rajiv and Ray, Saurabh and Sitters, Rene},
EDITOR = {Matthieu, Claire},
TITLE = {On the approximability of the maximum feasible subsystem problem with 0/1-coefficients},
BOOKTITLE = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009)},
PADDRESS = {New York, NY},
ADDRESS = {New York, NY, USA},
PUBLISHER = {ACM},
YEAR = {2009},
PAGES = {1210--1219},
}
@INPROCEEDINGS{Elbassioni2009d,
AUTHOR = {Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa},
EDITOR = {Eisenbrand, Friedrich and Shepherd, F. Bruce},
TITLE = {A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information},
BOOKTITLE = {Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010},
PADDRESS = {Berlin},
ADDRESS = {Lausanne, Switzerland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6080},
ISBN = {978-3-642-13035-9},
DOI = {10.1007/978-3-642-13036-6_26},
YEAR = {2010},
PAGES = {341--354},
}
@INPROCEEDINGS{Elbassioni2009ISAAC,
AUTHOR = {Elbassioni, Khaled and Tiwary, Hans Raj},
TITLE = {Complexity of Approximating the Vertex Centroid of a Polyhedron},
BOOKTITLE = {Algorithms and Computation, 20th International Symposium (ISAAC)},
PADDRESS = {Berlin, NY},
ADDRESS = {Honolulu, Hawaii, USA},
PUBLISHER = {Springer},
YEAR = {2009},
PAGES = {413--422},
}
@ARTICLE{Elbassioni2009x,
AUTHOR = {Elbassioni, Khaled and Fishkin, Aleksei V. and Sitters, Ren{\'e}},
JOURNAL = {International Journal of Computational Geometry \& Applications},
TITLE = {Approximation algorithms for the {Euclidean} traveling salesman problem with discrete and continuous neighborhoods},
ADDRESS = {Singapore},
NUMBER = {2},
PUBLISHER = {World Scientific Publ.},
VOLUME = {19},
ISBN = {0218-1959},
DOI = {10.1142/S0218195909002897},
YEAR = {2009},
PAGES = {173--193},
}
@INPROCEEDINGS{Elbassioni2010,
AUTHOR = {Canzar, Stefan and Elbassioni, Khaled and Elmasry, Amr and Raman, Rajiv},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
TITLE = {On the Approximability of the Maximum Interval Constrained Coloring Problem},
BOOKTITLE = {Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II},
PADDRESS = {Berlin},
ADDRESS = {Jeju Island, Korea},
PUBLISHER = {Springer},
MONTH = {December},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6507},
ISBN = {978-3-642-17513-8},
DOI = {10.1007/978-3-642-17514-5_15},
YEAR = {2010},
PAGES = {168--179},
}
@INPROCEEDINGS{Elbassioni2010a,
AUTHOR = {Elbassioni, Khaled and Chan, Hubert},
EDITOR = {Charikar, Moses},
TITLE = {A {QPTAS} for {TSP} with Fat Weakly Disjoint Neighborhoods in Doubling Metrics},
BOOKTITLE = {Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010)},
PADDRESS = {Philadelphia, PA},
ADDRESS = {Austin, USA},
PUBLISHER = {SIAM},
MONTH = {January},
ISBN = {978-0-898716-98-6},
YEAR = {2010},
PAGES = {256--267},
}
@INPROCEEDINGS{Elbassioni2010b,
AUTHOR = {Elbassioni, Khaled and Matijevic, Domagoj and Severdija, Domagoj},
EDITOR = {Vahrenhold, Jan},
TITLE = {Guarding 1.5-Dimensional with Demands},
BOOKTITLE = {26th European Workshop on Computational Geometry (EuroCG 2010)},
PADDRESS = {Dortmund},
ADDRESS = {Dortmund, Germany},
PUBLISHER = {Technische Universit{\"a}t Dortmund},
YEAR = {2010},
PAGES = {133--136},
}
@INPROCEEDINGS{Elbassioni2010g,
AUTHOR = {Elbassioni, Khaled and Fouz, Mahmoud and Swamy, Chaitanya},
EDITOR = {Saberi, Amin},
TITLE = {Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply},
BOOKTITLE = {Internet and Network Economics : 6th International Workshop, WINE 2010},
PADDRESS = {Berlin},
ADDRESS = {Stanford, CA, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6484},
ISBN = {978-3-642-17571-8},
DOI = {10.1007/978-3-642-17572-5_39},
YEAR = {2010},
PAGES = {462--472},
}
@UNPUBLISHED{Elbassioni2010h,
AUTHOR = {Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa},
TITLE = {On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person Games},
YEAR = {2010},
}
@INPROCEEDINGS{Elbassioni2010i,
AUTHOR = {Christodoulou, George and Elbassioni, Khaled and Fouz, Mahmoud},
EDITOR = {Saberi, Amin},
TITLE = {Truthful Mechanisms for Exhibitions},
BOOKTITLE = {Internet and Network Economics : 6th International Workshop, WINE 2010},
PADDRESS = {Berlin},
ADDRESS = {Stanford, CA, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6484},
ISBN = {978-3-642-17571-8},
DOI = {10.1007/978-3-642-17572-5_14},
YEAR = {2010},
PAGES = {170--181},
}
@ARTICLE{Elbassioni2011a,
AUTHOR = {Elbassioni, Khaled and Tiwary, Hans Raj},
JOURNAL = {Computational Geometry},
TITLE = {On a cone covering problem},
ADDRESS = {Amsterdam},
NUMBER = {3},
PUBLISHER = {Elsevier},
VOLUME = {44},
DOI = {10.1016/j.comgeo.2010.07.004},
YEAR = {2011},
PAGES = {129--134},
}
@UNPUBLISHED{Elbassioni2011d,
AUTHOR = {Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa},
TITLE = {A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games},
YEAR = {2011},
NOTE = {unpublished},
}
@INPROCEEDINGS{Elbassioni2011e,
AUTHOR = {Boros, Endre and Elbassioni, Khaled and Fouz, Mahmoud and Gurvich, Vladimir and Makino, Kazuhisa and Manthey, Bodo},
EDITOR = {Aceto, Luca and Henzinger, Monika and Sgall, Jiri},
TITLE = {Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes},
BOOKTITLE = {Automata, Languages and Programming : 38th International Colloquium, ICALP 2011},
PADDRESS = {Berlin},
ADDRESS = {Zurich, Switzerland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6755},
ISBN = {978-3-642-22005-0},
DOI = {10.1007/978-3-642-22006-7_13},
YEAR = {2011},
PAGES = {147--158},
}
@INPROCEEDINGS{Elbassioni2011f,
AUTHOR = {Canzar,Stefan and Elbassioni, Khaled and Klau, Gunnar W. and Mestre, Julian},
EDITOR = {Aceto, Luca and Henzinger, Monika and Sgall, Jiri},
TITLE = {On Tree-Constrained Matchings and Generalizations},
BOOKTITLE = {Automata, Languages and Programming : 38th International Colloquium, ICALP 2011},
PADDRESS = {Berlin},
ADDRESS = {Zurich, Switzerland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6755},
ISBN = {978-3-642-22005-0},
DOI = {10.1007/978-3-642-22006-7_9},
YEAR = {2011},
PAGES = {98--109},
}
@INPROCEEDINGS{Elbassioni2011g,
AUTHOR = {Elbassioni, Khaled and Rauf, Imran and Ray, Saurabh},
EDITOR = {Collette, Sebastien},
TITLE = {Enumerating Minimal Transversals of Geometric Hypergraphs},
BOOKTITLE = {23rd Canadian Conference on Computational Geometry (CCCG 2011)},
PADDRESS = {Toronto},
ADDRESS = {Toronto, Canada},
PUBLISHER = {CCCG},
YEAR = {2011},
PAGES = {437--442},
}
@UNPUBLISHED{Elbassioni2011h,
AUTHOR = {Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa},
TITLE = {Every Stochastic Game with Perfect Information Admits a Canonical Form},
BOOKTITLE = {2nd International ICST Conference on Game Theory for Networks (GameNets 2011)},
ADDRESS = {Berlin},
NUMBER = {10},
PUBLISHER = {Springer},
SERIES = {Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (LNICST)},
YEAR = {2012},
}
@ARTICLE{Elbassioni2011i,
AUTHOR = {Elbassioni, Khaled and Elmasry, Amr and Makino, Kazuhisa},
JOURNAL = {International Journal of Computational Geometry \& Applications},
TITLE = {Finding Simplices containing the Origin in Two and Three Dimensions},
ADDRESS = {Singapore},
NUMBER = {5},
PUBLISHER = {World Scientific},
VOLUME = {21},
ISBN = {0218-1959},
DOI = {10.1142/S0218195911003779},
YEAR = {2011},
PAGES = {495--506},
}
@ARTICLE{Elbassioni2011j,
AUTHOR = {Chan, T.-H. Hubert and Elbassioni, Khaled},
JOURNAL = {Discrete \& Computational Geometry},
TITLE = {A {QPTAS} for {TSP} with Fat Weakly Disjoint Neighborhoods in Doubling Metrics},
ADDRESS = {New York, NY},
NUMBER = {4},
PUBLISHER = {Springer},
VOLUME = {46},
DOI = {10.1007/s00454-011-9337-9},
YEAR = {2011},
PAGES = {704--723},
}
@ARTICLE{Elbassioni2011k,
AUTHOR = {Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Tiwary, Hans Raj},
JOURNAL = {Annals of Operations Research},
TITLE = {The negative cycles polyhedron and hardness of checking some polyhedral properties},
ADDRESS = {New York, NY},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {188},
DOI = {10.1007/s10479-010-0690-5},
YEAR = {2011},
PAGES = {63--76},
}
@ARTICLE{Elbassioni2011l,
AUTHOR = {Althaus, Ernst and Canzar, Stefan and Elbassioni, Khaled and Karrenbauer, Andreas and Mestre, Julian},
JOURNAL = {Algorithmica},
TITLE = {Approximation Algorithms for the Interval Constrained Coloring Problem},
ADDRESS = {New York, NY},
NUMBER = {2},
PUBLISHER = {Springer},
VOLUME = {61},
ISBN = {0178-4617},
DOI = {10.1007/s00453-010-9406-0},
YEAR = {2011},
PAGES = {342--361},
}
@ARTICLE{Elbassioni2011m,
AUTHOR = {Elbassioni, Khaled and Krohn, Erik and Matijevic, Domagoj and Mestre, Julian and Severdija, Domagoj},
JOURNAL = {Algorithmica},
TITLE = {Improved Approximations for Guarding 1.5-Dimensional Terrains},
ADDRESS = {New York NY},
NUMBER = {2},
PUBLISHER = {Springer},
VOLUME = {60},
DOI = {10.1007/s00453-009-9358-4},
YEAR = {2011},
PAGES = {451--463},
}
@ARTICLE{Elbassioni2011n,
AUTHOR = {Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa},
JOURNAL = {Discrete Mathematics},
TITLE = {On {Nash} equilibria and improvement cycles in pure positional strategies for {Chess}-like and {Backgammon}-like n-person games},
ADDRESS = {Amsterdam},
NUMBER = {4},
PUBLISHER = {Elsevier},
VOLUME = {312},
ISBN = {0012-365X},
DOI = {10.1016/j.disc.2011.11.011},
YEAR = {2012},
PAGES = {772--788},
}
@INPROCEEDINGS{Elbassioni2012a,
AUTHOR = {Elbassioni, Khaled and Paluch, Katarzyna and van Zuylen, Anke},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
TITLE = {Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem},
BOOKTITLE = {29th International Symposium on Theoretical Aspects of Computer Science : STACS'12},
PADDRESS = {Dagstuhl},
ADDRESS = {Paris, France},
PUBLISHER = {Schloss Dagstuhl/ Leibniz-Zentrum f{\"u}r Informatik},
SERIES = {LIPIcs},
VOLUME = {14},
ISBN = {978-3-939897-35-4},
DOI = {10.4230/LIPIcs.STACS.2012.501},
YEAR = {2012},
PAGES = {501--506},
}
@ARTICLE{Elbassioni2012b,
AUTHOR = {Elbassioni, Khaled and Tiwary, Hans Raj},
JOURNAL = {Theoretical Computer Science},
TITLE = {Complexity of Approximating the Vertex Centroid of a Polyhedron},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
VOLUME = {421},
DOI = {10.1016/j.tcs.2011.11.017},
YEAR = {2012},
PAGES = {56--61},
}
@INPROCEEDINGS{Elbassioni2012c,
AUTHOR = {Canzar, Stefan and El-Kebir, Mohammed and Pool, Rene and Elbassioni, Khaled and Malde, Alpeshkumar K. and Mark, Alan E. and Geerke, Daan P. and Stougie, Leen and Klau, Gunnar W.},
EDITOR = {Chor, Benny},
TITLE = {Charge Group Partitioning in Biomolecular Simulation},
BOOKTITLE = {Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012},
PADDRESS = {Berlin},
ADDRESS = {Barcelona, Spain},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Bioinformatics},
VOLUME = {7262},
ISBN = {978-3-642-29626-0},
DOI = {10.1007/978-3-642-29627-7_3},
YEAR = {2012},
PAGES = {29--43},
}
@UNPUBLISHED{Elbassioni2012d,
AUTHOR = {Elbassioni, Khaled and Rauf, Imran and Ray, Saurabh},
TITLE = {On Enumerating Minimal Transversals of Geometric Hypergraphs},
YEAR = {??},
}
@INPROCEEDINGS{Elbassioni2012e,
AUTHOR = {Elbassioni, Khaled},
EDITOR = {Czumaj, Artur and Mehlhorn, Kurt and Pitts, Andrew M. and Wattenhofer, Roger},
TITLE = {A {QPTAS} for $\varepsilon$-Envy-Free Profit-Maximizing Pricing on Line Graphs},
BOOKTITLE = {Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012},
PADDRESS = {Berlin},
ADDRESS = {Warwick, UK},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7392},
ISBN = {978-3-642-31584-8},
DOI = {10.1007/978-3-642-31585-5_46},
YEAR = {2012},
PAGES = {513--524},
}
@INPROCEEDINGS{Elbassioni2012f,
AUTHOR = {Elbassioni, Khaled and Fouad, Mohamed and Bertino, Elisa},
TITLE = {Modeling the Risk \& Utility of Information Sharing in Social Networks},
BOOKTITLE = {2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and
2012 ASE/IEEE International Conference on Social Computing : SocialCom/PASSAT 2012},
PADDRESS = {Piscataway, NJ},
ADDRESS = {Amsterdam, the Netherlands},
PUBLISHER = {IEEE},
ISBN = {978-0-7695-4848-7},
DOI = {10.1109/SocialCom-PASSAT.2012.131},
YEAR = {2012},
PAGES = {441--450},
}
@INPROCEEDINGS{Elbassioni2012g,
AUTHOR = {Elbassioni, Khaled and Garg, Naveen and Gupta, Divya and Kumar, Amit and Narula, Vishal and Pal, Arindam},
EDITOR = {D'Souza, Deepak and Kavitha, Telikepalli and Radhakrishnan, Jaikumar},
TITLE = {Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees},
BOOKTITLE = {32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012},
PADDRESS = {Dagstuhl},
ADDRESS = {Hyderabad, India},
PUBLISHER = {Schlo{\ss} Dagstuhl/Leibniz Zentrum f{\"u}r Informatik},
SERIES = {LIPIcs},
VOLUME = {18},
ISBN = {978-3-939897-47-7},
DOI = {10.4230/LIPIcs.FSTTCS.2012.267},
YEAR = {2012},
PAGES = {267--275},
}
@ARTICLE{Elbassioni2012h,
AUTHOR = {Elbassioni, Khaled and Raman, Rajiv and Ray, Saurabh and Sitters, Ren{\'e}},
JOURNAL = {Theoretical Computer Science},
TITLE = {On the complexity of the highway problem},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
VOLUME = {460},
DOI = {10.1016/j.tcs.2012.07.028},
YEAR = {2012},
PAGES = {70--77},
}
@ARTICLE{Elbassioni2012i,
AUTHOR = {Elbassioni, Khaled and Jeli´c, Slobodan and Matijevi`c, Domagoj},
JOURNAL = {Theoretical Computer Science},
TITLE = {The relation of Connected Set Cover and Group {Steiner} Tree},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
VOLUME = {438},
DOI = {10.1016/j.tcs.2012.02.035},
YEAR = {2012},
PAGES = {96--101},
}
@UNPUBLISHED{Elbassioni2012j,
AUTHOR = {Canzar, Stefan and Elbassioni, Khaled and Klau, Gunnar W. and Mestre, Julian},
TITLE = {On Tree-Constrained Matchings and Generalizations},
YEAR = {2011},
}
@ARTICLE{Elbassioni2012z,
AUTHOR = {Elbassioni, Khaled and Matijevic, Domagoj and Severdija, Domagoj},
JOURNAL = {International Journal of Computer Mathematics},
TITLE = {Guarding 1.5{D} terrains with demands},
ADDRESS = {London},
NUMBER = {16},
PUBLISHER = {Taylor and Francis},
VOLUME = {89},
DOI = {10.1080/00207160.2012.707800},
YEAR = {2012},
PAGES = {2143--2151},
}
@UNPUBLISHED{Elbassioni2013a,
AUTHOR = {Elbassioni, Khaled and Chalermsook, Parinya and Nanongkai, Danupon and Sun, He},
TITLE = {Multi-Attribute Profit-Maximizing Pricing},
YEAR = {2013},
}
@INPROCEEDINGS{ElbassioniKatriel2004,
AUTHOR = {Elbassioni, Khaled M. and Katriel, Irit},
EDITOR = {Bart{\'a}k, Roman and Milano, Michela},
TITLE = {Multiconsistency and Robustness with Global Constraints},
BOOKTITLE = {Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Second International Conference, CPAIOR 2005},
PADDRESS = {Berlin, Germany},
ADDRESS = {Prague, Czech Republic},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3524},
ISBN = {3-540-26152-4},
YEAR = {2005},
PAGES = {168--182},
ABSTRACT = {We propose a natural generalization of arc-consistency, which
we call multiconsistency: A value $v$ in the domain of a variable
$x$ is $k$-multiconsistent with respect to a constraint $C$ if
there are at least $k$ solutions to $C$ in which $x$ is assigned the
value $v$. We present algorithms that determine which edges are
$k$-multiconsistent with respect to several well known global
constraints. In addition, we show that finding super solutions
is strictly harder than finding arbitrary solutions and suggest
multiconsistency as an alternative way to search for robust solutions.},
}
@ARTICLE{ElbassioniKatriel2006,
AUTHOR = {Elbassioni, Khaled M.},
JOURNAL = {Constraints},
TITLE = {Multiconsistency and Robustness with Global Constraints},
NUMBER = {4},
VOLUME = {11},
YEAR = {2006},
PAGES = {335--352},
ABSTRACT = {We propose a natural generalization of arc-consistency, which we call
multiconsistency: a value v in the domain of a variable x is k-multiconsistent
with respect to a constraint C if there are at least k solutions to C in which
x is assigned the value v. We present algorithms that determine which
variable-value pairs are k-multiconsistent with respect to several well known
global constraints. In addition, we show that finding super solutions is
sometimes strictly harder than finding arbitrary solutions for these
constraints and suggest multiconsistency as an alternative way to search for
robust solutions.},
}
@ARTICLE{ElbassioniMestre2009a,
AUTHOR = {Elbassioni, Khaled M. and Krohn, Erik and Matijevic, Domagoj and Mestre, Juli{\'a}n and Severdija, Domagoj},
JOURNAL = {Algorithmica},
TITLE = {Improved Approximations for Guarding 1.5-Dimensional Terrains},
ADDRESS = {New York, NY},
PUBLISHER = {Springer},
MONTH = {September},
VOLUME = {Online First},
ISBN = {1432-0541},
DOI = {10.1007/s00453-009-9358-4},
YEAR = {2009},
PAGES = {1--13},
}
@ARTICLE{ElbassioniRauf2010,
AUTHOR = {Elbassioni, Khaled and Rauf, Imran},
JOURNAL = {Discrete Mathematics},
TITLE = {Polynomial-time dualization of r-exact hypergraphs with applications in geometry},
ADDRESS = {Amsterdam},
NUMBER = {17-18},
PUBLISHER = {Elsevier},
VOLUME = {310},
ISBN = {0012-365X},
DOI = {10.1016/j.disc.2010.05.017},
YEAR = {2010},
PAGES = {2356--2363},
}
@UNPUBLISHED{ElbRau09a,
AUTHOR = {Elbassioni, Khaled and Rauf, Imran},
TITLE = {Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in Geometry},
MONTH = {March},
YEAR = {2010},
PAGES = {12},
NOTE = {(submitted to a journal)},
ABSTRACT = {Let $\cH\subseteq 2^V$ be a hypergraph on vertex set $V$. For a positive
integer $r$, we call $\cH$ $r$-exact, if
any minimal transversal of $\cH$ intersects any hyperedge of $\cH$ in at most
$r$ vertices.
This class includes several interesting examples from geometry, e.g.,
circular-arc hypergraphs ($r=2$), hypergraphs defined by sets of axis-parallel
lines stabbing a given set of $\alpha$-fat objects ($r=4\alpha$), and
hypergraphs defined by sets of points contained in translates of a given cone
in the plane ($r=2$). For constant $r$, we give a polynomial-time algorithm for
the duality testing problem of a pair of $r$-exact hypergraphs. This result
implies that minimal hitting sets for the above geometric hypergraphs can be
generated in output-sensitive polynomial time. },
}
@ARTICLE{ElKahoui1996,
AUTHOR = {El Kahoui, M'hammed},
JOURNAL = {Journal of Complexity},
TITLE = {An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve},
NUMBER = {4},
PUBLISHER = {Elsevier},
VOLUME = {12},
ISBN = {0885-064X},
YEAR = {1996},
PAGES = {527--544},
ABSTRACT = {The computation of the topological shape of a real algebraic plane curve is
usually driven by the study of the behavior of the curve around its critical
points (which includes also the singular points). In this paper we present a
new algorithm computing the topological shape of a real algebraic plane curve
whose complexity is better than the best algorithms known. This is due to the
avoiding, through a sufficiently good change of coordinates, of real root
computations on polynomials with coefficients in a simple real algebraic
extension of $\mathbb{Q}$ to deal with the critical points of the considered
curve. In fact, one of the main features of this algorithm is that its
complexity is dominated by the characterization of the real roots of the
discriminant of the polynomial defining the considered curve.},
}
@ARTICLE{ElKahoui2000,
AUTHOR = {El Kahoui, M'hammed},
JOURNAL = {Journal of Symbolic Computation},
TITLE = {Deciding {H}opf bifurcations by quantifier elimination in a software-component architecture},
NUMBER = {2},
PUBLISHER = {Elsevier},
VOLUME = {30},
ISBN = {0747-7171},
YEAR = {2000},
PAGES = {161--179},
ABSTRACT = {In this paper we give a semi-algebraic description of Hopf bifurcation fixed
points for
a given parameterized polynomial vector field. The description is carried out
by use of
the Hurwitz determinants, and produces a first-order formula which is
transformed into
a quantifier free formula by use of usual quantifier elimination algorithms. We
apply
techniques from the theory of sub-resultant sequences and of Gr¨obner bases to
come up
with efficient reductions, which lead to quantifier elimination questions that
can often
be handled by existing quantifier elimination packages.
We could implement the algorithms for the conditions on Hopf bifurcations by
combining
the computer algebra system Maple with packages for quantifier elimination using
a Java based component architecture recently developed by the second author. In
addition
to some textbook examples we applied our software system to an example discussed
in a recent research paper.},
}
@ARTICLE{ElKahoui2001,
AUTHOR = {El Kahoui, M'hammed},
JOURNAL = {Mathematics and Computers in Simulation},
TITLE = {Improved algorithms for linear complementarity problems arising from collision response},
NUMBER = {1},
PUBLISHER = {Elsevier},
MONTH = {March},
VOLUME = {56},
ISBN = {0378-4754},
YEAR = {2001},
PAGES = {69--93},
ABSTRACT = {In this paper we give algorithms for solving linear complementarity problems
for $\mathcal{P}$-matrices and symmetric positive semidefinite matrices. Our
approach of the problem turns out to be an improvement and a more precise
formulation of Baraff’s method for problems arising from collision response.
The theorems that prove the correctness of our algorithm can also be used to
prove the correctness of Baraff’s algorithm.
An important feature of the method we present lies in its validity for
arbitrary real closed fields, thus it is well suited to handle, at least
locally, parametric linear complementarity problems.
This article presents the theoretical principles of the algorithms and gives
detailed pseudo-code descriptions of them. },
}
@ARTICLE{ElKahoui2002a,
AUTHOR = {Bouziane, Driss and El Kahoui, M'hammed},
JOURNAL = {Journal of Symbolic Computation},
TITLE = {Computation of the dual of a plane projective curve},
NUMBER = {2},
PUBLISHER = {Elsevier},
MONTH = {September},
VOLUME = {34},
ISBN = {0747-7171},
YEAR = {2002},
PAGES = {105--117},
ABSTRACT = {In this paper we describe an algorithm for computing the dual of a projective
plane curve. The algorithm requires no extension of the field of coefficients
of the curve and runs in polynomial time.},
}
@ARTICLE{ElKahoui2002b,
AUTHOR = {El Kahoui, M'hammed},
JOURNAL = {Electronic Journal of Differential Equations},
TITLE = {On plane polynomial vector fields and the {P}oincar\'e problem},
NUMBER = {37},
VOLUME = {2002},
ISBN = {1072-6691},
YEAR = {2002},
PAGES = {1--23},
ABSTRACT = {In this paper we address the Poincar\'e problem, on plane
polynomial vector fields, under some conditions on the nature
of the singularities of invariant curves. Our main idea
consists in transforming a given vector field of degree $m$
into another one of degree at most $m+1$ having its invariant
curves in projective quasi-generic position. This allows us to
give bounds on degree for some well known classes of curves
such as the nonsingular ones and curves with ordinary nodes.
We also give a bound on degree for any invariant curve in terms
of the maximum Tjurina number of its singularities and the
degree of the vector field.},
}
@ARTICLE{ElKahoui2003,
AUTHOR = {El Kahoui, M'hammed},
JOURNAL = {Journal of Symbolic Computation},
TITLE = {An elementary approach to subresultants theory},
NUMBER = {3},
PUBLISHER = {Elsevier},
MONTH = {January},
VOLUME = {35},
ISBN = {0747-7171},
YEAR = {2003},
PAGES = {281--292},
ABSTRACT = {In this paper we give an elementary approach to univariate polynomial
subresultants theory. Most of the known results of subresultants are recovered,
some with more precision, without using Euclidean divisions or existence of
roots for univariate polynomials. The main contributions of this paper are not
new results on subresultants, but rather extensions of the main results over
integral rings to arbitrary commutative rings.},
}
@ARTICLE{ElKahoui2004a,
AUTHOR = {El Kahoui, M'hammed},
JOURNAL = {Proceedings of the Amercian Mathematical Society},
TITLE = {Contants of derivations in polynomial rings over unique factorization domains},
NUMBER = {9},
PUBLISHER = {AMS},
VOLUME = {132},
ISBN = {0002-9939},
YEAR = {2004},
PAGES = {2537--2541},
}
@ARTICLE{ElKahoui2004b,
AUTHOR = {El Kahoui, M'hammed},
JOURNAL = {Linear Algebra and its Applications},
TITLE = {Subresultants and locally nilpotent derivations},
ADDRESS = {Amsterdam, The Netherlands},
PUBLISHER = {Elsevier},
VOLUME = {380},
ISBN = {0024-3795},
YEAR = {2004},
PAGES = {253--261},
ABSTRACT = {In this paper we establish a connection between subresultants and locally
nilpotent derivations over commutative rings containing the rationals. As
consequence of this connection, we prove that for any commutative ring with
unit and any polynomials P and Q in $\mathcal{A}[y]$, the ith subresultant of P
and Q is the determinant of a matrix, depending only on the degrees of P and Q,
whose entries are taken from the list built with P, Q and their successive
Hasse derivatives.},
}
@INPROCEEDINGS{ElKahoui2004c,
AUTHOR = {El Kahoui, M'hammed},
EDITOR = {Gutierrez, Jaime},
TITLE = {Algorithms for recognizing coordinates in two variables over UFD's},
BOOKTITLE = {Proceedings of the 2004 International Symposium Symbolic and Algebraic Computation (ISSAC-04)},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Santander, Spain},
PUBLISHER = {ACM},
ISBN = {1-58113-827-X},
YEAR = {2004},
PAGES = {135--140},
}
@ARTICLE{ElKahoui2005a,
AUTHOR = {El Kahoui, M'hammed},
JOURNAL = {Journal of Symbolic Computation},
TITLE = {Birational properties of the gap subresultant varieties},
NUMBER = {1},
PUBLISHER = {Elsevier},
VOLUME = {39},
ISBN = {0747-7171},
YEAR = {2005},
PAGES = {61--71},
ABSTRACT = {In this paper we address the problem of understanding the gaps that may occur
in the subresultant
sequence of two polynomials.We define the gap subresultant varieties and prove
that they are rational
and have the expected dimension. We also give explicitly their corresponding
prime ideals.},
}
@ARTICLE{ElKahoui2005b,
AUTHOR = {El Kahoui, M'hammed},
JOURNAL = {Proceedings of the Amercian Mathematical Society},
TITLE = {$D$-resultant and subresultants},
PUBLISHER = {AMS},
VOLUME = {133},
YEAR = {2005},
PAGES = {2193--2199},
NOTE = {To appear in Proceedings of the American Mathematical Society},
}
@ARTICLE{ElKahoui2005c,
AUTHOR = {El Kahoui, M'hammed},
JOURNAL = {Journal of Algebra},
TITLE = {UFDs with commuting linearly independent locally nilpotent derivations},
NUMBER = {1},
PUBLISHER = {Elsevier},
VOLUME = {289},
YEAR = {2005},
PAGES = {446--452},
ABSTRACT = {In this paper we study affine -UFDs of transcendence degree n without
nonconstant units, having n−1 commuting linearly independent locally nilpotent
-derivations. We prove in case n=2, and algebraically closed of characteristic
zero, that such rings are polynomial rings in two variables over . We then show
that the commuting derivations Conjecture is equivalent to a weak version of
the Abhyankar–Sathaye Conjecture.},
}
@ARTICLE{ElKahoui2005d,
AUTHOR = {Brown, Christopher and El Kahoui, M'hammed and Novotni, Dominik and Weber, Andreas},
JOURNAL = {Journal of Symbolic Computation},
TITLE = {Algorithmic methods for investigating equilibria in epidemic modeling},
NUMBER = {11},
VOLUME = {41},
DOI = {10.1016/j.jsc.2005.09.011},
YEAR = {2006},
PAGES = {1157--1173},
ABSTRACT = {The calculation of threshold conditions for models of infectious diseases is of
central importance for developing vaccination policies. These models are often
coupled systems of ordinary differential equations, in which case the
computation of threshold conditions can be reduced to the question of stability
of the disease-free equilibrium. This paper shows how computing threshold
conditions for such models can be done fully algorithmically using quantifier
elimination for real closed fields and related simplification methods for
quantifier-free formulas. Using efficient quantifier elimination techniques for
special cases that have been developed by Weispfenning and others, we can also
compute whether there are ranges of parameters for which sub-threshold endemic
equilibria exist.},
}
@MISC{ElKahoui2005e,
AUTHOR = {El Kahoui, M'hammed},
TITLE = {Computing with algebraic curves in generic position},
HOWPUBLISHED = {Submitted to Journal of Computation and Mathematics},
YEAR = {2008},
PAGES = {19},
NOTE = {Submitted to Journal of Computation and Mathematics},
}
@MISC{ElKahoui2005f,
AUTHOR = {El Kahoui, M'hammed},
TITLE = {Polynomial parametrization of nonsingular algebraic curves},
HOWPUBLISHED = {Submitted to Computer Aided Geometric Design},
YEAR = {2008},
NOTE = {Submitted to Computer Aided Geometric Design},
}
@ARTICLE{ElKahoui2005g,
AUTHOR = {El Kahoui, M'hammed and Rakrak, Said},
JOURNAL = {Mathematics of Computation},
TITLE = {Structure of {Groebner} bases with respect to block orders},
NUMBER = {260},
PUBLISHER = {American Mathematical Society},
VOLUME = {76},
ISBN = {0025-5718},
DOI = {10.1090/S0025-5718-07-01972-2},
YEAR = {2007},
PAGES = {2181--2187},
ABSTRACT = {In this paper we study the structure of Gr{\"o}bner bases with respect to block
orders. We extend Lazard's theorem and the Gianni-Kalkbrenner theorem to the
case of a zero-dimensional ideal whose trace in the ring generated by the first
block of variables is radical. We then show that they do not hold for general
zero-dimensional ideals. },
}
@ARTICLE{Elmasry2008a,
AUTHOR = {Elmasry, Amr and Hammad, Abdelrahman},
JOURNAL = {ACM Journal of Experimental Algorithmics},
TITLE = {Inversion-Sensitive Sorting Algorithms in Practice},
ADDRESS = {New York, USA},
NUMBER = {1},
PUBLISHER = {Association for Computing Machinery},
MONTH = {December},
VOLUME = {13},
ISBN = {1084-6654},
DOI = {10.1145/1412228.1455267},
YEAR = {2008},
PAGES = {1--18},
ABSTRACT = {We study the performance of the most practical inversion-sensitive internal
sorting algorithms. Experimental results illustrate that adaptive AVL sort
consumes the fewest number of comparisons unless the number of inversions is
less than $1\%$; in such case Splaysort consumes the fewest number of
comparisons. On the other hand, the running time of Quicksort is superior
unless the number of inversions is less than $1.5\%$; in such case Splaysort
has the shortest running time.
Another interesting result is that although the number of cache misses for the
cache-optimal Greedysort algorithm was the least, compared to other adaptive
sorting algorithms under investigation, it was outperformed by Quicksort.},
}
@ARTICLE{Elmasry2008b,
AUTHOR = {Elmasry, Amr and Jensen, Claus and Katajainen, Jyrki},
JOURNAL = {ACM Transactions on Algorithms},
TITLE = {Multipartite Priority Queues},
ADDRESS = {New York, USA},
NUMBER = {1},
PUBLISHER = {Association for Computing Machinery (ACM)},
MONTH = {November},
VOLUME = {5},
ISBN = {1549-6325},
DOI = {10.1145/1435375.1435389},
YEAR = {2008},
PAGES = {1--19},
ABSTRACT = {We introduce a framework for reducing the number of element
comparisons performed in priority-queue operations. In particular, we
give a priority queue which guarantees the worst-case cost of $O(1)$
per minimum finding and insertion, and the worst-case cost of $O(\log
n)$ with at most $\log n + O(1)$ element comparisons per minimum
deletion and deletion, improving the bound of $2\log n + O(1)$ known for
binomial queues. Here, $n$ denotes the number of elements stored in the
data structure prior to the operation in question, and $\log n$ equals
$\log_2(\max\set{2, n})$. As an immediate application of the priority queue
developed, we obtain a sorting algorithm that is optimally adaptive with
respect to the inversion measure of disorder, and that sorts a sequence
having $n$ elements and $I$ inversions with at most $n \log (I/n) + O(n)$
element comparisons.},
}
@ARTICLE{Elmasry2008c,
AUTHOR = {Elmasry, Amr and Jensen, Claus and Katajainen, Jyrki},
JOURNAL = {Computing},
TITLE = {Two New Methods for Constructing Double-Ended Priority Queues from Priority Queues},
ADDRESS = {Berlin, Germany},
NUMBER = {4},
PUBLISHER = {Springer Wein},
MONTH = {November},
VOLUME = {83},
ISBN = {1436-5057},
DOI = {10.1007/s00607-008-0019-2},
YEAR = {2008},
PAGES = {193--204},
ABSTRACT = {We introduce two data-structural transformations to construct double-ended
priority queues from priority queues. To apply our transformations the priority
queues exploited must support the
extraction of an unspecified element, in addition to the standard
priority-queue operations. With the first transformation we obtain a
double-ended priority queue which guarantees the worst-case cost of $O(1)$ for
\Findmin{}, \Findmax{}, \Insert{}, \Extract{}; and the worst-case cost of
$O(\lg n)$ with at most $\lg n + O(1)$ element comparisons for \Delete{}. With
the second transformation we get a meldable double-ended priority queue which
guarantees the worst-case cost of $O(1)$ for \Findmin{}, \Findmax{}, \Insert{},
\Extract{}; the worst-case cost of $O(\lg n)$ with at most $\lg n + O(\lg \lg
n)$ element comparisons for \Delete{}; and the worst-case cost of
$O(\min\set{\lg m, \lg n})$ for \Meld{}. Here, $m$ and $n$ denote the number
of elements stored in the data structures prior to the operation in question.},
}
@TECHREPORT{Elmasry2008d,
AUTHOR = {Elmasry, Amr},
EDITOR = {Elmasry, Amr},
TITLE = {Violation Heaps: A Better Substitute for Fibonacci Heaps},
INSTITUTION = {CoRR},
TYPE = {Research Report},
ADDRESS = {http://arxiv.org/abs/0812.2851},
NUMBER = {CoRR abs/0812.2851},
YEAR = {2008},
PAGES = {10},
ABSTRACT = {We give a priority queue that achieves the same amortized bounds as Fibonacci
heaps. Namely, find-min requires $O(1)$ worst-case time, insert, meld and
decrease-key require $O(1)$ amortized time, and delete-min requires $O(\log n)$
amortized time. Our structure is simple and promises a more efficient practical
behavior compared to any other known Fibonacci-like heap. },
}
@INPROCEEDINGS{Elmasry2009,
AUTHOR = {Elmasry, Amr},
EDITOR = {Matthieu, Claire},
TITLE = {Pairing Heaps with {O(log} log n) decrease Cost},
BOOKTITLE = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009)},
ORGANIZATION = {Association for Computing Machinery (ACM) and Society for Industrial and Applied Mathematics (SIAM)},
PADDRESS = {New York, NY},
ADDRESS = {New York, USA},
PUBLISHER = {ACM},
MONTH = {January},
YEAR = {2009},
PAGES = {471--476},
ABSTRACT = {We give a variation of the pairing heaps for which the time bounds for all the
operations match the lower bound proved by Fredman for a family of similar
self-adjusting heaps.
Namely, our heap structure requires $O(1)$ for insert and find-min,
$O(\log{n})$ for delete-min, and $O(\log\log{n})$ for decrease-key and meld
(all the bounds are in the amortized sense except for find-min).},
}
@ARTICLE{Elmasry2009x,
AUTHOR = {Elmasry, Amr},
JOURNAL = {Information Processing Letters},
TITLE = {Computing the subset partial order for dense families of sets},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {18},
PUBLISHER = {Elsevier},
VOLUME = {109},
ISBN = {0020-0190},
DOI = {10.1016/j.ipl.2009.07.001},
YEAR = {2009},
PAGES = {1082--1086},
}
@ARTICLE{Elmasry2010,
AUTHOR = {Elmasry, Amr},
JOURNAL = {International Journal of Computer Mathematics},
TITLE = {Pairing heaps, scrambled pairing and square-root trees},
ADDRESS = {London},
NUMBER = {14},
PUBLISHER = {Taylor \& Francis},
VOLUME = {87},
ISBN = {0020-7160},
DOI = {10.1080/00207160903029810},
YEAR = {2010},
PAGES = {3096--3110},
}
@ARTICLE{Elmasry2010a,
AUTHOR = {Elmasry, Amr},
JOURNAL = {Information Processing Letters},
TITLE = {The longest almost-increasing subsequence},
ADDRESS = {Amsterdam},
NUMBER = {16},
PUBLISHER = {Elsevier},
VOLUME = {110},
ISBN = {0020-0190},
DOI = {10.1016/j.ipl.2010.05.022},
YEAR = {2010},
PAGES = {655--658},
}
@INPROCEEDINGS{Elmasry2010b,
AUTHOR = {Elmasry, Amr and Jensen, Claus and Katajainen, Jyrki},
EDITOR = {Kaplan, Haim},
TITLE = {Strictly-regular number system and data structures},
BOOKTITLE = {Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory},
PADDRESS = {Berlin},
ADDRESS = {Bergen, Norway},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6139},
ISBN = {978-3-642-13730-3},
DOI = {10.1007/978-3-642-13731-0_4},
YEAR = {2010},
PAGES = {26--37},
}
@INPROCEEDINGS{Elmasry2010c,
AUTHOR = {Elmasry, Amr and Jensen, Claus and Katajainen, Jyrki},
EDITOR = {Boldi, Paolo and Gargano, Luisa},
TITLE = {The Magic of a Number System},
BOOKTITLE = {Fun with Algorithms : 5th International Conference, FUN 2010},
PADDRESS = {Berlin},
ADDRESS = {Ischia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6099},
ISBN = {978-3-642-13121-9},
DOI = {10.1007/978-3-642-13122-6_17},
YEAR = {2010},
PAGES = {156--165},
}
@ARTICLE{Elmasry2012,
AUTHOR = {Elmasry, Amr and Mehlhorn, Kurt and Schmidt, Jens M.},
JOURNAL = {Algorithmica},
TITLE = {An {O}(n+m) Certifying Triconnnectivity Algorithm for {Hamiltonian} Graphs},
ADDRESS = {New York, NY},
NUMBER = {3},
PUBLISHER = {Springer},
VOLUME = {62},
ISBN = {0178-4617},
DOI = {10.1007/s00453-010-9481-2},
YEAR = {2012},
PAGES = {754--766},
}
@ARTICLE{Elmasry2013,
AUTHOR = {Elmasry, Amr and Mehlhorn, Kurt and Schmidt, Jens M.},
JOURNAL = {Journal of Graph Theory},
TITLE = {Every {DFS} tree of a 3-connected graph contains a contractible edge},
NUMBER = {1},
VOLUME = {72},
DOI = {10.1002/jgt.21635},
YEAR = {2013},
PAGES = {112--121},
}
@ARTICLE{ElmasryMehlhornSchmidt2010,
AUTHOR = {Elmasry, Amr and Mehlhorn, Kurt and Schmidt, Jens M.},
JOURNAL = {Algorithmica},
TITLE = {{An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs}},
ADDRESS = {New York, NY},
PUBLISHER = {Springer},
VOLUME = {Online First},
ISBN = {0178-4617},
DOI = {10.1007/s00453-010-9481-2},
YEAR = {2010},
PAGES = {1--13},
}
@ARTICLE{ElsaesserS2011,
AUTHOR = {Elsaesser, Robert and Sauerwald, Thomas},
JOURNAL = {Theoretical Computer Science},
TITLE = {Tight bounds for the cover time of multiple random walks},
ADDRESS = {Amsterdam},
NUMBER = {24},
PUBLISHER = {Elsevier},
VOLUME = {412},
YEAR = {2011},
PAGES = {2623--2641},
}
@INPROCEEDINGS{emel-gcd-11,
AUTHOR = {Emeliyanenko, Pavel},
EDITOR = {Smari, Waleed W. and McIntire, John P.},
TITLE = {High-performance polynomial {GCD} computations on graphics processors},
BOOKTITLE = {Proceedings of the 2011 International Conference on High Performance Computing \& Simulation (HPCS 2011)},
PADDRESS = {Piscataway, NJ},
ADDRESS = {Istanbul, Turkey},
PUBLISHER = {IEEE},
MONTH = {July},
ISBN = {978-1-61284-381-0},
DOI = {10.1109/HPCSim.2011.5999827},
YEAR = {2011},
PAGES = {215--224},
}
@INPROCEEDINGS{Emel-gtc-10,
AUTHOR = {Emeliyanenko, Pavel},
TITLE = {Accelerating Symbolic Computations on NVIDIA Fermi},
BOOKTITLE = {Poster presentation at GTC'10 (NVIDIA research summit)},
ADDRESS = {San Jose, California},
PUBLISHER = {NVIDIA},
YEAR = {2010},
ABSTRACT = {We present the first implementation of a complete modular resultant algorithm
on the graphics hardware. Our recent developments taking advantage of new
NVidia Fermi GPU architecture and instruction set allowed us to achieve about
150x speed-up over a modular resultant algorithm from Maple 13.},
}
@ARTICLE{emel-res-2012,
AUTHOR = {Emeliyanenko, Pavel},
JOURNAL = {Journal of Parallel and Distributed Computing},
TITLE = {Computing resultants on Graphics Processing Units: {Towards} {GPU}-accelerated computer algebra},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
MONTH = {August},
VOLUME = {In press},
DOI = {10.1016/j.jpdc.2012.07.015},
YEAR = {2012},
PAGES = {1--14},
}
@MASTERSTHESIS{Emel2007,
AUTHOR = {Emeliyanenko, Pavel},
TITLE = {Visualization of Points and Segments of Real Algebraic Plane Curves},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {February},
YEAR = {2007},
ABSTRACT = {This thesis presents an exact and complete approach for visualization of
segments and points of real plane algebraic curves given in implicit form
$f(x,y) = 0$. A curve segment is a distinct curve branch consisting of regular
points
only. Visualization of algebraic curves having self-intersection and isolated
points constitutes the main challenge. Visualization of curve segments involves
even more
difficulties since here we are faced with a problem of discriminating
different curve branches, which can pass arbitrary close to each other.
Our approach is robust and efficient (as shown by our benchmarks), it
combines the advantages both of curve tracking and
space subdivision methods and is able to correctly rasterize segments of
arbitrary-degree algebraic curves using double, multi-precision or exact
rational arithmetic. },
}
@INPROCEEDINGS{emel_gpgpu_09,
AUTHOR = {Emeliyanenko, Pavel},
EDITOR = {Dou, Yong and Gruber, Ralf and Joller, Josef},
TITLE = {Efficient Multiplication of Polynomials on Graphics Hardware},
BOOKTITLE = {Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009},
PADDRESS = {Berlin, Germany},
ADDRESS = {Rapperswil, Switzerland},
PUBLISHER = {Springer},
MONTH = {August},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5737},
ISBN = {978-3-642-03643-9},
DOI = {10.1007/978-3-642-03644-6_11},
YEAR = {2009},
PAGES = {134--149},
ABSTRACT = {We present the algorithm to multiply univariate polynomials with integer
coefficients efficiently using the Number Theoretic transform (NTT) on Graphics
Processing Units (GPU). The same approach can be used to multiply large
integers encoded as polynomials. Our algorithm exploits fused multiply-add
capabilities of the graphics hardware. NTT multiplications are executed in
parallel for a set of distinct primes followed by reconstruction using the
Chinese Remainder theorem (CRT) on the GPU. Our benchmarking experiences show
the NTT multiplication performance up to 77 GMul/s. We compared our approach
with CPU-based implementations of polynomial and large integer multiplication
provided by NTL and GMP libraries.},
}
@INPROCEEDINGS{emel_gpures_2010,
AUTHOR = {Emeliyanenko, Pavel},
EDITOR = {Hsu, Ching-Hsien and Yang, Laurence T. and Park, Jong Hyuk and Yeo, Sang-Soo},
TITLE = {Modular Resultant Algorithm for Graphics Processors},
BOOKTITLE = {Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1},
PADDRESS = {Berlin, Germany},
ADDRESS = {Busan, Korea},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6081},
ISBN = {978-3-642-13118-9},
DOI = {10.1007/978-3-642-13119-6_37},
YEAR = {2010},
PAGES = {427--440},
NOTE = {BEST PAPER AWARD},
}
@MASTERSTHESIS{Emminghaus95,
AUTHOR = {Emminghaus, Frank},
TITLE = {{Effiziente Sortieralgorithmen f{\"u}r den d-dimensionalen Hypercube}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1995},
}
@INPROCEEDINGS{EMR09,
AUTHOR = {Elbassioni, Khaled and Makino, Kazuhisa and Rauf, Imran},
EDITOR = {Ngo, Hung Q.},
TITLE = {On the Readability of Monotone {Boolean} Formulae},
BOOKTITLE = {Computing and Combinatorics :15th Annual International Conference, COCOON 2009},
PADDRESS = {Berlin, Germany},
ADDRESS = {Niagara Falls, New York, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5609},
ISBN = {978-3-642-02881-6},
DOI = {10.1007/978-3-642-02882-3_49},
YEAR = {2009},
PAGES = {496--505},
}
@INPROCEEDINGS{EpJeSS12,
AUTHOR = {Epstein, Leah and Jez, Lukasz and Sgall, Jiri and van Stee, Rob},
EDITOR = {Gupta, Anupam and Jansen, Klaus and Rolim, Jos{\'e} and Servedio, Rocco},
TITLE = {Online Scheduling of Jobs with Fixed Start Times on Related Machines},
BOOKTITLE = {Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012},
PADDRESS = {Berlin},
ADDRESS = {Boston, USA},
PUBLISHER = {Springer},
MONTH = {August},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7408},
ISBN = {978-3-642-32511-3},
DOI = {10.1007/978-3-642-32512-0_12},
YEAR = {2012},
PAGES = {134--145},
ABSTRACT = {We consider online preemptive throughput scheduling of jobs with fixed
starting times on $m$ uniformly related machines, with the goal of
maximizing the profit of the completed jobs. In this problem, jobs are
released over time. Every job has a size and a weight associated with
it. A newly released job must be either assigned to start running
immediately on a machine or otherwise it is dropped. It is also
possible to drop an already scheduled job, but only completed jobs
contribute their weights to the profit of the algorithm.
In the most general setting, no algorithm has bounded competitive
ratio, and we consider a number of standard variants. We give a full
classification of the variants into cases which admit constant
competitive ratio (weighted and unweighted unit jobs, and C-benevolent
instances, which is a wide class of instances containing
proportional-weight jobs), and cases which admit only a linear
competitive ratio (unweighted jobs and D-benevolent instances). In
particular, we give a lower bound of $m$ on the competitive ratio for
scheduling unit weight jobs with varying sizes, which is tight. For
unit size and weight we show that a natural greedy algorithm is
$4/3$-competitive and optimal on $m=2$ machines, while for a large
$m$, its competitive ratio is between $1.56$ and $2$. Furthermore, no
algorithm is better than $1.5$-competitive.},
}
@INPROCEEDINGS{EpKlSt2009,
AUTHOR = {Epstein, Leah and Kleiman, Elena and van Stee, Rob},
EDITOR = {Leonardi, Stefano},
TITLE = {Maximizing the Minimum Load: {The} Cost of Selfishness},
BOOKTITLE = {Internet and Network Economics : 5th International Workshop, WINE 2009},
PADDRESS = {Berlin, Germany},
ADDRESS = {Rome, Italy},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5929},
ISBN = {978-3-642-10840-2},
DOI = {10.1007/978-3-642-10841-9_22},
YEAR = {2009},
PAGES = {232--243},
}
@INPROCEEDINGS{EpLeSt10,
AUTHOR = {Epstein, Leah and Levin, Asaf and van Stee, Rob},
EDITOR = {Abramsky, Samson and Gavoille, Cyril and Kirchner, Claude and Meyer auf der Heide, Friedhelm and Spirakis, Paul G.},
TITLE = {Max-min online allocations with a reordering buffer},
BOOKTITLE = {Automata, Languages and Programming : 37th International Colloquium, ICALP 2010},
ORGANIZATION = {European Association for Theoretical Computer Science (EATCS)},
PADDRESS = {Berlin},
ADDRESS = {Bordeaux, France},
PUBLISHER = {Springer},
MONTH = {July},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6198},
ISBN = {9-783642-14164-5},
DOI = {10.1007/978-3-642-14165-2_29},
YEAR = {2010},
PAGES = {336--347},
ABSTRACT = {We consider a scheduling problem where each job is controlled by a
selfish agent, who is only interested in minimizing its own cost,
which is defined as the total load on the machine that its job is
assigned to. We consider the objective of maximizing the minimum load
(cover) over the machines.
Unlike the regular makespan minimization problem, which was extensively
studied in a game theoretic context, this problem has not been
considered in this setting before.
We study the price of anarchy (\poa) and the price of stability (\pos).
Since these measures are unbounded already for two uniformly
related machines, we focus on identical machines. We show that
the $\pos$ is 1, and we derive tight bounds on the $\poa$ for
$m\leq6$ and nearly tight bounds for general $m$. In particular,
we show that the $\poa$ is at least 1.691 for larger $m$ and at
most 1.7. Hence, surprisingly, the $\poa$ is less than the $\poa$
for the makespan problem, which is 2. To achieve the upper bound
of 1.7, we make an unusual use of weighting functions. Finally,
in contrast we show that the mixed $\poa$ grows exponentially with
$m$ for this problem, although it is only $\Theta(\log m/\log
\log m)$ for the makespan.
In addition we consider a similar setting with a different
objective which is minimizing the maximum ratio between the loads
of any pair of machines in the schedule. We show that under this
objective for general $m$ the $\pos$ is 1, and the $\poa$ is 2.},
}
@ARTICLE{EpLeSt11a,
AUTHOR = {Epstein, Leah and Levin, Asaf and van Stee, Rob},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {Max-min online allocations with a reordering buffer},
ADDRESS = {Philadelphia, PA},
NUMBER = {3},
PUBLISHER = {SIAM},
VOLUME = {25},
ISBN = {0895-4801},
DOI = {10.1137/100794006},
YEAR = {2011},
PAGES = {1230--1250},
ABSTRACT = {We consider online scheduling so as to maximize the minimum load,
using a reordering buffer which can store some of the jobs before
they are assigned irrevocably to machines.
For $m$ identical machines, we show an upper bound of $H_{m-1}+1$ for a buffer
of size $m-1$. A competitive ratio below $H_m$ is not possible with any fixed
buffer size, and it requires a buffer of size $\Omega(m/\log m)$ to get a ratio
of $O(\log m)$. For uniformly related machines, we show that a buffer of size
$m+1$ is sufficient to get a competitive ratio of $m$, which is best possible
for any fixed sized buffer.
We show similar results (but with different constructions) for
the restricted assignment model. We give tight bounds for two machines in all
the three models.
These results sharply contrast to the (previously known) results
which can be achieved without the usage of a reordering buffer,
where it is not possible to get a ratio below a competitive
ratio of $m$ already for identical machines, and it is impossible
to obtain an algorithm of finite competitive ratio in the other
two models, even for $m=2$. Our results strengthen the previous
conclusion that a reordering buffer is a powerful tool and it
allows a significant decrease in the competitive ratio of online
algorithms for scheduling problems. Another interesting aspect of
our results is that our algorithm for identical machines imitates
the behavior of a greedy algorithm on (a specific set of)
related machines, whereas our algorithm for related machines
completely ignores the speeds until all jobs have arrived, and then only uses
the relative order of the speeds.},
}
@ARTICLE{EpLeSt12,
AUTHOR = {Epstein, Leah and Levin, Asaf and van Stee, Rob},
JOURNAL = {Algorithmica},
TITLE = {Approximation Schemes for Packing Splittable Items with Cardinality Constraints},
ADDRESS = {New York},
NUMBER = {1-2},
PUBLISHER = {Springer},
MONTH = {February},
VOLUME = {62},
ISBN = {0178-4617},
DOI = {10.1007/s00453-010-9445-6},
YEAR = {2012},
PAGES = {102--129},
ABSTRACT = {We continue the study of bin packing with splittable items and
cardinality constraints. In this problem, a set of $n$ items must
be packed into as few bins as possible. Items may be split, but
each bin may contain at most $k$ (parts of) items, where $k$ is
some given parameter. Complicating the problem further is the fact
that items may be larger than 1, which is the size of a bin. The
problem is known to be strongly NP-hard for any fixed value of
$k$.
We essentially close this problem by providing an efficient
polynomial-time approximation scheme (EPTAS) for most of its
versions. Namely, we present an efficient polynomial time
approximation scheme for %values of $k$ such that
$k=o(n)$. A
PTAS for $k=\Theta (n)$ does not exist unless P $=$ NP.
Additionally, we present \emph{dual} approximation schemes for
$k=2$ and for constant values of $k$. Thus we show that for any
$\eps>0$, it is possible to pack the items into the optimal
number of bins in polynomial time, if the algorithm may use bins
of size $1+\eps$.},
}
@INPROCEEDINGS{EpLeSt13,
AUTHOR = {Epstein, Leah and Levin, Asaf and van Stee, Rob},
EDITOR = {Sanjeev Khanna},
TITLE = {A unified approach to truthful scheduling on related machines},
BOOKTITLE = {Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013},
PADDRESS = {Philadelphia, USA},
ADDRESS = {New Orleans, USA},
PUBLISHER = {SIAM},
MONTH = {January},
YEAR = {2013},
PAGES = {1243--1252},
ABSTRACT = {We present a unified framework for designing deterministic monotone polynomial
time approximation schemes (PTAS's) for a wide class of scheduling problems on
uniformly related machines. This class includes (among others) minimizing the
makespan, maximizing the minimum load, and minimizing the $\ell_p$ norm of the
machine loads vector. Previously, this kind of result was only known for the
makespan objective. Monotone algorithms have the property that an increase in
the speed of a machine cannot decrease the amount of work assigned to it.
The key idea of our novel method is to show that for goal functions that are
sufficiently well-behaved functions of the machine loads, it is possible to
compute in polynomial time a highly
structured nearly optimal schedule.
An interesting aspect of our approach is that, in contrast to all known
approximation schemes, we avoid rounding any job sizes or speeds throughout. We
can therefore find the \emph{exact} best structured schedule using dynamic
programming. The state space encodes a sufficient amount of information such
that no postprocessing is needed, allowing an elegant and relatively simple
analysis without any special cases. The monotonicity is a consequence of the
fact that we find the {\it best} schedule in a specific collection of schedules.
Monotone approximation schemes have an important role in the emerging area of
algorithmic mechanism design.
In the game-theoretical setting of these scheduling problems there is a social
goal, which is one of the objective functions that we study. Each machine is
controlled by a selfish single-parameter agent, where its private information
is its cost of processing a unit sized job, which is also the inverse of
the speed of its machine. Each agent wishes to maximize its own profit, defined
as the payment it receives from the mechanism minus its cost for processing all
jobs assigned to it, and places a bid which corresponds to its private
information.
For each one of the problems, we show that we can calculate payments that
guarantee truthfulness in an efficient manner. Thus, there exists a dominant
strategy where agents report their true speeds, and we show the existence of a
truthful mechanism which can be implemented in polynomial time, where the
social goal is approximated within a factor of $1+\eps$ for every $\eps>0$.},
}
@ARTICLE{EpsSte11,
AUTHOR = {Epstein, Leah and van Stee, Rob},
JOURNAL = {Theory of Computing Systems},
TITLE = {Improved results for a memory allocation problem},
ADDRESS = {New York, NY},
NUMBER = {1},
PUBLISHER = {Springer},
MONTH = {January},
VOLUME = {48},
ISBN = {1432-4350},
DOI = {10.1007/s00224-009-9226-2},
YEAR = {2011},
PAGES = {79--92},
ABSTRACT = {We consider a memory allocation problem. This problem can be
modeled as a version of bin packing where items may be split, but
each bin may contain at most two (parts of) items. This problem
was recently introduced by Chung et al.~\cite{ChGrVM06}. We give a
simple $\frac 32$-approximation algorithm for this problem which
is in fact an online algorithm. This algorithm also has good
performance for the more general case where each bin may contain
at most $k$ parts of items. We show that this general case is
strongly NP-hard for any $k \geq 3$. Additionally, we design an
efficient approximation algorithm, for which the approximation
ratio can be made arbitrarily close to $\frac 75$.},
}
@ARTICLE{EpsSte12,
AUTHOR = {Epstein, Leah and van Stee, Rob},
JOURNAL = {Information and Computation},
TITLE = {The price of anarchy on uniformly related machines revisited},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
MONTH = {March},
VOLUME = {212},
ISBN = {0890-5401},
DOI = {10.1016/j.ic.2012.01.005},
YEAR = {2012},
PAGES = {37--54},
ABSTRACT = {Recent interest in Nash equilibria led to a study of the {\it
price of anarchy} (poa) and the {\it strong price of anarchy}
(spoa) for scheduling problems. The two
measures express the worst case ratio between the cost of an
equilibrium (a pure Nash equilibrium, and a strong equilibrium,
respectively) to the cost of a social optimum.
The atomic players are the jobs, and the delay of a job is the
completion time of the machine running it, also called the load
of this machine. The social goal is to minimize the maximum delay
of any job, while the selfish goal of each job is to minimize its
own delay, that is, the delay of the machine running it.
We consider scheduling on uniformly related machines. While
previous studies either consider identical speed machines or an
arbitrary number of speeds, focusing on the number of machines as
a parameter, we consider the situation in which the number of
different speeds is small. We reveal a linear dependence between
the number of speeds and the poa. For a set of machines of at
most $p$ speeds, the poa turns out to be exactly $p+1$. The
growth of the poa for large numbers of related machines is
therefore a direct result of the large number of potential speeds.
We further consider a well known structure of processors, where
all machines are of the same speed except for one possibly faster
machine. We investigate the poa as a function of both the speed
ratio between the fastest machine and the number of slow machines.},
}
@ARTICLE{EpsSte2009,
AUTHOR = {Epstein, Leah and van Stee, Rob},
JOURNAL = {Theoretical Computer Science},
TITLE = {Maximizing the minimum load for selfish agents},
ADDRESS = {Amsterdam},
NUMBER = {1},
PUBLISHER = {Elsevier},
VOLUME = {411},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2009.08.032},
YEAR = {2010},
PAGES = {44--57},
}
@ARTICLE{Epstein2006,
AUTHOR = {Epstein, Leah and Kesselman, Alexander},
JOURNAL = {Theoretical Computer Science},
TITLE = {On the remote server problem or more about TCP acknowledgments},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {1-3},
PUBLISHER = {Elsevier},
MONTH = {December},
VOLUME = {369},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2006.09.003},
YEAR = {2006},
PAGES = {285},
ABSTRACT = {We study an on-line problem that is motivated by service calls management in a
remote support center. When a customer calls the remote support center of a
software company, a technician opens a service request and assigns it a
severity rating. This request is then transferred to the appropriate support
engineer (SE) who establishes a connection to the customer's site and uses
remote diagnostic capabilities to resolve the problem. We assume that the SE
can service at most one customer at time and a request service time is
negligible. There is a constant setup cost of creating a new connection to a
customer's site and a specific cost per request for delaying its service that
depends on the severity of the request. The problem is to decide which
customers to serve first so as to minimize the incurred cost. This problem with
just two customers is a natural generalization of the TCP acknowledgment
problem. For the on-line version of the Remote Server Problem (RSP), we present
algorithms for the general case and for a special casef of two customers that
achieve competitive ratios of exactly 4 and 3, respectively. We also show that
no deterministic on-line algorithm can have competitive ratio better than 3.
Then we study generalized versions of our model, these are the case of an
asymmetric setup cost function and the case of multiple SEs. For the off-line
version of the RSP, we derive an optimal algorithm with a polynomial running
time for a constant number of customers. },
}
@INPROCEEDINGS{EpsteinAMMMSS2010,
AUTHOR = {Epstein, Leah and Levin, Asaf and Marchetti-Spaccamela, Alberto and Megow, Nicole and Mestre, Julian and Skutella, Martin and Stougie, Leen},
EDITOR = {Eisenbrand, Friedrich and Shepherd, F. Bruce},
TITLE = {Universal sequencing on a single machine},
BOOKTITLE = {Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010},
PADDRESS = {Berlin},
ADDRESS = {Lausanne, Switzerland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6080},
ISBN = {978-3-642-13035-9},
DOI = {10.1007/978-3-642-13036-6_18},
YEAR = {2010},
PAGES = {230--243},
}
@ARTICLE{EpStTa2009,
AUTHOR = {Epstein, Leah and van Stee, Rob and Tamir, Tami},
JOURNAL = {Theory of Computing Systems},
TITLE = {Paging with request sets},
ADDRESS = {New York},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {44},
ISBN = {1432-4350},
DOI = {10.1007/s00224-007-9029-2},
YEAR = {2009},
PAGES = {67--81},
}
@INPROCEEDINGS{ES-complexity-12,
AUTHOR = {Emeliyanenko, Pavel and Sagraloff, Michael},
EDITOR = {van der Hoeven, Joris and van Hoeij, Mark},
TITLE = {On the Complexity of Solving a Bivariate Polynomial System},
BOOKTITLE = {ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation},
PADDRESS = {New York, NY},
ADDRESS = {Grenoble, France},
PUBLISHER = {ACM},
MONTH = {July},
ISBN = {978-1-4503-1269-1},
DOI = {10.1145/2442829.2442854},
YEAR = {2012},
PAGES = {154--161},
}
@INPROCEEDINGS{ESA:EMR09,
AUTHOR = {Elbassioni, Khaled and Makino, Kazuhisa and Rauf, Imran},
EDITOR = {Fiat, Amos and Sanders, Peter},
TITLE = {Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs},
BOOKTITLE = {Algorithms - ESA 2009 : 17th Annual European Symposium},
PADDRESS = {Berlin, Germany},
ADDRESS = {Copenhagen, Denmark},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5757},
ISBN = {978-3-642-04127-3},
DOI = {10.1007/978-3-642-04128-0_13},
YEAR = {2009},
PAGES = {143--154},
}
@TECHREPORT{esw-sacsee-02,
AUTHOR = {Eigenwillig, Arno and Sch{\"o}mer, Elmar and Wolpert, Nicola},
TITLE = {Sweeping Arrangements of Cubic Segments Exactly and Efficiently},
INSTITUTION = {Effective Computational Geometry for Curves and Surfaces},
TYPE = {Report},
ADDRESS = {Sophia Antipolis},
NUMBER = {ECG-TR-182202-01},
YEAR = {2002},
PAGES = {10},
ABSTRACT = {A method is presented to compute the planar arrangement
induced by segments of algebraic curves of degree three
(or less), using an improved Bentley-Ottmann sweep-line
algorithm. Our method is exact (it provides the
mathematically correct result), complete (it handles
all possible geometric degeneracies), and efficient
(the implementation can handle hundreds of segments).
The range of possible input segments comprises conic
arcs and cubic splines as special cases of particular
practical importance. },
}
@ARTICLE{EulerECJ07,
AUTHOR = {Doerr, Benjamin and Hebbinghaus, Nils and Neumann, Frank},
JOURNAL = {Evolutionary Computation},
TITLE = {Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators},
NUMBER = {4},
PUBLISHER = {MIT Press},
VOLUME = {15},
DOI = {10.1162/evco.2007.15.4.401},
YEAR = {2007},
PAGES = {401--410},
ABSTRACT = {Successful applications of evolutionary algorithms show that certain variation
operators can lead to good solutions much faster than other ones. We examine
this behavior observed in practice from a theoretical point of view and
investigate the effect of an asymmetric mutation operator in evolutionary
algorithms with respect to the runtime behavior. Considering the Eulerian cycle
problem we present runtime bounds for evolutionary algorithms using an
asymmetric operator which are much smaller than the best upper bounds for a
more general one. In our analysis it turns out that a plateau which both
algorithms have to cope with changes its structure in a way that allows the
algorithm to obtain an improvement much faster. In addition, we present a lower
bound for the general case which shows that the asymmetric operator speeds up
computation by at least a linear factor. },
}
@ARTICLE{FanghaenelGHV2013,
AUTHOR = {Fangh{\"a}nel, Alexander and Geulen, Sascha and Hoefer, Martin and V{\"o}cking, Berthold},
JOURNAL = {Journal of Scheduling},
TITLE = {Online Capacity Maximization in Wireless Networks},
NUMBER = {1},
VOLUME = {16},
YEAR = {2013},
PAGES = {81--91},
}
@INPROCEEDINGS{Farzan2010,
AUTHOR = {Farzan, Arash and Gagie, Travis and Navarro, Gonzalo},
EDITOR = {Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo},
TITLE = {Entropy-Bounded Representation of Point Grids},
BOOKTITLE = {Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II},
PADDRESS = {Berlin},
ADDRESS = {Jeju Island, Korea},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6507},
ISBN = {978-3-642-17513-8},
DOI = {10.1007/978-3-642-17514-5_28},
YEAR = {2010},
PAGES = {327--338},
ABSTRACT = {We give the first fully compressed representation of a set of $m$ points on an
$n \times n$ grid, taking $H+o(H)$ bits of space, where $H=\lg {n^2 \choose m}$
is the entropy of the set. This representation supports range counting, range
reporting, and point selection queries, with a performance that is comparable
to that of uncompressed structures and that improves upon the only previous
compressed structure. Operating within entropy-bounded space opens a new line
of research on an otherwise well-studied area, and is becoming extremely
important for handling large datasets.},
}
@INPROCEEDINGS{Farzan2010a,
AUTHOR = {Blelloch, Guy E. and Farzan, Arash},
EDITOR = {Amir, Amihood and Parida, Laxmi},
TITLE = {Succinct Representations of Separable Graphs},
BOOKTITLE = {Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010},
PADDRESS = {Berlin},
ADDRESS = {New York, NY},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6129},
ISBN = {978-3-642-13508-8},
DOI = {10.1007/978-3-642-13509-5_13},
YEAR = {2010},
PAGES = {138--150},
ABSTRACT = {We consider the problem of highly space-efficient representation of separable
graphs while supporting queries in constant time in the RAM with logarithmic
word size. In particular, we show constant-time support for adjacency, degree
and neighborhood queries. For any monotone class of separable graphs, the
storage requirement of the representation is optimal to within lower order
terms. Separable graphs are those that admit a $O(n^c)$-separator theorem where
$c < 1$. Many graphs that arise in practice are indeed separable. For instance,
graphs with a bounded genus are separable. In particular, planar graphs (genus
$0$) are separable and our scheme gives the first succinct representation of
planar graphs with a storage requirement that matches the information-theory
minimum to within lower order terms with constant time support for the queries.
We, furthers, show that we can also modify the scheme to succinctly represent
the combinatorial planar embedding of planar graphs (and hence encode planar
maps).},
}
@ARTICLE{FarzanDynamic2011,
AUTHOR = {Farzan, Arash and Munro, J. Ian},
JOURNAL = {Theoretical Computer Science},
TITLE = {Succinct representation of dynamic trees},
ADDRESS = {Amsterdam},
NUMBER = {24},
PUBLISHER = {Elsevier},
VOLUME = {412},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2010.10.030},
YEAR = {2011},
PAGES = {2668--2678},
NOTE = {accepted for Theoretical Computer Science},
}
@ARTICLE{Fatourou2000,
AUTHOR = {Fatourou, Panagiota and Spirakis, Paul G.},
JOURNAL = {Theory of Computing Systems},
TITLE = {Efficient Scheduling of Strict Multithreaded Computations},
ADDRESS = {New York, USA},
NUMBER = {3},
PUBLISHER = {Springer},
MONTH = {May},
VOLUME = {33},
ISBN = {1432-4350},
YEAR = {2000},
PAGES = {173--232},
ABSTRACT = {In this paper we study the problem of
efficiently scheduling a wide class of multithreaded
computations, called {\em strict};
that is, computations in which all dependencies
from a thread go to the thread's
ancestors in the computation tree.
Strict multithreaded computations allow the
limited use of synchronization primitives.
We present the {\em first} fully distributed
scheduling algorithm which applies to {\em any}
strict multithreaded computation. The algorithm
is asynchronous, on-line and follows the
{\em work-stealing} paradigm. We prove that
our algorithm is efficient not only in terms of
its memory requirements and its execution time, but also in terms of its
communication complexity.
Our analysis applies to both shared and distributed memory
machines.
More specifically,
the expected execution time of our algorithm
is $O(T_1/P + hT_{\infty})$, where
$T_1$ is the minimum serial execution
time, $T_{\infty}$ is the minimum execution
time with an infinite number of processors,
$P$ is the number of processors
and $h$ is the maximum ``distance'' in the
{\em computation tree} between
any two threads that need to communicate.
Furthermore, the total space required during the execution
is $O(S_1 P)$, where $S_1$ is the space required
by a serial computer to execute the
computation, while the expected communication cost
incurred by our algorithm is $O(PhT_{\infty} (1+n_d) S_{max})$,
where $n_d$ is the maximum number of dependencies
entering any thread and $S_{max}$ is the largest
amount of storage needed for the execution of
any specific thread of the computation.
Our communication complexity bound is {\em the first}
nontrivial bound ever proved for the
model of strict parallel programming.
},
}
@INPROCEEDINGS{FBVI2011,
AUTHOR = {Friedrich, Tobias and Bringmann, Karl and Voss, Thomas and Igel, Christian},
EDITOR = {Beyer, Hans- Georg and Langdon, William},
TITLE = {The Logarithmic Hypervolume Indicator},
BOOKTITLE = {FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI},
PADDRESS = {New York, NY},
ADDRESS = {Schwarzenberg, Austria},
PUBLISHER = {ACM},
ISBN = {978-1-4503-0633-1},
DOI = {10.1145/1967654.1967662},
YEAR = {2011},
PAGES = {81--92},
}
@MASTERSTHESIS{Feld98,
AUTHOR = {Feld, Thomas},
TITLE = {{Analyse und Implementierung von Algorithmen zum Minimum Cost Circulation Problem}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {November},
YEAR = {1998},
}
@MASTERSTHESIS{FeldmannBachelor2012,
AUTHOR = {Feldmann, Matthias},
TITLE = {Stochastic optimization with fitness proportional ant systems
},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Bachelor thesis},
YEAR = {2012},
}
@ARTICLE{Fellows2012,
AUTHOR = {Fellows, Michael R. and Hermelin, Danny and Rosamond, Fraces A.},
JOURNAL = {Algorithmica},
TITLE = {Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications},
ADDRESS = {New York, NY},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {64},
ISBN = {0178-4617},
DOI = {10.1007/s00453-011-9545-y},
YEAR = {2012},
PAGES = {3--18},
}
@ARTICLE{FellowsFertinHermelinVialette2011,
AUTHOR = {Fellows, Michael R. and Fertin, Guillaume and Hermelin, Danny and Vialette, Stephane},
JOURNAL = {Journal of Computer and System Sciences},
TITLE = {Upper and lower bounds for finding connected motifs in vertex-colored graphs},
ADDRESS = {Amsterdam},
NUMBER = {4},
PUBLISHER = {Elsevier},
VOLUME = {77},
ISBN = {0022-0000},
DOI = {10.1016/j.jcss.2010.07.003},
YEAR = {2011},
PAGES = {799--811},
}
@INPROCEEDINGS{FellowsFriedrichHermelinEtAL2011,
AUTHOR = {Fellows, Michael R. and Friedrich, Tobias and Hermelin, Danny and Narodytska, Nina and Rosamond, Frances A.},
EDITOR = {Walsh, Toby},
TITLE = {Constraint Satisfaction Problems: {Convexity} Makes All Different Constraints Tractable},
BOOKTITLE = {Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011)},
PADDRESS = {Menlo Park, CA},
ADDRESS = {Barcelona, Spain},
PUBLISHER = {AAAI Press},
ISBN = {978-1-57735-512-0},
DOI = {10.5591/978-1-57735-516-8/IJCAI11-095},
YEAR = {2011},
PAGES = {522--527},
}
@ARTICLE{FellowsHatrmanHermelinEtAl2011,
AUTHOR = {Fellows, Michael R. and Hartman, Tzvika and Hermelin, Danny and Landau, Gad M. and Rosamond, Frances A. and Rozenberg, Liat},
JOURNAL = {IEEE/ACM Transactions on Computational Biology and Bioinformatics},
TITLE = {Haplotype Inference Constrained by Plausible Haplotype Data},
ADDRESS = {Piscataway, NJ},
NUMBER = {6},
PUBLISHER = {IEEE},
VOLUME = {8},
ISBN = {1545-5963},
DOI = {10.1109/TCBB.2010.72},
YEAR = {2011},
PAGES = {1692--1699},
}
@INPROCEEDINGS{FernauFominLokshtanovMnichPhilipSaurabh2010,
AUTHOR = {Fernau, Henning and Fomin, Fedor V. and Lokshtanov, Daniel and Mnich, Matthias and Philip, Geevarghese and Saurabh, Saket},
EDITOR = {Iliopoulos, Costas S. and F. Smyth, William},
TITLE = {Ranking and Drawing in Subexponential Time},
BOOKTITLE = {Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers},
TYPE = {Revised Selected Papers},
PADDRESS = {Berlin},
ADDRESS = {London, United Kingdom},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6460},
ISBN = {978-3-642-19221-0},
DOI = {10.1007/978-3-642-19222-7_34},
YEAR = {2011},
ABSTRACT = {In this paper we obtain parameterized subexponential-time
algorithms for \kaggLG{} (\kagg{}) --- a problem in social
choice theory --- and for \oscmLG{} (\oscm{}) -- a problem in
graph drawing (see the introduction for definitions). These
algorithms run in time $\Oh^{*}(2^{\Oh(\sqrt{k}\log k)})$, where
$k$ is the parameter, and significantly improve the previous
best algorithms with running times $\Oh^{*}(1.403^k)$ and
$\Oh^{*}(1.4656^k)$, respectively. We also study natural
``above-guarantee'' versions of these problems and show them to
be fixed parameter tractable. In fact, we show that the
above-guarantee versions of these problems are equivalent to a
weighted variant of {\sc $p$-Directed Feedback Arc Set}. Our
results for the above-guarantee version of \kagg{} reveal an
interesting contrast. We show that when the number of ``votes''
in the input to \kagg{} is {\em odd} the above guarantee version
can still be solved in time $O^{*}(2^{\Oh(\sqrt{k}\log k)})$,
while if it is {\em even} then the problem cannot have a
subexponential time algorithm unless
the exponential time hypothesis fails (equivalently, unless FPT$=$M[$1$]). },
}
@INPROCEEDINGS{FernauFominPhilipSaurabh2010,
AUTHOR = {Fernau, Henning and Fomin, Fedor V. and Philip, Geevarghese and Saurabh, Saket},
EDITOR = {Thai, My T. and Sahni, Sartaj},
TITLE = {The Curse of Connectivity: $t$-Total Vertex (Edge) Cover},
BOOKTITLE = {Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings},
PADDRESS = {Berlin},
ADDRESS = {Nha Trang, Vietnam},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6196},
ISBN = {978-3-642-14030-3},
DOI = {10.1007/978-3-642-14031-0},
YEAR = {2010},
PAGES = {34--43},
ABSTRACT = {We investigate the effect of certain natural connectivity constraints
on the parameterized complexity of two fundamental graph covering
problems, namely Vertex Cover and Edge Cover. Specifically, we impose the
additional requirement that each connected component of a solution
have at least $t$ vertices (resp. edges from the solution), and call
the problem $t$-Total Vertex Cover (resp. $t$-Total Edge Cover). We show that
\begin{itemize}
\item both problems remain fixed-parameter tractable with these restrictions,
with running times of the form $\Oh^{*}\left(c^{k}\right)$ for some
constant $c>0$ in each case;
\item for every $t\ge2$,$t$-Total Vertex Cover has no polynomial kernel unless
the
Polynomial Hierarchy collapses to the third level;
\item for every $t\ge2$, $t$-Total Edge Cover has a linear vertex kernel of
size $\frac{t+1}{t}k$.
\end{itemize}},
}
@ARTICLE{FerraginaGrossSIAMJCOMPUT1998,
AUTHOR = {Ferragina, Paolo and Gross, Roberto},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Optimal On-Line Search and Sublinear Time Update in String Matching},
NUMBER = {3},
PUBLISHER = {SIAM},
MONTH = {June},
VOLUME = {27},
ISBN = {0097-5397},
YEAR = {1998},
PAGES = {713--736},
}
@INPROCEEDINGS{fffmo-eropmoffsi-14,
AUTHOR = {Fekete, S{\'a}ndor P. and Fiethe, Bj{\"o}rn and Friedrichs, Stephan and Michalik, Harald and Orlis, Christos},
TITLE = {Efficient reconfiguration of processing modules on FPGAs for space instruments},
BOOKTITLE = {Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on},
PADDRESS = {New York, USA},
ADDRESS = {Leicester, UK},
PUBLISHER = {IEEE},
MONTH = {July},
SERIES = {Adaptive Hardware and Systems},
DOI = {10.1109/AHS.2014.6880153},
YEAR = {2014},
PAGES = {15--22},
ABSTRACT = {We consider optimization techniques for a problem that requires a valid
scheduling and allocation of tasks on Field Programmable Gate Arrays (FPGAs). A
concrete application on a scientific space instrument arises in the context of
ESA's Solar Orbiter mission; making use of dynamic reconfiguration allows a
good and flexible use of resources, but the resulting packing and scheduling
problems in the presence of inhomogeneous allocation resources are quite
challenging. In our scenario, modules are described by three parameters: their
resource demands for different types of resources, their priority, and their
clock frequency. These are to be allocated on an FPGA that provides a number of
different resources that are available at specific locations. We first present
an Integer Program that partitions the tasks in such a way that all constraints
can be met and the reconfiguration overhead is minimized, and then give methods
for allocating the processing modules of the partitioned tasks on the FPGA. We
evaluate our methods on a real application of the Solar Orbiter PHI instrument.
The results obtained indicate computational efficiency and a remarkable
solution quality.},
}
@INPROCEEDINGS{ffks-ffagp-13,
AUTHOR = {Fekete, S{\'a}ndor P. and Friedrichs, Stephan and Kr{\"o}ller, Alexander and Schmidt, Christiane},
EDITOR = {Du, Ding-Zhu and Zhang, Guochuan},
TITLE = {Facets for Art Gallery Problems},
BOOKTITLE = {Computing and Combinatorics},
PADDRESS = {Berlin},
ADDRESS = {Hangzhou, China},
PUBLISHER = {Springer},
MONTH = {June},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7936},
ISBN = {978-3-642-38767-8},
DOI = {10.1007/978-3-642-38768-5_20},
YEAR = {2013},
PAGES = {208--220},
ABSTRACT = {We demonstrate how polyhedral methods of mathematical programming can be
developed for and applied to computing optimal solutions for large instances of
a classical geometric optimization problem with an uncountable number of
constraints and variables.
The Art Gallery Problem (AGP) asks for placing a minimum number of stationary
guards in a polygonal region $P$, such that all points in $P$ are guarded. The
AGP is NP-hard, even to approximate. Due to the infinite number of points to be
guarded as well as possible guard positions, applying mathematical programming
methods for computing provably optimal solutions is far from straightforward.
In this paper, we use an iterative primal-dual relaxation approach for solving
AGP instances to optimality. At each stage, a pair of LP relaxations for a
finite candidate subset of primal covering and dual packing constraints and
variables is considered; these correspond to possible guard positions and
points that are to be guarded.
Of particular interest are additional cutting planes for eliminating fractional
solutions. We identify two classes of facets, based on Edge Cover and Set Cover
(SC) inequalities. Solving the separation problem for the latter is
NP-complete, but exploiting the underlying geometric structure of the AGP, we
show that large subclasses of fractional SC solutions cannot occur for the AGP.
This allows us to separate the relevant subset of facets in polynomial time.
Finally, we characterize all facets for finite AGP relaxations with
coefficients in ${0, 1, 2}$. We demonstrate the practical usefulness of our
approach with improved solution quality and speed for a wide array of large
benchmark instances.},
}
@INPROCEEDINGS{FH08,
AUTHOR = {Friedrich, Tobias and Hebbinghaus, Nils},
EDITOR = {Hong, Seok-Hee and Nagamochi, Hiroshi and Fukunaga, Takuro},
TITLE = {Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.},
BOOKTITLE = {Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008)},
PADDRESS = {New York, USA},
ADDRESS = {Gold Coast, Australia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5369},
ISBN = {978-3-540-92181-3},
YEAR = {2008},
PAGES = {693--704},
}
@ARTICLE{FHHNW10,
AUTHOR = {Friedrich, Tobias and He, Jun and Hebbinghaus, Nils and Neumann, Frank and Witt, Carsten},
JOURNAL = {Evolutionary Computation},
TITLE = {Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models},
ADDRESS = {Cambridge, Mass.},
NUMBER = {4},
PUBLISHER = {MIT Press},
MONTH = {November},
VOLUME = {18},
ISBN = {1063-6560},
DOI = {10.1162/EVCO_a_00003},
YEAR = {2010},
PAGES = {617 -- 633},
}
@ARTICLE{FHN10,
AUTHOR = {Friedrich, Tobias and Hebbinhaus, Nils and Neumann, Frank},
JOURNAL = {Theoretical Computer Science},
TITLE = {Plateaus Can Be Harder in Multi-Objective Optimization},
ADDRESS = {Amsterdam},
NUMBER = {6},
PUBLISHER = {Elsevier},
MONTH = {February},
VOLUME = {411},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2009.06.020},
YEAR = {2010},
PAGES = {854--864},
}
@INPROCEEDINGS{FHP2009,
AUTHOR = {Fountoulakis, Nikolaos and Huber, Anna and Panagiotou, Konstantinos},
EDITOR = {Keidar, Idit},
TITLE = {Brief Announcement: {The} Speed of Broadcasting in Random Networks - Density Does Not Matter},
BOOKTITLE = {Distributed Computing : 23rd International Symposium, DISC 2009},
PADDRESS = {Berlin, Germany},
ADDRESS = {Elche/Elx, Spain},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5805},
ISBN = {978-3-642-04354-3},
DOI = {10.1007/978-3-642-04355-0_53},
YEAR = {2009},
PAGES = {529--530},
NOTE = {Full version available from arXiv:0904.4851},
ABSTRACT = {Broadcasting algorithms are of fundamental importance for distributed systems
engineering. In this paper we revisit the classical and well-studied
\emph{push} protocol for message broadcasting. Assuming that initially only one
node has some piece of information, at each stage every one of the informed
nodes chooses randomly and independently one of its neighbors and passes the
message to it.
The performance of the push protocol on a fully connected network, where each
node is joined by a link to every other node, is very well understood. In
particular, Frieze and Grimmett proved that with probability $1-o(1)$ the push
protocol completes the broadcasting of the message within $(1\pm \eps) (\log_2
n + \ln n)$ stages, where $n$ is the number of nodes of the network. However,
there are no tight bounds for the broadcast time on networks that are
significantly sparser than the complete graph.
In this work we consider random networks on $n$ nodes, where every edge is
present with probability $p$, independently of every other edge. We show that
if $p\geq {\alpha (n) \ln n \over n}$, where $\alpha(n)$ is any function that
tends to infinity as $n$ grows, then the push protocol broadcasts the message
within $(1\pm \eps) (\log_2 n + \ln n)$ stages with probability $1-o(1)$. In
other words, in almost every network of density $d$ such that $d \ge \alpha(n)
\ln n$, the push protocol broadcasts a message as fast as in a fully connected
network. This is quite surprising in the sense that the time needed remains
essentially \emph{unaffected} by the fact that most of the links are missing. },
}
@INPROCEEDINGS{FHPInfocom10,
AUTHOR = {Fountoulakis, Nikolaos and Huber, Anna and Panagiotou, Konstantinos},
TITLE = {Reliable broadcasting in random networks and the effect of density},
BOOKTITLE = {2010 Proceedings IEEE INFOCOM},
PADDRESS = {San Diego, USA},
ADDRESS = {San Diego, USA},
PUBLISHER = {IEEE},
ISBN = {978-1-4244-5838-7},
DOI = {10.1109/INFCOM.2010.5462084},
YEAR = {2010},
PAGES = {2552--2560},
}
@MASTERSTHESIS{Fialko97,
AUTHOR = {Fialko, Sergej},
TITLE = {{Das planare Augmentierungsproblem}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1997},
}
@MASTERSTHESIS{FinkDipl01,
AUTHOR = {Fink, Christian},
TITLE = {{Oberfl{\"a}chenrekonstruktion von planaren Konturen}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {October},
YEAR = {2001},
}
@PHDTHESIS{Finkler-Diss97,
AUTHOR = {Finkler, Ulrich},
TITLE = {Design of Efficient and Correct Algorithms: Theoretical Results and Runtime Prediction of Implementations in Practice},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
YEAR = {1997},
}
@INPROCEEDINGS{Finkler-et-al96,
AUTHOR = {Calinescu, Gruia and Fernandes, Cristina G. and Finkler, Ulrich and Karloff, Howard},
TITLE = {A better approximation algorithm for finding planar subgraphs},
BOOKTITLE = {7th ACM-SIAM Symposium on Discrete Algorithms (SODA96)},
PADDRESS = {New York},
ADDRESS = {Georgia, USA},
PUBLISHER = {acm},
YEAR = {1996},
PAGES = {16--25},
}
@ARTICLE{Finkler-et-al97,
AUTHOR = {Calinescu, Gruia and Fernandes, Cristina G. and Finkler, Ulrich and Karloff, Howard},
JOURNAL = {Journal of Algorithms},
TITLE = {A Better Approximation Algorithm for Finding Planar Subgraphs},
NUMBER = {2},
VOLUME = {27},
ISBN = {0196-6774},
YEAR = {1998},
PAGES = {269--302},
}
@INPROCEEDINGS{Finkler-Mehlhorn97,
AUTHOR = {Finkler, Ulrich and Mehlhorn, Kurt},
TITLE = {Runtime Prediction of Real Programs on Real Machines},
BOOKTITLE = {Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97)},
PADDRESS = {New York, USA},
ADDRESS = {New Orleans, USA},
PUBLISHER = {ACM / SIAM},
YEAR = {1997},
PAGES = {380--389},
}
@INPROCEEDINGS{FK2006,
AUTHOR = {Funke, Stefan and Klein, Christian},
EDITOR = {Amenta, Nina and Cheong, Otfried},
TITLE = {Hole Detection or: "How Much Geometry Hides in Connectivity?"},
BOOKTITLE = {Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06},
PADDRESS = {New York, USA},
ADDRESS = {Sedona, Arizona, USA},
PUBLISHER = {ACM},
ISBN = {1-59593-340-9},
YEAR = {2006},
PAGES = {377--385},
ABSTRACT = {Wireless sensor networks typically consist of small, very simple network nodes
without any positioning device like GPS.
After an initialization phase, the nodes know with whom they can talk directly,
but have no idea about their relative geographic locations.
We examine how much geometry information is nevertheless hidden in the
communication graph of the network:
Assuming that the connectivity is determined by the well-known unit-disk graph
model, we prove that using an extremely simple linear-time algorithm
one can identify nodes on the boundaries of holes of the network. That is,
there is enough geometry information hidden in the connectivity structure
to identify topological features -- in our example the holes in the network.
While the theoretical analysis turns out to be quite conservative, an actual
implementation shows that the algorithm works well under less stringent
conditions.},
}
@ARTICLE{FKesselmanMeyerS2006,
AUTHOR = {Funke, Stefan and Kesselman, Alexander and Meyer, Ulrich and Segal, Michael},
JOURNAL = {ACM Transactions on Sensor Networks},
TITLE = {A Simple Improved Distributed Algorithm for Minimum {CDS} in Unit Disk Graphs},
ADDRESS = {New York, USA},
NUMBER = {3},
PUBLISHER = {ACM},
VOLUME = {2},
YEAR = {2006},
PAGES = {444--453},
ABSTRACT = {Several routing schemes in ad hoc networks first establish a virtual backbone
and then route messages via backbone nodes. One common way of constructing such
a backbone is based on the construction of a connected dominating set (CDS). In
this article we present a very simple distributed algorithm for computing a
small CDS. Our algorithm has an approximation factor of at most 6.91, improving
upon the previous best-known approximation factor of 8 due to Wan et al.
[2002]. The improvement relies on a refined analysis of the relationship
between the size of a maximal independent set and a minimum CDS in a unit disk
graph. This subresult also implies improved approximation factors for many
existing algorithm. },
}
@ARTICLE{FKKLS07,
AUTHOR = {Funke, Stefan and Kesselman, Alexander and Kuhn, Fabian and Lotker, Zvi and Segal, Michael},
JOURNAL = {Wireless Networks},
TITLE = {Improved approximation algorithms for connected sensor cover},
ADDRESS = {Berlin, Germany},
NUMBER = {2},
PUBLISHER = {Springer},
MONTH = {April},
VOLUME = {13},
ISBN = {1022-0038},
DOI = {10.1007/s11276-006-3724-9},
YEAR = {2007},
PAGES = {153--164},
}
@INPROCEEDINGS{FKKMS02,
AUTHOR = {Fotakis, Dimitris and Kontogiannis, Spyros and Koutsoupias, Elias and Mavronicolas, Marios and Spirakis, Paul G.},
EDITOR = {Widmayer, Peter and Triguero, Francisco and Morales, Rafael and Hennessy, Matthew and Eidenbenz, Stephan and Conejo, Ricardo},
TITLE = {The Structure and Complexity of Nash Equilibria for a Selfish Routing Game},
BOOKTITLE = {Automata, Languages and Programming : 29th International Colloquium, ICALP 2002},
PADDRESS = {Berlin, Germany},
ADDRESS = {M{\'a}laga, Spain},
PUBLISHER = {Springer},
MONTH = {July},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2380},
ISBN = {3-540-43864-5},
YEAR = {2002},
PAGES = {123--134},
ABSTRACT = {In this work, we study the combinatorial structure and the computational
complexity of Nash equilibria for a certain game that models {\em selfish
routing}
over a network consisting of $m$ parallel {\em links}.
We assume a collection of {\em $n$ users,} each employing a {\em mixed
strategy,}
which is a probability distribution over links, to control the routing
of its own assigned {\em traffic}. In a {\em Nash equilibrium,}
each user selfishly routes its traffic on those links
that minimize its {\em expected latency cost,}
given the network congestion caused by the other users.
The {\em social cost} of a Nash equilibrium
is the expectation, over all random choices of the users,
of the maximum, over all links,
{\em latency} through a link.
We embark on a systematic study of several algorithmic problems
related to the computation of Nash equilibria for the selfish
routing game we consider. In a nutshell, these problems relate to
deciding the existence of a Nash equilibrium, constructing a Nash
equilibrium with given support characteristics, constructing the
{\em worst} Nash equilibrium (the one with {\em maximum} social
cost), constructing the {\em best} Nash equilibrium (the one with
{\em minimum} social cost), or computing the social cost of a
(given) Nash equilibrium. Our work provides a comprehensive
collection of efficient algorithms, hardness results (both as
$\NP$-hardness and $\#\Pc$-completeness results), and structural
results for these algorithmic problems. Our results span and
contrast a wide range of assumptions on the syntax of the Nash
equilibria and on the parameters of the system.},
}
@INPROCEEDINGS{FKLS2004,
AUTHOR = {Funke, Stefan and Kesselman, Alexander and Lotker, Zvi and Segal, Michael},
EDITOR = {Nikolaidis, Ioanis and Barbeau, Michel and Kranakis, Evangelos},
TITLE = {Improved Approximation Algorithms for Connected Sensor Cover},
BOOKTITLE = {Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004},
PADDRESS = {Berlin, Germany},
ADDRESS = {Vancouver, Canada},
PUBLISHER = {Springer},
MONTH = {July},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3158},
ISBN = {3-540-22543-9},
YEAR = {2004},
PAGES = {56--69},
ABSTRACT = {Wireless sensor networks have recently posed many new system building
challenges. One of the main problems is energy conservation since most of the
sensors are devices with limited battery life and it is infeasible to replenish
energy via replacing batteries. An effective approach for energy conservation
is scheduling sleep intervals for some sensors, while the remaining sensors
stay active providing continuous service. In this paper we consider the problem
of selecting a set of active sensors of minimum cardinality that maintains
sensing coverage and network connectivity. We study different variations of
this problem. The main contribution of this paper is a thorough investigation
of algorithms for covering an area with sensors that have fixed locations.},
}
@ARTICLE{FKMcEJC2010,
AUTHOR = {Fountoulakis, Nikolaos and Kang, Ross and McDiarmid, Colin},
JOURNAL = {The Electronic Journal of Combinatorics},
TITLE = {The t-stability number of a random graph},
ADDRESS = {Philadelphia, PA},
NUMBER = {1},
PUBLISHER = {University of Pennsylvania},
VOLUME = {17},
YEAR = {2010},
PAGES = {R59,1--R59,29},
}
@INPROCEEDINGS{FKMS2005,
AUTHOR = {Funke, Stefan and Klein, Christian and Mehlhorn, Kurt and Schmitt, Susanne},
TITLE = {Controlled Perturbation for Delaunay Triangulations},
BOOKTITLE = {Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05)},
PADDRESS = {Philadelphia, USA},
ADDRESS = {Vancouver, Canada},
PUBLISHER = {SIAM},
ISBN = {0-89871-585-7},
YEAR = {2005},
PAGES = {1047--1056},
ABSTRACT = {Most geometric algorithms are idealistic in the sense that they are designed
for the Real-RAM model of computation and for inputs in general
position. Real inputs may be degenerate and floating point arithmetic is
only an approximation of real arithmetic.
Perturbation replaces an input by a nearby input which is (hopefully)
in general position and on which the algorithm can be run with floating point
arithmetic. Controlled perturbation as proposed by Halperin et al. calls for
more: control over the amount of perturbation needed for a given precision of
the floating point system. Or conversely, a control over the precision needed
for a given amount of perturbation. Halperin et al.~gave controlled
perturbation schemes for arrangements of polyhedral surfaces, spheres, and
circles. We extend their work and point out that controlled perturbation is a
general scheme for converting idealistic algorithms into algorithms which can
be executed with floating point arithmetic. We also show how to use controlled
perturbation in the context of randomized geometric algorithms without
deteriorating the running time. Finally, we give concrete schemes for planar
Delaunay triangulations and convex hulls and Delaunay triangulations in
arbitrary dimensions. We analyze the relation between the
perturbation amount and the precision of the floating point system. We also
report about experiments with a planar Delaunay diagram algorithm. },
}
@INPROCEEDINGS{FKMS2005b,
AUTHOR = {Funke, Stefan and Kesselman, Alexander and Meyer, Ulrich and Segal, Michael},
TITLE = {A Simple Improved Distributed Algorithm for Minimum {CDS} in Unit Disk Graphs},
BOOKTITLE = {1st IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005)},
PADDRESS = {Los Alamitos, USA},
ADDRESS = {Montreal, Canada},
PUBLISHER = {IEEE},
VOLUME = {2},
ISBN = {0-7803-9181-0},
YEAR = {2005},
PAGES = {220--223},
}
@INPROCEEDINGS{fkw-eevsopcowsn-14,
AUTHOR = {Friedrichs, Stephan and Kulau, Ulf and Wolf, Lars},
TITLE = {Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes},
BOOKTITLE = {Communications Workshops (ICC), 2014 IEEE International Conference on},
PADDRESS = {New York, USA},
ADDRESS = {Sydney, Australia},
PUBLISHER = {IEEE},
MONTH = {June},
DOI = {10.1109/ICCW.2014.6881308},
YEAR = {2014},
PAGES = {860--865},
ABSTRACT = {Much effort has been put into optimizing the energy-efficiency of wireless
sensor nodes, but existing work exclusively focuses on the transceiver and the
processing unit. Nevertheless, the peripheral energy consumption may dominate
that of the entire node. We introduce the concept of a dynamically scalable
peripheral voltage supply: Even for peripheral devices, a lower voltage level
leads to a lower energy consumption. Each peripheral requires a different
minimum operating voltage, but switching the voltage level consumes energy as
well. We combine theory and practice to present an algorithm weighing off the
benefits of a downscaled voltage level against the switching overhead, i. e.,
for calculating an optimal peripheral voltage schedule. Our approach is capable
of self-parameterization and has been implemented and tested on a prototype,
saving up to 47% of peripheral energy as compared to existing solutions.},
}
@INPROCEEDINGS{FL2007,
AUTHOR = {Funke, Stefan and Laue, S{\"o}ren},
EDITOR = {Thomas, Wolfgang and Weil, Pascal},
TITLE = {Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets},
BOOKTITLE = {STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science},
PADDRESS = {Berlin, Germany},
ADDRESS = {Aachen, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4393},
ISBN = {3-540-70917-6},
DOI = {10.1007/978-3-540-70918-3_24},
YEAR = {2007},
PAGES = {272--283},
ABSTRACT = {We consider the problem of assigning powers to nodes of a wireless network in
the plane such that a message from a source node s reaches all other nodes
within a bounded number k of transmissions and the total amount of assigned
energy is minimized. By showing the existence of a coreset of size we are able
to (1 + $\varepsilon$)-approximate the bounded-hop broadcast problem in time linear in n
which is a drastic improvement upon the previously best known algorithm.
While actual network deployments often are in a planar setting, the experienced
metric for several reasons is typically not exactly of the Euclidean type, but
in some sense ’close’. Our algorithm (and others) also work for non-Euclidean
metrics provided they exhibit a certain similarity to the Euclidean metric
which is known in the literature as bounded doubling dimension. We give a novel
characterization of such metrics also pointing out other applications such as
space-efficient routing schemes.
This work was supported by the Max Planck Center for Visual Computing and
Communication (MPC-VCC) funded by the German Federal Ministry of Education and
Research (FKZ 01IMC01).},
}
@INPROCEEDINGS{Flash-WEA-2008,
AUTHOR = {Ajwani, Deepak and Malinger, Itay and Meyer, Ulrich and Toledo, Sivan},
EDITOR = {McGeoch, Catherine},
TITLE = {Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design},
BOOKTITLE = {Proc. 7th Intern. Workshop on Experimental Algorithms (WEA)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Provincetown, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5038},
YEAR = {2008},
PAGES = {208--219},
}
@INPROCEEDINGS{Fleischer-FUN-1999,
AUTHOR = {Fleischer, Rudolf},
EDITOR = {Lodi, Elena and Pagli, Linda and Santoro, Nicola},
TITLE = {FUN with implementing algorithms},
BOOKTITLE = {Proceedings of the International Conference on FUN with Algorithms (FUN-98)},
PADDRESS = {Waterloo, Canada},
ADDRESS = {Elba, Italy},
PUBLISHER = {Carleton Scientific},
SERIES = {Proceedings in Informatics},
VOLUME = {4},
ISBN = {1-894145-03-8},
YEAR = {1999},
PAGES = {88--98},
ABSTRACT = {In this paper, I would like to argue -- based on my personal
programming experience -- that implementing algorithms is FUN.
Moreover, it can lead to a better understanding of the problem
at hand, it can help to avoid embarrassing mistakes, and
animated algorithms can be used in class as a tool for teaching.},
}
@ARTICLE{Fleischer-Jung-Mehlhorn95,
AUTHOR = {Fleischer, Rudolf and Jung, Hermann and Mehlhorn, Kurt},
JOURNAL = {Information and Computation},
TITLE = {A communication-randomness tradeoff for two-processor systems},
NUMBER = {2},
PUBLISHER = {Academic Press},
VOLUME = {116},
ISBN = {0890-5401},
YEAR = {1995},
PAGES = {155--161},
ABSTRACT = {We present a tight tradeoff between the expected communication complexity
$\bar{C}$ (for a two-processor system) and the number $R$ of random bits used
by any Las Vegas protocol for the list-nondisjointness function of two lists
of $n$ numbers of $n$ bits each. This function evaluates to $1$ if and only if
the two lists correspond in at least one position. We show a
$\log(n^2/\bar{C})$ lower bound on the number of random bits used by any Las
Vegas protocol, $\Omega(n)\le\bar{C}\le O(n^2)$. We also show that expected
communication complexity $\bar{C}$, $\Omega(n\log n) \le\bar{C}\le O(n^2)$,
can be achieved using no more than $\log(n^2/\bar{C}) +
\lceil\log(2+\log(n^2/\bar{C}))\rceil+6$ random bits.",
xxx-references = "STOC::AhoUY83,
FOCS::CanettiG90,
STOC::Furer87,
STOC::HalstenbergR88,
STOC::KrizancPU88,
FOCS::LovaszS88,
STOC::MehlhornS82,
STOC::PapadimitriouS82,
FOCS::Yao77,
STOC::Yao79,
FOCS::Yao83",
references = "\cite{STOC::AhoUY1983}
\cite{FOCS::CanettiG1990}
\cite{STOC::Furer1987}
\cite{STOC::HalstenbergR1988}
\cite{STOC::KrizancPU1988}
\cite{FOCS::LovaszS1988}
\cite{STOC::MehlhornS1982}
\cite{STOC::PapadimitriouS1982}
\cite{FOCS::Yao1977}
\cite{STOC::Yao1979}
\cite{FOCS::Yao1983}},
}
@INPROCEEDINGS{Fleischer1998bahncard,
AUTHOR = {Fleischer, Rudolf},
EDITOR = {Hsu, Wen-Lian and Kao, Ming-Yang},
TITLE = {On the Bahncard problem},
BOOKTITLE = {Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Taipei, Taiwan, R.o.C.},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1449},
ISBN = {0302-9743},
YEAR = {1998},
PAGES = {65--74},
ABSTRACT = {In this paper, we generalize the Ski-Rental Problem to the Bahncard PRoblem
which is an online problem of practical relevance for all travelers.
The Bahncard is a railway pass of the Deutsche Bundesbahn
(the German railway company) which entitles its holder to a 50% price
reduction on nearly all train tickets.
It costs 240 DM, and it is valid for 12 months.
Similar bus or railway passes can be found in many other countries.},
}
@PHDTHESIS{Fleischer1999,
AUTHOR = {Fleischer, Rudolf},
TITLE = {{Effiziente und Online-Algorithmen}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Habilitation thesis},
YEAR = {1999},
}
@ARTICLE{Fleischer96,
AUTHOR = {Fleischer, Rudolf},
JOURNAL = {International Journal of Foundations of Computer Science},
TITLE = {A simple balanced search tree with {$O(1)$} worst-case update time},
ADDRESS = {Singapore},
NUMBER = {2},
PUBLISHER = {World Scientific},
VOLUME = {7},
ISBN = {0129-0541},
YEAR = {1996},
PAGES = {137--149},
}
@INPROCEEDINGS{FleischerSkutella2003,
AUTHOR = {Fleischer, Lisa and Skutella, Martin},
TITLE = {Minimum Cost Flows Over Time without Intermediate Storage},
BOOKTITLE = {Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03)},
ORGANIZATION = {Society of Industrial and Applied Mathematics},
PADDRESS = {New York, USA},
ADDRESS = {Baltimore, USA},
PUBLISHER = {ACM},
MONTH = {January},
ISBN = {0-89871-538-5},
YEAR = {2003},
PAGES = {66--75},
ABSTRACT = {Flows over time (also called dynamic flows)
generalize standard network flows by introducing
an element of time. They naturally model problems where
travel and transmission are not instantaneous. Solving these problems
raises issues that do not arise in standard network flows.
One issue is the question of storage of flow at intermediate nodes.
In most applications
(such as, e.g., traffic routing, evacuation planning,
telecommunications etc.), intermediate storage is limited, undesired,
or prohibited.
The minimum cost flow over time problem is NP-hard. In this paper we
1)~prove that the minimum cost flow over time never requires storage;
2)~provide the first approximation scheme for minimum cost flows over
time that does not require storage; 3)~provide the first approximation
scheme for minimum cost flows over time that meets hard cost
constraints, while approximating only makespan.
Our approach is based on a condensed variant of time-expanded
networks. It also yields fast approximation schemes with simple
solutions for the quickest multicommodity flow problem.
Finally, using completely different techniques, we describe a very
simple capacity scaling FPAS for the minimum cost flow over time
problem when costs are proportional to transit times.
The algorithm builds upon our observation about the
structure of optimal solutions to this problem:
they are universally quickest flows. Again, the FPAS
does not use intermediate node storage.
In contrast to the preceding algorithms that use a
time-expanded network, this FPAS runs directly on the original
network.},
}
@ARTICLE{Fleischer_dectrees_1999,
AUTHOR = {Fleischer, Rudolf},
JOURNAL = {Information and computation},
TITLE = {Decision trees: old and new results},
PUBLISHER = {Academic Press},
VOLUME = {152},
YEAR = {1999},
PAGES = {44--61},
ABSTRACT = {In this paper, we prove two general lower bounds for algebraic
decision trees which test membership in a set $S\subseteq R^n$ which is
defined by linear inequalities.
Let $rank(S)$ be
the maximal dimension of a linear subspace contained in the closure of
$S$ {in the Euclidean topology}.
First we show that any decision tree for $S$ which uses
products of linear functions (we call such functions
{\em mlf-functions}) must have depth at least $n-rank(S)$.
This solves an open question raised by A.C.~Yao and
can be used to show
that mlf-functions are not really more powerful
than simple comparisons between the input variables when
computing the largest $k$ out of $n$ elements.
Yao proved this result in the special case when
products of at most two linear functions are allowed.
Out proof also shows that any decision tree for this problem
must have exponential size.
Using the same methods, we can give an
alternative proof of Rabin's Theorem, namely
that the depth of any decision tree for $S$ using arbitrary
analytic functions is at least $n-rank(S)$.},
}
@INPROCEEDINGS{FLN2007,
AUTHOR = {Funke, Stefan and Laue, S{\"o}ren and Naujoks, Rouven},
EDITOR = {Aspnes, James and Scheideler, Christian and Arora, Anish and Madden, Samuel},
TITLE = {Minimum Energy Broadcast with Few Senders},
BOOKTITLE = {Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007},
PADDRESS = {Berlin, Germany},
ADDRESS = {Santa Fe, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4549},
ISBN = {3-540-73089-3},
YEAR = {2007},
PAGES = {404--416},
}
@INPROCEEDINGS{FLNL2008,
AUTHOR = {Funke, Stefan and Laue, S{\"o}ren and Naujoks, Rouven and Lotker, Zvi},
EDITOR = {Sotiris E. Nikoletseas and Bogdan S. Chlebus and David B. Johnson and Bhaskar Krishnamachari},
TITLE = {Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours},
BOOKTITLE = {Distributed Computing in Sensor Systems, 4th {IEEE} International Conference, {DCOSS} 2008},
PADDRESS = {Berlin, Germany},
ADDRESS = {Santorini Island, Greece},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5067},
ISBN = {3-540-73089-3},
YEAR = {2008},
PAGES = {282--295},
}
@INPROCEEDINGS{fm-lalokfgc-00,
AUTHOR = {Funke, Stefan and Mehlhorn, Kurt},
TITLE = {LOOK - a Lazy Object-Oriented Kernel for Geometric Computation},
BOOKTITLE = {Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00)},
ORGANIZATION = {Association of Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Hong Kong, China},
PUBLISHER = {ACM},
MONTH = {June},
ISBN = {1-58113-224-7},
YEAR = {2000},
PAGES = {156--165},
}
@ARTICLE{fm-look-2002,
AUTHOR = {Funke, Stefan and Mehlhorn, Kurt},
JOURNAL = {Computational Geometry - Theory and Applications},
TITLE = {{LOOK} - {A} Lazy Object-Oriented Kernel for Geometric Computation},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {1-3},
PUBLISHER = {Elsevier},
MONTH = {April},
VOLUME = {22},
YEAR = {2002},
PAGES = {99--118},
}
@INPROCEEDINGS{FM2007,
AUTHOR = {Funke, Stefan and Milosavljevic, Nikola},
TITLE = {Network Sketching or: "How much Geometry hides in Connectivity? - Part II"},
BOOKTITLE = {Proceedings of the eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-07)},
PADDRESS = {Philadelphia, USA},
ADDRESS = {New Orleans, USA},
PUBLISHER = {SIAM},
MONTH = {January},
ISBN = {978-0-898716-24-5},
YEAR = {2007},
PAGES = {958--967},
}
@INPROCEEDINGS{FM2007b,
AUTHOR = {Funke, Stefan and Milosavljevic, Nikola},
TITLE = {Guaranteed-delivery Geographic Routing under Uncertain Node Locations},
BOOKTITLE = {IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications},
PADDRESS = {Piscataway, NJ, USA},
ADDRESS = {Anchorage, USA},
PUBLISHER = {IEEE},
ISBN = {1-424-41046-0},
YEAR = {2007},
PAGES = {1244--1252},
}
@INPROCEEDINGS{FM97,
AUTHOR = {Fialko, Sergej and Mutzel, Petra},
TITLE = {A new approximation algorithm for the planar augmentation problem},
BOOKTITLE = {Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98)},
ORGANIZATION = {ACM},
TYPE = {Extended Abstract},
PADDRESS = {New York, USA},
ADDRESS = {San Francisco, USA},
PUBLISHER = {ACM Press / SIAM},
YEAR = {1998},
PAGES = {260--269},
}
@INPROCEEDINGS{FMMW2006,
AUTHOR = {Funke, Stefan and Malamatos, Theocharis and Matijevic, Domagoj and Wolpert, Nicola},
EDITOR = {Rappaport, David},
TITLE = {(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram},
BOOKTITLE = {18th Canadian Conference on Computational Geometry},
TYPE = {Extended Abstract},
PADDRESS = {Kingston, Ontario, K7L 3N6, Canada},
ADDRESS = {Kingston, Canada},
PUBLISHER = {School of Computing, Queen's University},
YEAR = {2006},
PAGES = {23--26},
ABSTRACT = {For a given point set in Euclidean space we consider the problem of finding
(approximate) nearest neighbors of a query point but restricting only to
points that lie within a fixed cone with apex at the query point.
Apart from being a rather natural question to ask,
solutions to this problem have applications in surface reconstruction and
dimension detection.
We investigate the structure of the Voronoi diagram induced by this notion of
proximity and present
approximate and exact data structures for answering cone-restricted nearest
neighbor queries. In particular
we develop an approximate Voronoi diagram of size $O((n/\epsilon^d)\log
(1/\epsilon))$ that can be used
to answer cone-restricted nearest neighbor queries in $O(\log (n/\epsilon))$
time.},
}
@INPROCEEDINGS{FMN1999,
AUTHOR = {Funke, Stefan and Mehlhorn, Kurt and N{\"a}her, Stefan},
TITLE = {Structural Filtering: a Paradigm for Efficient and Exact Geometric Programs},
BOOKTITLE = {Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99)},
PADDRESS = {Vancouver, Canada},
ADDRESS = {Vancouver, Canada},
PUBLISHER = {University of British Columbia},
MONTH = {August},
YEAR = {1999},
PAGES = {39--42},
}
@INPROCEEDINGS{FMR2004,
AUTHOR = {Funke, Stefan and Malamatos, Theocharis and Ray, Rahul},
TITLE = {Finding Planar Regions in a Terrain: In Practice and with a Guarantee},
BOOKTITLE = {Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04)},
ORGANIZATION = {Association of Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {New York, USA},
PUBLISHER = {ACM},
YEAR = {2004},
PAGES = {96--105},
}
@INPROCEEDINGS{FMR2004b,
AUTHOR = {Funke, Stefan and Malamatos, Theocharis and Ray, Rahul},
TITLE = {Finding Planar Regions in a Terrain},
BOOKTITLE = {20th European Workshop on Computational Geometry (EWCG)},
ORGANIZATION = {Seville University},
PADDRESS = {Sevilla, Spain},
ADDRESS = {Sevilla, Spain},
PUBLISHER = {Seville University},
YEAR = {2004},
PAGES = {1--4},
}
@INPROCEEDINGS{FMS2003,
AUTHOR = {Funke, Stefan and Matijevic, Domagoj and Sanders, Peter},
EDITOR = {Di Battista, Giuseppe and Zwick, Uri},
TITLE = {Approximating Energy Efficient Paths in Wireless Multi-hop Networks},
BOOKTITLE = {Algorithms - ESA 2003: 11th Annual European Symposium},
PADDRESS = {Berlin, Germany},
ADDRESS = {Budapest, Hungary},
PUBLISHER = {Springer},
MONTH = {September},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2832},
ISBN = {3-540-20064-9},
YEAR = {2003},
PAGES = {230--241},
ABSTRACT = {Given the positions of $n$ sites in a radio network
we consider the problem of finding routes between any pair of sites
that minimize energy consumption and do not use more than some
constant number $k$ of hops. Known exact algorithms for this problem
required $\Omega(n \log n)$ per query pair $(p,q)$. In this paper we
relax the exactness requirement and only require approximate
$(1+\epsilon)$ solutions which allows us to derive schemes which
guarantee constant query time using linear space and
$O(n\log n)$ preprocessing time. The dependence on $\epsilon$ is
polynomial in $1/\epsilon$.
One tool used might be of independent interest:
For any pair of points $(p,q)\in P\subseteq\mathbb{Z}^2$
report in constant time the cluster pair $(A,B)$ representing $(p,q)$
in a well-separated pair decomposition of $P$.},
}
@INPROCEEDINGS{FMS2004,
AUTHOR = {Funke, Stefan and Matijevic, Domagoj and Sanders, Peter},
TITLE = {Constant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks},
BOOKTITLE = {First International Workshop on Algorithms for Wireless and Mobile Networks},
PADDRESS = {Bologna, Italy},
ADDRESS = {Boston, USA},
PUBLISHER = {University of Bologna},
YEAR = {2004},
PAGES = {97--111},
ABSTRACT = {We investigate algorithms for computing
energy efficient paths in ad-hoc radio networks.
We demonstrate how advanced data structures from computational
geometry can be employed to preprocess the position of
radio stations in such a way that approximately
energy optimal paths can be retrieved in constant time, i.e.,
independent of the network size.
We put particular emphasis on actual implementations which
demonstrate that large constant factors hidden in the theoretical
analysis are not a big problem in practice.},
}
@INPROCEEDINGS{FNPS02,
AUTHOR = {Fotakis, Dimitris and Nikoletseas, Sotiris and Papadopoulou, Vicky and Spirakis, Paul G.},
EDITOR = {Kucera, Ludek},
TITLE = {Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies},
BOOKTITLE = {Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002},
PADDRESS = {Berlin, Germany},
ADDRESS = {Ceský Krumlov, Czech Republic},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2573},
ISBN = {3-540-00331-2},
YEAR = {2002},
PAGES = {223--234},
ABSTRACT = {The Frequency Assignment Problem (FAP) in radio networks is the problem of
assigning frequencies to transmitters exploiting frequency reuse while keeping
signal interference to acceptable levels.
The FAP is usually modelled by variations of the graph coloring problem. The
Radiocoloring (RC) of a graph $G(V, E)$ is an assignment function $\Phi : V
\mapsto N$ such that $|\Phi(u) - \Phi(v)| \geq 2$, when $u, v$ are neighbors in
$G$, and $|\Phi(u) - \Phi(v)| \geq 1$ when the distance of $u, v$ in $G$ is
two. The range of frequencies used is called {\em span}. Here, we consider the
optimization version of the Radiocoloring
Problem (RCP) of finding a radiocoloring assignment of minimum span, called
{\em min span RCP}.
In this paper, we deal with a variation of RCP: that of satisfying frequency
assignment requests with some {\em periodic} behavior. In this case, the
interference graph is an (infinite) periodic graph. Infinite periodic graphs
model finite networks that accept periodic (in time, e.g. daily) requests for
frequency assignment. Alternatively, they may model very
large networks produced by the repetition of a small graph.
A {\em periodic graph $G$} is defined by an infinite two-way sequence of
repetitions of the same finite graph $G_i(V_i, E_i)$. The edge set of $G$ is
derived by connecting the vertices of each iteration $G_i$ to some of the
vertices of the next iteration $G_{i+1}$, the same for all $G_i$. The
model of periodic graphs considered here is similar to that of periodic graphs
in Orlin [13], Marathe et al [10]. We focus on planar periodic graphs, because
in many cases real networks are planar and also because of their independent
mathematical interest. We give two basic results:
- We prove that the min span RCP is PSPACE-complete for periodic planar graphs.
- We provide an $O(n(\Delta(G_i) + \sigma))$ time algorithm, (where $|V_i| =
n$, $\Delta(G_i)$ is the maximum degree of the graph $G_i$ and $\sigma$ is the
number of edges connecting each $G_i$ to $G_{i+1})$, which obtains a
radiocoloring of a periodic planar graph G that {\em approximates the minimum
span within a ratio which tends to 2 as $\Delta(G_i) + \sigma$ tends to
infinity}.},
}
@INPROCEEDINGS{FOCS::DietzfelbingerKMHRT1988,
AUTHOR = {Dietzfelbinger, Martin and Karlin, Anna and Mehlhorn, Kurt and Meyer auf der Heide, Friedhelm and Rohnert, Hans and Tarjan, Robert E.},
TITLE = {Dynamic Perfect Hashing: Upper and Lower Bounds},
BOOKTITLE = {29th Annual Symposium on Foundations of Computer Science (FOCS 1988)},
PADDRESS = {Washington, USA},
ADDRESS = {White Plains, New York, USA},
PUBLISHER = {IEEE},
ISBN = {0-8186-0877-3},
YEAR = {1988},
PAGES = {524--531},
}
@INPROCEEDINGS{FOCS::MehlhornNR1989,
AUTHOR = {Mehlhorn, Kurt and N{\"a}her, Stefan and Rauch, Monika},
TITLE = {On the Complexity of a Game Related to the Dictionary Problem},
BOOKTITLE = {30th Annual Symposium on Foundations of Computer Science (FOCS 1989)},
PADDRESS = {Los Alamitos, USA},
ADDRESS = {Research Triangle Park, NC, USA},
PUBLISHER = {IEEE},
ISBN = {0-8186-1982-1},
YEAR = {1989},
PAGES = {546--548},
}
@ARTICLE{FollertSchoemerSellenSmidThiel97,
AUTHOR = {Follert, Frank and Sch{\"o}mer, Elmar and Sellen, J{\"u}rgen and Smid, Michiel and Thiel, Christian},
JOURNAL = {International Journal of Computational Geometry and Applications},
TITLE = {Computing the largest empty anchored cylinder, and related problems},
NUMBER = {6},
VOLUME = {7},
YEAR = {1997},
PAGES = {563--580},
}
@INPROCEEDINGS{FominLokshtanovMisraPhilipSaurabh2011,
AUTHOR = {Fomin, Fedor V. and Lokshtanov, Daniel and Misra, Neeldhara and Philip, Geevarghese and Saurabh, Saket},
EDITOR = {Schwentick, Thomas and D{\"u}rr, Christoph},
TITLE = {Hitting forbidden minors: Approximation and Kernelization},
BOOKTITLE = {28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany},
PADDRESS = {Dagstuhl, Germany},
ADDRESS = {Dortmund, Germany},
PUBLISHER = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
SERIES = {Leibniz International Proceedings in Informatics},
VOLUME = {9},
ISBN = {978-3-939897-25-5},
DOI = {10.4230/LIPIcs.STACS.2011.189},
YEAR = {2011},
PAGES = {189--200},
ABSTRACT = {We study a general class of problems called $p$-\textsc{$\mathcal{F}$-Deletion}
problems. In an $p$-\textsc{$\mathcal{F}$-Deletion} problem, we
are asked whether a subset of at most $k$ vertices can be deleted from a
graph
$G$ such that the resulting graph does not contain as a minor any graph from
the
family ${\cal F}$ of forbidden minors. We obtain a number of algorithmic
results
on the $p$-\textsc{$\mathcal{F}$-Deletion} problem when $\mathcal{F}$ contains
a planar graph. We give
\begin{itemize}
\item a linear vertex kernel on graphs excluding $t$-claw $K_{1,t}$, the star
with $t$ leves, as an induced subgraph, where $t$ is a fixed integer.
\item an approximation algorithm achieving an approximation ratio of
$O(\log^{3/2} OPT)$, where $OPT$ is the size of an optimal solution on general
undirected graphs.
\end{itemize}
Finally, we obtain polynomial kernels for the case when $\cal F$ only
contains graph $\theta_c$
as a minor for a fixed integer $c$. The graph $\theta_c$
consists of two
vertices connected by $c$ parallel edges. Even though this may appear to be a
very restricted class
of problems it already encompasses well-studied problems such as {\sc Vertex
Cover}, {\sc Feedback Vertex Set} and \textsc{Diamond Hitting Set}
.
The generic kernelization algorithm is based on a non-trivial application of
protrusion techniques, previously used only for problems on
topological graph classes.},
}
@INPROCEEDINGS{FominPhilipVillanger2011,
AUTHOR = {Fomin, Fedor V. and Philip, Geevarghese and Villanger, Yngve},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
TITLE = {Minimum Fill-in of Sparse Graphs: Kernelization and Approximation},
BOOKTITLE = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India},
PADDRESS = {Dagstuhl, Germany},
ADDRESS = {Mumbai, India},
PUBLISHER = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
SERIES = {Leibniz International Proceedings in Informatics},
VOLUME = {13},
ISBN = {978-3-939897-34-7},
DOI = {10.4230/LIPIcs.FSTTCS.2011.164},
YEAR = {2011},
PAGES = {164--175},
ABSTRACT = {The \textsc{Minimum Fill-in} problem is to decide if a graph can
be triangulated by adding at most $k$ edges. The problem has
important applications in numerical algebra, in particular in
sparse matrix computations. We develop kernelization algorithms
for the problem on several classes of sparse graphs. We obtain
linear kernels on planar graphs, and kernels of size
$O(k^{3/2})$ in graphs excluding some fixed graph as a minor
and in graphs of bounded degeneracy. As a byproduct of our
results, we obtain approximation algorithms with approximation
ratios $O(\log{k})$ on planar graphs and
$O(\sqrt{k}\log{k})$ on $H$-minor-free graphs. These results
significantly improve the previously known kernelization and
approximation results for \textsc{Minimum Fill-in} on sparse
graphs.},
}
@INPROCEEDINGS{FormalVerificationofCertifyingComputations,
AUTHOR = {Alkassar, Eyad and B{\"o}hme, Sascha and Mehlhorn, Kurt and Rizkallah, Christine},
EDITOR = {Gopalakrishnan, Ganesh and Qadeer, Shaz},
TITLE = {Verification of Certifying Computations},
BOOKTITLE = {Computer Aided Verification : 23rd International Conference, CAV 2011},
PADDRESS = {Heidelberg},
ADDRESS = {Snowbird, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6806},
ISBN = {978-3-642-22109-5},
DOI = {10.1007/978-3-642-22110-1_7},
YEAR = {2011},
PAGES = {67--82},
ABSTRACT = {Formal verification of complex algorithms is challenging. Verifying their
implementations goes beyond the state of the art of
current verification tools and proving their correctness usually
involves non-trivial mathematical theorems.
Certifying algorithms compute in addition to each output a
witness certifying that the output is correct. A checker for such a witness
is usually much simpler than the original algorithm -- yet it is all the
user has to trust. Verification of checkers is feasible with current tools and
leads to computations that can be completely trusted.
In this paper we develop a framework to seamlessly verify certifying
computations. The automatic verifier VCC is used for checking code
correctness, and the interactive theorem prover Isabelle/HOL targets
high-level mathematical properties of algorithms. We demonstrate the
effectiveness of our approach by applying it to the verification of
the algorithmic library LEDA.},
}
@INPROCEEDINGS{FOSW08,
AUTHOR = {Friedrich, Tobias and Oliveto, Pietro and Sudholt, Dirk and Witt, Carsten},
EDITOR = {Keijzer, Maarten},
TITLE = {Theoretical Analysis of Diversity Mechanisms for Global Exploration},
BOOKTITLE = {Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008)},
PADDRESS = {New York, USA},
ADDRESS = {Atlanta, USA},
PUBLISHER = {ACM},
ISBN = {978-1-60558-130-9},
DOI = {http://doi.acm.org/10.1145/1389095.1389276},
YEAR = {2008},
PAGES = {945--952},
}
@INPROCEEDINGS{Fot03,
AUTHOR = {Fotakis, Dimitris},
EDITOR = {Baeten, Jos C.M. and Lenstra, Jan Karel and Parrow, Joachim and Woeginger, Gerhard J.},
TITLE = {On the Competitive Ratio for Online Facility Location},
BOOKTITLE = {Automata, languages and programming : 30th International Colloquium, ICALP 2003},
ORGANIZATION = {European Association of Theoretical Computer Science (EATCS)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Eindhoven, The Netherlands},
PUBLISHER = {Springer},
MONTH = {June},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2719},
ISBN = {3-540-40493-7},
YEAR = {2003},
PAGES = {637--652},
ABSTRACT = {We consider the problem of Online Facility Location, where demands arrive
online and must be irrevocably assigned to an open facility upon arrival. The
objective is to minimize the sum of facility and assignment costs. We prove
that the competitive ratio for Online Facility Location is $\Theta(\frac{\log
n}{\log\log n})$. On the negative side, we show that no randomized algorithm
can achieve a competitive ratio better than $O(\frac{\log n}{\log\log n})$
against an oblivious adversary even if the demands lie on a line segment. On
the positive side, we present a deterministic algorithm achieving a competitive
ratio of $O(\frac{\log n}{\log\log n})$. The analysis is based on a
hierarchical decomposition of the optimal facility locations such that each
component either is relatively well-separated or has a relatively large
diameter, and a potential function argument which distinguishes between the two
kinds of components.},
}
@INPROCEEDINGS{Fotakis2004a,
AUTHOR = {Fotakis, Dimitris},
EDITOR = {Albers, Susanne and Radzik, Tomasz},
TITLE = {Incremental Algorithms for Facility Location and k-Median},
BOOKTITLE = {Algorithms – ESA 2004: 12th Annual European Symposium},
PADDRESS = {Berlin, Germany},
ADDRESS = {Bergen, Norway},
PUBLISHER = {Springer},
MONTH = {September},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3221},
ISBN = {3-540-23025-4},
YEAR = {2004},
PAGES = {347--358},
ABSTRACT = {In the incremental versions of Facility Location and k-Median, the demand
points arrive one at a time and the algorithm must maintain a good solution by
either adding each new demand to an existing cluster or placing it in a new
singleton cluster. The algorithm can also merge some of the existing clusters
at any point in time. We present the first incremental algorithm for Facility
Location with uniform facility costs which achieves a constant performance
ratio and the first incremental algorithm for k-Median which achieves a
constant performance ratio using O(k) medians.},
}
@ARTICLE{Fountoulakis2007,
AUTHOR = {Fountoulakis, Nikolaos and Reed, Bruce},
JOURNAL = {Probability Theory and Related Fields},
TITLE = {Faster Mixing and Small Bottlenecks},
PUBLISHER = {Springer},
VOLUME = {137},
YEAR = {2007},
PAGES = {475--486},
}
@ARTICLE{Fountoulakis2008,
AUTHOR = {Fountoulakis, Nikolaos and Reed, Bruce},
JOURNAL = {Random Structures and Algorithms},
TITLE = {The evolution of the mixing rate of a simple random walk on the giant component of a random graph},
PUBLISHER = {Wiley Interscience},
VOLUME = {33},
YEAR = {2008},
PAGES = {68--86},
}
@ARTICLE{Fountoulakis2008a,
AUTHOR = {Cooley, Oliver and Fountoulakis, Nikolaos and K{\"u}hn, Daniela and Osthus, Deryk},
JOURNAL = {Journal of Combinatorial Theory B},
TITLE = {3-Uniform hypergraphs of bounded degree have linear Ramsey numbers},
PUBLISHER = {Elsevier},
VOLUME = {98},
YEAR = {2008},
PAGES = {484--505},
}
@ARTICLE{Fountoulakis2008b,
AUTHOR = {Fountoulakis, Nikolaos and K{\"u}hn, Daniela and Osthus, Deryk},
JOURNAL = {Random Structures and Algorithms},
TITLE = {The order of the largest complete minor in a random graph},
PUBLISHER = {Wiley Interscience},
VOLUME = {33},
YEAR = {2008},
PAGES = {127--141},
}
@ARTICLE{Fountoulakis2009,
AUTHOR = {Cooley, Oliver and Fountoulakis, Nikolaos and K{\"u}hn, Daniela and Osthus, Deryk},
JOURNAL = {Combinatorica},
TITLE = {Embeddings and Ramsey numbers of sparse k-uniform hypergraphs},
ADDRESS = {New York, NY},
NUMBER = {3},
PUBLISHER = {Springer},
VOLUME = {29},
ISBN = {0209-9683},
DOI = {10.1007/s00493-009-2356-y},
YEAR = {2009},
PAGES = {263--297},
NOTE = {to appear},
}
@ARTICLE{Fountoulakis2009a,
AUTHOR = {Fountoulakis, Nikolaos},
JOURNAL = {Internet Mathematics},
TITLE = {Percolation on sparse random graphs with given degree sequence},
ADDRESS = {Natick, MA},
NUMBER = {4},
PUBLISHER = {A. K. Peters},
VOLUME = {4},
ISBN = {1542-7951},
YEAR = {2007},
PAGES = {329--356},
NOTE = {to appear},
}
@ARTICLE{Fountoulakis2009b,
AUTHOR = {Fountoulakis, Nikolaos and K{\"u}hn, Daniela and Osthus, Deryk},
JOURNAL = {Random Structures and Algorithms},
TITLE = {Minors in random regular graphs},
PUBLISHER = {Wiley Interscience},
VOLUME = {35},
YEAR = {2009},
PAGES = {444--463},
}
@ARTICLE{Fountoulakis2011,
AUTHOR = {Fountoulakis, Nikolaos and Panagiotou, Konstantinos},
JOURNAL = {Combinatorics, Probability \& Computing},
TITLE = {3-Connected Cores In Random Planar Graphs},
ADDRESS = {Cambridge, Mass.},
NUMBER = {3},
PUBLISHER = {Cambridge University Press},
VOLUME = {20},
ISBN = {0963-5483},
DOI = {10.1017/S0963548310000532},
YEAR = {2011},
PAGES = {381--412},
}
@INPROCEEDINGS{FountoulakisHuberPanagiotouBrief2010,
AUTHOR = {Fountoulakis, Nikolaos and Huber, Anna and Panagiotou, Konstantinos},
TITLE = {The Speed of Broadcasting in Random Networks: Density Does Not Matter},
BOOKTITLE = {23rd International Symposium on Distributed Computing (DISC '09)},
PADDRESS = {New York, USA},
ADDRESS = {Elche/Elx, Spain},
PUBLISHER = {Springer},
YEAR = {2009},
PAGES = {529--530},
}
@INPROCEEDINGS{FountoulakisKhoslaPanagiotou2010,
AUTHOR = {Fountoulakis, Nikolaos and Khosla, Megha and Panagiotou, Konstantinos},
EDITOR = {Randall, Dana},
TITLE = {The Multiple-orientability Thresholds for Random Hypergraphs},
BOOKTITLE = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011)},
PADDRESS = {Philadelphia, Pa.},
ADDRESS = {San Francisco, CA},
PUBLISHER = {SIAM},
MONTH = {January},
YEAR = {2011},
PAGES = {1222--1236},
}
@INPROCEEDINGS{FountoulakisPS12,
AUTHOR = {Fountoulakis, Nikolaos and Panagiotou, Konstantinos and Sauerwald, Thomas},
EDITOR = {Rabani, Yuval},
TITLE = {Ultra-fast rumor spreading in social networks},
BOOKTITLE = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12)},
PADDRESS = {Philadelphia, PA},
ADDRESS = {Kyoto, Japan},
PUBLISHER = {SIAM},
ISBN = {978-1-611972-11-5},
YEAR = {2012},
PAGES = {1642--1660},
}
@PHDTHESIS{FouzDiss2012,
AUTHOR = {Fouz, Mahmoud},
TITLE = {Randomized Rumor Spreading in Social Networks \& Complete Graphs},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
ADDRESS = {Saarbr{\"u}cken},
PUBLISHER = {Universit{\"a}t des Saarlandes},
MONTH = {July},
YEAR = {2012},
PAGES = {II,114p.},
}
@ARTICLE{FP12RSA,
AUTHOR = {Fountoulakis, Nikolaos and Panagiotou, Konstantinos},
JOURNAL = {Random Structures and Algorithms},
TITLE = {Tight Load Thresholds for Cuckoo Hashing},
ADDRESS = {Chichester},
NUMBER = {3},
PUBLISHER = {Wiley},
VOLUME = {41},
DOI = {10.1002/rsa.20426},
YEAR = {2012},
PAGES = {306--333},
}
@INPROCEEDINGS{FPIcalp2010,
AUTHOR = {Fountoulakis, Nikolaos and Panagiotou, Konstantinos},
EDITOR = {Abramsky, Samson and Gavoille, Cyril and Kirchner, Claude and Meyer auf der Heide, Friedhelm and Spirakis, Paul G.},
TITLE = {Orientability of random hypergraphs and the power of multiple choices},
BOOKTITLE = {Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1},
PADDRESS = {Berlin},
ADDRESS = {Bordeaux, France},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6198},
ISBN = {978-3-642-14164-5},
DOI = {10.1007/978-3-642-14165-2_30},
YEAR = {2010},
PAGES = {348--359},
}
@INPROCEEDINGS{FPRandom10,
AUTHOR = {Fountoulakis, Nikolaos and Panagiotou, Konstantinos},
EDITOR = {Serna, Maria and Shaltiel, Ronen and Jansen, Klaus and Rolim, Jos{\'e}},
TITLE = {Rumor spreading on random regular graphs and expanders},
BOOKTITLE = {Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010},
PADDRESS = {Berlin},
ADDRESS = {Barcelona, Spain},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6302},
ISBN = {978-3-642-15368-6},
DOI = {10.1007/978-3-642-15369-3_42},
YEAR = {2010},
PAGES = {560--573},
}
@INPROCEEDINGS{FPSS03,
AUTHOR = {Fotakis, Dimitris and Pagh, Rasmus and Sanders, Peter and Spirakis, Paul G.},
EDITOR = {Alt, Helmut and Habib, Michel},
TITLE = {Space Efficient Hash Tables with Worst Case Constant Access Time},
BOOKTITLE = {Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Berlin, Germany},
PUBLISHER = {Springer},
MONTH = {February},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2607},
ISBN = {3-540-00623-0},
YEAR = {2003},
PAGES = {271--282},
ABSTRACT = {We generalize Cuckoo Hashing \cite{PagRod01} to \emph{$d$-ary Cuckoo Hashing}
and show how this yields a simple hash table data structure that stores $n$
elements in $(1+\epsilon)\,n$ memory cells, for any constant $\epsilon > 0$.
Assuming uniform hashing, accessing or deleting table entries takes at most $d
= O(\ln\frac{1}{\epsilon})$ probes and the expected amortized insertion time is
constant. This is the first dictionary that has worst case constant access time
and expected constant update time, works with $(1+\epsilon)\,n$ space, and
supports satellite information. Experiments indicate that $d=4$ choices suffice
for $\epsilon \approx 0.03$. We also describe a hash table data structure using
explicit constant time hash functions, using at most $d=
O(\ln^2\frac{1}{\epsilon})$ probes in the worst case.
A corollary is an expected linear time algorithm for finding maximum
cardinality matchings in a rather natural model of sparse random bipartite
graphs. },
}
@ARTICLE{FPSSICOMP2013,
AUTHOR = {Fountoulakis, Nikolaos and Panagiotou, Konstantinos},
JOURNAL = {SIAM Journal on Computing},
TITLE = {On the Insertion Time of Cuckoo Hashing},
YEAR = {2013},
NOTE = {Accepted for publication.},
}
@INPROCEEDINGS{fr-rcwcae-01,
AUTHOR = {Funke, Stefan and Ramos, Edgar A.},
TITLE = {Reconstructing a Collection of Curves with Corners and Endpoints},
BOOKTITLE = {Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01)},
ORGANIZATION = {Association of Computing Machinery (ACM); Society for Industrial and Applied Mathematics (SIAM)},
PADDRESS = {New York, USA},
ADDRESS = {Washington DC, USA},
PUBLISHER = {ACM},
MONTH = {January},
ISBN = {0-89871-490-7},
YEAR = {2001},
PAGES = {344--353},
}
@INPROCEEDINGS{fr-ssrinlt-02,
AUTHOR = {Funke, Stefan and Ramos, Edgar A.},
TITLE = {Smooth-Surface Reconstruction in Near-Linear Time},
BOOKTITLE = {Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02)},
ORGANIZATION = {Association of Computing Machinery (ACM); Society for Industrial and Applied Mathematics (SIAM)},
PADDRESS = {New York, USA},
ADDRESS = {San Francisco, USA},
PUBLISHER = {ACM},
MONTH = {January},
ISBN = {0-89871-513-X},
YEAR = {2002},
PAGES = {781--790},
}
@ARTICLE{FredericksonSolis-Oba98,
AUTHOR = {Frederickson, Greg N. and Solis-Oba, Roberto},
JOURNAL = {Combinatorica},
TITLE = {Algorithms for Measuring Perturbability in Matroid Optimization},
NUMBER = {4},
VOLUME = {18},
ISBN = {0209-9683},
YEAR = {1998},
PAGES = {503--518},
}
@ARTICLE{FredmanKhachiyan96,
AUTHOR = {Fredman, Michael and Khachiyan, Leonid},
JOURNAL = {J. Algorithms},
TITLE = {On the Complexity of Dualization of Monotone Disjunctive Normal Forms},
NUMBER = {3},
VOLUME = {21},
YEAR = {1996},
PAGES = {618--628},
}
@MASTERSTHESIS{Friedrich2005,
AUTHOR = {Friedrich, Tobias},
TITLE = {Deterministic Random Walks on Infinite Grids},
SCHOOL = {Friedrich-Schiller-Universit{\"a}t Jena},
TYPE = {Master's thesis},
MONTH = {December},
YEAR = {2005},
NOTE = {Mathematik-Diplomarbeit, eingereicht an der Friedrich-Schiller-Universit{\"a}t Jena},
ABSTRACT = {The rotor-router model is a simple deterministic analogue of random walk
invented by Jim Propp. Instead of distributing chips to randomly chosen
neighbors, it serves the neighbors in a fixed order. This thesis investigates
how well this process simulates
a random walk on an infinite two-dimensional grid. Independent of the starting
configuration, at each time and on each vertex, the number of chips on this
vertex deviates from the expected number of chips in the random walk model by
at most a constant $c$. It is proved that $7.2 < c < 11.8$ in general.
Surprisingly, these bounds depend on the order in which the neighbors are
served. It is also shown that in a generalized setting, where one just
requires that no neighbor gets more than
$\Delta$ chips more than another, there is also such a constant $c'$ with
$7.7\Delta < c' < 26.9\Delta$.},
}
@INPROCEEDINGS{Friedrich2009,
AUTHOR = {Friedrich, Tobias and Gairing, Martin and Sauerwald, Thomas},
EDITOR = {Charikar, Moses},
TITLE = {Quasirandom Load Balancing},
BOOKTITLE = {21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010)},
PADDRESS = {Philadelphia, Pa.},
ADDRESS = {Austin, Texas},
PUBLISHER = {SIAM},
ISBN = {978-0-898716-98-6},
YEAR = {2010},
PAGES = {1620--1629},
}
@ARTICLE{FriedrichDAM2011,
AUTHOR = {Friedrich, Tobias and Hebbinghaus, Nils},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Average update times for fully-dynamic all-pairs shortest paths},
ADDRESS = {Amsterdam},
NUMBER = {16},
PUBLISHER = {Elsevier},
VOLUME = {159},
ISBN = {0166-218X},
DOI = {10.1016/j.dam.2011.02.007},
YEAR = {2011},
PAGES = {1751--1758},
}
@ARTICLE{FriedrichGS2012,
AUTHOR = {Friedrich, Tobias and Gairing, Martin and Sauerwald, Thomas},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Quasirandom Load Balancing},
ADDRESS = {Philadelphia, PA},
NUMBER = {4},
PUBLISHER = {SIAM},
VOLUME = {41},
DOI = {/10.1137/100799216},
YEAR = {2012},
PAGES = {747--771},
}
@ARTICLE{FriedrichKN2011,
AUTHOR = {Friedrich, Tobias and Kroeger, Trent and Neumann, Frank},
JOURNAL = {International Journal of Machine Learning and Cybernetics},
TITLE = {Weighted preferences in evolutionary multi-objective optimization},
ADDRESS = {New York, NY},
PUBLISHER = {Springer},
VOLUME = {Online First},
ISBN = {1868-808X},
DOI = {10.1007/s13042-012-0083-y},
YEAR = {2012},
PAGES = {1--10},
}
@ARTICLE{FriedrichOSW2009,
AUTHOR = {Friedrich, Tobias and Oliveto, Pietro and Sudholt, Dirk and Witt, Carsten},
JOURNAL = {Evolutionary Computation},
TITLE = {Analysis of Diversity-Preserving Mechanisms for Global Exploration},
ADDRESS = {Cambridge, MA},
NUMBER = {4},
PUBLISHER = {MIT Press},
VOLUME = {17},
ISBN = {1063-6560},
DOI = {10.1162/evco.2009.17.4.17401},
YEAR = {2009},
PAGES = {455--476},
}
@PHDTHESIS{FriedrichPhD2007,
AUTHOR = {Friedrich, Tobias},
TITLE = {Use and Avoidance of Randomness},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
MONTH = {December},
YEAR = {2007},
ABSTRACT = {Randomness is a crucial component in the design and analysis of many efficient
algorithms.
This thesis covers three aspects of randomness in computer science.
In the first chapter we examine a deterministic analogue
to the random walk and prove that it resembles the random walk closely
on a two-dimensional grid, but not on regular trees. We also propose and
analyse
a quasirandom analogue to the broadcasting model for disseminating information
in networks
and show that it achieves similar or better broadcasting times with a greatly
reduced use of random bits.
In the second chapter we present the first average-case analysis of three
different
algorithms for maintaining a topological ordering of
the nodes of a directed acyclic graph under dynamic updates.
We prove an expected runtime
which is significantly less than the best known
worst-case bound for this problem.
We finish with a third chapter that deals with randomized search heuristics.
We examine the impact of different diversity mechanisms on the runtime of a
single-objective evolutionary algorithm. We also show how this can
exponentially slow down evolutionary algorithms for
multi-objective problems.},
}
@INPROCEEDINGS{FriedrichRGG2010,
AUTHOR = {Bradonji{\'c}, Milan and Els{\"a}sser, Robert and Friedrich, Tobias and Sauerwald, Thomas and Stauffer, Alexandre},
EDITOR = {Charikar, Moses},
TITLE = {Efficient Broadcast on Random Geometric Graphs},
BOOKTITLE = {Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010)},
PADDRESS = {Philadelphia, PA},
ADDRESS = {Austin, Texas},
PUBLISHER = {SIAM},
ISBN = {978-0-898716-98-6},
YEAR = {2010},
PAGES = {1412--1421},
}
@ARTICLE{FriedrichRSA2011,
AUTHOR = {Friedrich, Tobias and Sauerwald, Thomas and Vilenchik, Dan},
JOURNAL = {Random Structures \& Algorithms},
TITLE = {Smoothed analysis of balancing networks},
ADDRESS = {Chichester},
NUMBER = {1},
PUBLISHER = {Wiley},
VOLUME = {39},
ISBN = {1042-9832},
DOI = {DOI: 10.1002/rsa.20341},
YEAR = {2011},
PAGES = {115--138},
}
@INPROCEEDINGS{FriedrichSauerwald2010,
AUTHOR = {Friedrich, Tobias and Sauerwald, Thomas},
EDITOR = {Thai, My T. and Sahni, Sartaj},
TITLE = {The Cover Time of Deterministic Random Walks},
BOOKTITLE = {Computing and Combinatorics : 16th Annual International Conference, COCOON 2010},
PADDRESS = {Berlin},
ADDRESS = {Nha Trang, Vietnam},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6196},
ISBN = {978-3-642-14030-3},
DOI = {10.1007/978-3-642-14031-0_16},
YEAR = {2010},
PAGES = {130--139},
}
@ARTICLE{FriedrichSauerwald2010EJC,
AUTHOR = {Friedrich, Tobias and Sauerwald, Thomas},
JOURNAL = {The Electronic Journal of Combinatorics},
TITLE = {The Cover Time of Deterministic Random Walks},
ADDRESS = {Philadelphia, PA},
NUMBER = {1},
PUBLISHER = {University of Pennsylvania},
MONTH = {December},
VOLUME = {17},
YEAR = {2010},
PAGES = {R167,1--R167,30},
}
@INPROCEEDINGS{FriedrichSauerwaldVilenchik09,
AUTHOR = {Friedrich, Tobias and Sauerwald, Thomas and Vilenchik, Dan},
EDITOR = {Albers, Susanne and Marchetti-Spaccamela, Alberto and Matias, Yossi and Nikoletseas, Sotiris and Thomas, Wolfgang},
TITLE = {Smoothed Analysis of Balancing Networks},
BOOKTITLE = {Automata, Languages and Programming : 36th International Colloquium, ICALP 2009},
PADDRESS = {Berlin, Germany},
ADDRESS = {Rhodes, Greece},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5556},
ISBN = {978-3-642-02929-5},
DOI = {10.1007/978-3-642-02930-1_39},
YEAR = {2009},
PAGES = {472--483},
}
@INPROCEEDINGS{FriedrichSS11,
AUTHOR = {Friedrich, Tobias and Sauerwald, Thomas and Stauffer, Alexandre},
EDITOR = {Asano, Takao and Nakano, Shin-Ichi and Okamoto, Yoshio and Watanabe, Osamu},
TITLE = {Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions},
BOOKTITLE = {22nd International Symposium on Algorithms and Computation (ISAAC-11)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Yokohama, Japan},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7074},
YEAR = {2011},
PAGES = {190--199},
}
@ARTICLE{FriedrichTCS2011,
AUTHOR = {Friedrich, Tobias and Horoba, Christian and Neumann, Frank},
JOURNAL = {Theoretical Computer Science},
TITLE = {Illustration of fairness in evolutionary multi-objective optimization},
ADDRESS = {Amsterdam},
NUMBER = {17},
PUBLISHER = {Elsevier},
VOLUME = {412},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2010.09.023},
YEAR = {2011},
PAGES = {1546--1556},
}
@MASTERSTHESIS{Fries2000,
AUTHOR = {Fries, Markus},
TITLE = {Implementation of a Dynamic Convex Hull Algorithm in Arbitrary Dimension},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {November},
YEAR = {2000},
}
@MASTERSTHESIS{FriesDipl01,
AUTHOR = {Fries, Markus},
TITLE = {Implementation of a Dynamic Convex Hall Algorithm in Arbitrary Dimension},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {January},
YEAR = {2001},
}
@ARTICLE{FrietalECJ2009,
AUTHOR = {Friedrich, Tobias and He, Jun and Hebbinghaus, Nils and Neumann, Frank and Witt, Carsten},
JOURNAL = {Evolutionary Computation,},
TITLE = {Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem},
ADDRESS = {Cambridge, MA},
NUMBER = {1},
PUBLISHER = {MIT Press},
VOLUME = {17},
ISBN = {1063-6560},
DOI = {10.1162/evco.2009.17.1.3},
YEAR = {2009},
PAGES = {3--19},
}
@INPROCEEDINGS{Frigioni-et-al-98,
AUTHOR = {Frigioni, Daniele and Miller, Tobias and Nanni, Umberto and Pasqualone, Giulio and Sch{\"a}fer, Guido and Zaroliagis, Christos},
EDITOR = {Bilardi, Gianfranco and Italiano, Giuseppe F. and Pietracaprina, Andrea and Pucci, Geppino},
TITLE = {An experimental study of dynamic algorithms for directed graphs},
BOOKTITLE = {Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Venice, Italy},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1461},
YEAR = {1998},
PAGES = {368--380},
}
@ARTICLE{FriHebNeuTCS2009,
AUTHOR = {Friedrich, Tobias and Hebbinghaus, Nils and Neumann, Frank},
JOURNAL = {Theoretical Computer Science},
TITLE = {Comparison of Simple Diversity Mechanisms on Plateau Functions},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {26},
PUBLISHER = {Elsevier},
VOLUME = {410},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2008.08.021},
YEAR = {2009},
PAGES = {2455--2462},
}
@INPROCEEDINGS{FriHorNeuGECCO2009,
AUTHOR = {Friedrich, Tobias and Horoba, Christian and Neumann, Frank},
EDITOR = {Raidl, G{\"u}nther and Rothlauf, Franz},
TITLE = {Multiplicative Approximations and the Hypervolume Indicator},
BOOKTITLE = {Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009)},
PADDRESS = {New York, USA},
ADDRESS = {Montreal, Canada},
PUBLISHER = {ACM},
ISBN = {978-1-60558-325-9},
DOI = {10.1145/1569901.1569981},
YEAR = {2009},
PAGES = {571--578},
NOTE = {Best Paper Award in the track "Evolutionary Multiobjective Optimization"},
}
@INPROCEEDINGS{FriHorNeuPPSN2008,
AUTHOR = {Friedrich, Tobias and Horoba, Christian and Neumann, Frank},
EDITOR = {Rudolph, G{\"u}nter and Jansen, Thomas and Lucas, Simon M. and Poloni, Carlo and Beume, Nicola},
TITLE = {Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization},
BOOKTITLE = {Parallel Problem Solving from Nature (PPSN X)},
PADDRESS = {Berlin},
ADDRESS = {Dortmund, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5199},
ISBN = {978-3-540-87699-1},
DOI = {10.1007/978-3-540-87700-4_67},
YEAR = {2008},
PAGES = {671--680},
}
@INPROCEEDINGS{FriNeuCEC2008,
AUTHOR = {Friedrich, Tobias and Neumann, Frank},
TITLE = {When to Use Bit-wise Neutrality},
BOOKTITLE = {IEEE Congress on Evolutionary Computation 2008},
PADDRESS = {Vancouver, CA},
ADDRESS = {Hong Kong},
PUBLISHER = {IEEE},
YEAR = {2008},
PAGES = {997--1003},
}
@ARTICLE{FriNeuNat2009,
AUTHOR = {Friedrich, Tobias and Neumann, Frank},
JOURNAL = {Natural Computing},
TITLE = {When to Use Bit-Wise Neutrality},
ADDRESS = {New York, NY},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {9},
ISBN = {1567-7818},
DOI = {10.1007/s11047-008-9106-8},
YEAR = {2010},
PAGES = {283 -- 294},
NOTE = {To appear},
}
@ARTICLE{FroylandKMDW08,
AUTHOR = {Froyland, Gary and Koch, Thorsten and Megow, Nicole and Duane, Emily and Wren, Howard},
JOURNAL = {OR Spectrum},
TITLE = {Optimizing the Landside Operation of a Container Terminal},
NUMBER = {1},
MONTH = {January},
VOLUME = {30},
YEAR = {2008},
PAGES = {53--75},
}
@INPROCEEDINGS{fs-rsm-01,
AUTHOR = {Fuhrmann, Artur and Sch{\"o}mer, Elmar},
TITLE = {A General Method for Computing the Reachable Space of Mechanisms},
BOOKTITLE = {Proceedings of the 2001 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference. - Vol. 2, 27th Design Automation Conference (DETC'01)},
PADDRESS = {New York, USA},
ADDRESS = {Pittsburgh, Pennsylvania},
PUBLISHER = {American Society of Mechanical Engineers},
ISBN = {0791835316},
YEAR = {2001},
PAGES = {DAC--21057},
}
@INPROCEEDINGS{FS09,
AUTHOR = {Friedrich, Tobias and Sauerwald, Thomas},
TITLE = {Near-Perfect Load Balancing by Randomized Rounding},
BOOKTITLE = {STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing},
PADDRESS = {New York, NY},
ADDRESS = {Bethesda, Maryland, USA},
PUBLISHER = {ACM},
ISBN = {978-1-60558-613-7},
DOI = {10.1145/1536414.1536433},
YEAR = {2009},
PAGES = {121--130},
}
@ARTICLE{FS2002a,
AUTHOR = {Fotakis, Dimitris and Spirakis, Paul G.},
JOURNAL = {Algorithmica},
TITLE = {Minimum Congestion Redundant Assignments to Tolerate Random Faults},
ADDRESS = {New York, USA},
NUMBER = {3},
PUBLISHER = {Springer},
VOLUME = {32},
ISBN = {0178-4617},
YEAR = {2002},
PAGES = {396--422},
ABSTRACT = {We consider the problem of computing minimum congestion, fault-tolerant,
redundant assignments of messages to faulty, parallel delivery channels. In
particular, we are given a set $K$ of faulty channels, each having an integer
capacity $c_i$ and failing independently with probability $f_i$. We are also
given a set $M$ of messages to be delivered over $K$, and a fault-tolerance
constraint $(1-\epsilon)$, and we seek a redundant assignment $\phi$; that
minimizes congestion ${\sf Cong}(\phi)$, i.e. the maximum channel load, subject
to the constraint that, with probability no less than $(1-\epsilon)$, all the
messages have a copy on at least one active channel. We present a
polynomial-time 4-approximation algorithm for identical capacity channels and
arbitrary message sizes, and a $2 \lceil \ln(|K|/\epsilon)/\ln(1/f_{{\rm max}})
\rceil$-approximation algorithm for related capacity channels and unit size
messages.
Both algorithms are based on computing a collection $\{K_1, \ldots, K_\nu\}$ of
disjoint channel subsets such that, with probability no less than (1-\epsilon),
at least one channel is active in each subset. The objective is to maximize the
sum of the minimum subset capacities. Since the exact version of this problem
is NP-complete, we provide a 2-approximation algorithm for identical
capacities, and a polynomial-time $(8+{\rm o}(1))$-approximation algorithm for
arbitrary capacities.},
}
@INPROCEEDINGS{FuGui2006,
AUTHOR = {Funke, Stefan and Guibas, Leonidas and Nguyen, An and Wang, Yusu},
EDITOR = {Gibbons, Phillip B. and Abdelzaher, Tarek F. and Aspnes, James and Rao, Ramesh},
TITLE = {Distance-Sensitive Information Brokerage in Sensor Networks},
BOOKTITLE = {Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006},
ORGANIZATION = {IEEE},
PADDRESS = {Berlin, Germany},
ADDRESS = {San Francisco, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4026},
ISBN = {978-3-540-35227-3},
YEAR = {2006},
PAGES = {234--251},
ABSTRACT = {In a sensor network information from multiple nodes must usually be aggregated
in order to accomplish a certain task. A natural way to view this information
gathering is in terms of interactions between nodes that are producers of
information, e.g., those that have collected data, detected events, etc., and
nodes that are consumers of information, i.e., nodes that seek data or events
of certain types. Our overall goal in this paper is to construct efficient
schemes allowing consumer and producer nodes to discover each other so that the
desired information can be delivered quickly to those who seek it. Here,
efficiency means both limiting the redundancy of where producer information is
stored, as well as bounding the consumer query times. We introduce the notion
of distance-sensitive information brokerage and provide schemes for efficiently
bringing together information producers and consumers at a cost proportional to
the separation between them — even though neither the consumers nor the
producers know about each other beforehand.
Our brokerage scheme is generic and can be implemented on top of several
hierarchical routing schemes that have been proposed in the past, provided that
they are augmented with certain key sideway links. For such augmented
hierarchical routing schemes we provide a rigorous theoretical performance
analysis, which further allows us to prove worst case query times and storage
requirements for our information brokerage scheme. Experimental results
demonstrate that the practical performance of the proposed approaches far
exceeds their theoretical (worst-case) bounds. The presented algorithms rely
purely on the topology of the communication graph of the sensor network and do
not require any geographic location information.},
}
@INPROCEEDINGS{Funke1998,
AUTHOR = {Burnikel, Christoph and Funke, Stefan and Seel, Michael},
TITLE = {Exact Geometric Predicates using Cascaded Computation},
BOOKTITLE = {Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98)},
ORGANIZATION = {Association of Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Minneapolis, USA},
PUBLISHER = {ACM Press},
YEAR = {1998},
PAGES = {175--183},
}
@INPROCEEDINGS{Funke2007,
AUTHOR = {Aronov, Boris and Asano, Tetsuo and Funke, Stefan},
EDITOR = {Tokuyama, Takeshi},
TITLE = {Optimal Triangulation with Steiner Points},
BOOKTITLE = {Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings},
PADDRESS = {Berlin},
ADDRESS = {Sendai, Japan},
PUBLISHER = {Springer},
MONTH = {December},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4835},
ISBN = {978-3-540-77118-0},
YEAR = {2007},
PAGES = {681--691},
}
@MASTERSTHESIS{Funke97,
AUTHOR = {Funke, Stefan},
TITLE = {Exact Arithmetic using Cascaded Computation},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1997},
}
@PHDTHESIS{FunkeDiss2001,
AUTHOR = {Funke, Stefan},
TITLE = {Combinatorial Curve Reconstruction and the Efficient Exact Implementation of Geometric Algorithms},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
MONTH = {July},
YEAR = {2001},
}
@INPROCEEDINGS{FunkeHD2005,
AUTHOR = {Funke, Stefan},
TITLE = {Topological Hole Detection in Wireless Sensor Networks and its Applications},
BOOKTITLE = {3rd ACM/SIGMOBILE International Workshop on foundations of Mobile Computing (DIAL-M-POMC)},
ORGANIZATION = {ACM/SIGMOBILE},
PADDRESS = {New York, USA},
ADDRESS = {Cologne, Germany},
PUBLISHER = {ACM},
YEAR = {2005},
PAGES = {44--53},
}
@INPROCEEDINGS{FunkeIE2005,
AUTHOR = {Funke, Stefan and Milosavljevic, Nikola},
EDITOR = {Prasanna, Viktor K. and Iyengar, Sitharama and Spirakis, Paul and Welsh, Matt},
TITLE = {Infrastructure-Establishment from Scratch in Wireless Sensor Networks},
BOOKTITLE = {Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005},
ORGANIZATION = {Association for Computing Machinery (ACM), IEEE},
PADDRESS = {Berlin, Germany},
ADDRESS = {Marina Del Rey, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3560},
ISBN = {3-540-26422-1},
YEAR = {2005},
PAGES = {354--367},
}
@MISC{FunkeLaueLotkerNaujoks2006,
AUTHOR = {Funke, Stefan and Laue, S{\"o}ren and Naujoks, Rouven and Lotker, Zvi},
JOURNAL = {???},
TITLE = {Power Assignment Problems in Wireless Communication},
HOWPUBLISHED = {Internet},
YEAR = {2006},
PAGES = {1--14},
ABSTRACT = {A fundamental class of problems in wireless communication is concerned with the
assignment of suitable transmission powers to wireless devices/stations such
that the resulting communication graph satisfies certain desired properties and
the overall energy consumed is minimized. Many concrete communication tasks in
a wireless network like broadcast, multicast, point-to-point routing, creation
of a communication backbone, etc. can be regarded as such a power assignment
problem.
This paper considers several problems of that kind; for example one problem
studied before in \cite{Carrots, Bilo} aims to select and assign powers to $k$
of the stations such that all other stations are within reach of at least one
of the selected stations. We improve the running time for obtaining a
$(1+\epsilon)$-approximate solution for this problem from
$n^{((\alpha/\epsilon)^{O(d)})}$ as reported by Bilo et al. (\cite{Bilo}) to
$O(n+ {(\frac{k^{2d+1}}{\epsilon^d})}^{\min{\{2k, (\alpha/\epsilon)^{O(d)}
\}}})$ that is, we obtain a running time that is \emph{linear} in the network
size. Further results include a constant approximation algorithm for the TSP
problem under squared (non-metric!) edge costs, which can be employed to
implement a novel data aggregation protocol, as well as efficient schemes to
perform $k$-hop multicasts. },
}
@INPROCEEDINGS{FunkeRauf07,
AUTHOR = {Funke, Stefan and Rauf, Imran},
EDITOR = {Kranakis, Evangelos and Opatrny, Jaroslav},
TITLE = {Information Brokerage Via Location-Free Double Rulings},
BOOKTITLE = {Ad-Hoc, Mobile, and Wireless Networks : 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings},
PADDRESS = {Berlin, Germany},
ADDRESS = {Morelia, Mexico},
PUBLISHER = {Springer},
MONTH = {September},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4686},
ISBN = {3-540-74822-9},
DOI = {10.1007/978-3-540-74823-6},
YEAR = {2007},
PAGES = {87--100},
ABSTRACT = {The in-network aggregation and processing of information is what sets a sensor
network apart from a pure data acquisition device. One way to model the
exchange of information between the network nodes is to distinguish between
nodes that are \emph{producers} of information, i.e., those that have
collected data, detected events, etc., and nodes that are \emph{consumers} of
information, i.e., nodes that seek data or events of certain types. In this
paper we aim to support that exchange of information via a so-called
\emph{information brokerage} scheme. Main features of our proposed scheme are
that 1) it works in a location-free setting where nodes are unaware of their
geographic locations 2) it is robust to non-regular network topologies and 3)
it does not require the information producers and consumers to know of each
other. Our proposed scheme employs boundary detection algorithms which only
quite recently have been developed to extract geometry and topology information
even in location-free network deployments.},
}
@ARTICLE{F.Sibeyn-ActaInformatica38-1998,
AUTHOR = {Sibeyn, Jop F.},
JOURNAL = {Acta Informatica},
TITLE = {List Ranking on Meshes},
NUMBER = {7},
PUBLISHER = {Springer},
VOLUME = {35},
ISBN = {0001-5903},
YEAR = {1998},
PAGES = {543--566},
}
@PHDTHESIS{F.Sibeyn-HabilThesis-1999,
AUTHOR = {Sibeyn, Jop F.},
TITLE = {{Effiziente parallele Algorithmen}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Habilitation thesis},
MONTH = {February},
YEAR = {1999},
NOTE = {Lebenslauf, Schriftenverzeichnis, Zusammenfassung},
ABSTRACT = { In diesem Bericht sind die Dokumente geb\"undelt, die erforderlich
sind f\"ur eine m\"ogliche Er\"offnung des Habilitationsverfahren
an der Technischen Fakult\"at der Universit\"at des Saarlandes.
Nach meinem Lebenslauf folgt ein Schriftenverzeichnis. Darin
wird ein \"Uberblick \"uber meine nicht-wissenschaftlichen
Aktivit\"aten gegeben: Unterricht und Projekte. Der gr\"o\3te
Teil dieses Berichtes wird von einer Zusammenfassung meiner
wissenschaftlichen Aktivit\"aten seit Juli 1992 (meine Zeit in
Saarbr\"ucken) eingenommen. Am Ende dieser Zusammenfassung sind
die eigenen Ver\"offentlichungen aus diesem Zeitraum und Referenzen
zu der relevanten Literatur aufgelistet. Der Bericht wird
abgeschlossen mit einem Anhang, in dem Kopien der vorhandenen
Lehrveranstaltungsbescheinigungen aufgenommen sind.},
}
@INPROCEEDINGS{F.Sibeyn-HiPC-1999,
AUTHOR = {Sibeyn, Jop F.},
EDITOR = {Banerjee, Prith and Prasanna, Viktor K. and Sinha, Bhabani F.},
TITLE = {Ultimate Parallel List Ranking?},
BOOKTITLE = {Proceedings of the 6th International Conference on High Performance Computing (HiPC-99)},
ORGANIZATION = {IEEE},
PADDRESS = {Berlin},
ADDRESS = {Calcutta},
PUBLISHER = {Springer},
MONTH = {December},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1745},
ISBN = {0302-9743},
YEAR = {1999},
PAGES = {197--201},
ABSTRACT = { Two improved list-ranking algorithms are presented. The
``peeling-off'' algorithm leads to an optimal PRAM algorithm, but
was designed with application on a real parallel machine in mind.
It is simpler than earlier algorithms, and in a range of problem
sizes, where previously several algorithms where required for the
best performance, now this single algorithm suffices. If the problem
size is much larger than the number of available processors, then the
``sparse-ruling-sets'' algorithm is even better. In previous
versions this algorithm had very restricted practical application
because of the large number of communication rounds it was
performing. This weakness is overcome by
adding two new ideas, each of which reduces the number of
communication rounds by a factor of two.},
}
@ARTICLE{F.Sibeyn-IEEETransParaDistri-1998,
AUTHOR = {Sibeyn, Jop F. and Juurlink, Ben and Rao, P. Srinivasa},
JOURNAL = {IEEE Transactions on Parallel and Distributed Systems},
TITLE = {Gossiping on Meshes and Tori},
NUMBER = {6},
PUBLISHER = {IEEE},
MONTH = {June},
VOLUME = {9},
ISBN = {1045-9219},
YEAR = {1998},
PAGES = {513--525},
}
@INPROCEEDINGS{F.Sibeyn-IPPS-1999,
AUTHOR = {Sibeyn, Jop F.},
TITLE = {Better Deterministic Routing on Meshes},
BOOKTITLE = {Proceedings of the 13th International Parallel Processing Symposium, and 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP-99)},
PADDRESS = {Los Alamitos, USA},
ADDRESS = {St Juan, Puerto Rico},
PUBLISHER = {IEEE},
MONTH = {May},
ISBN = {0-7695-0143-5},
YEAR = {1999},
PAGES = {420--425},
ABSTRACT = { Optimal randomized and deterministic algorithms have been given for $k$-$k$
routing on two-dimensional $n \times n$ meshes. The deterministic algorithm
is based on ``column-sort'' and exploits only part of the
features of the mesh. For small $n$ and moderate $k$, the lower-order terms
of this algorithm make it considerably more expensive than the
randomized algorithm. In this paper, we present a novel deterministic
algorithm, which, by exploiting the topology of the mesh, has lower-order
terms that are almost negligible, even smaller than those of the randomized
algorithm. An additional advantage of the new algorithm is that it routes
average-case packet distributions twice as fast as worst-case distributions.
In earlier algorithms this required additional steps for globally probing the
distribution.},
}
@ARTICLE{F.Sibeyn-JParallelDistributedComp-1998,
AUTHOR = {Sibeyn, Jop F. and Grammatikakis, M.D. and Hsu, D.F. and Kraetzl, M.},
JOURNAL = {Journal of Parallel and Distributed Computing},
TITLE = {Packet Routing in Fixed-Connection Networks: A Survey},
PUBLISHER = {Academic Press},
VOLUME = {54},
ISBN = {0743-7315},
YEAR = {1998},
PAGES = {77--132},
}
@INPROCEEDINGS{F.Sibeyn-PDCS-1999,
AUTHOR = {Lambert, Oliver and Sibeyn, Jop F.},
EDITOR = {Zheng, S. Q.},
TITLE = {Parallel and External List Ranking and Connected Components on a Cluster of Workstations},
BOOKTITLE = {Proceedings of the 11th International Conference on Parallel and Distributed Computing and Systems (PDCS-99)},
ORGANIZATION = {IASTED},
PADDRESS = {Anaheim, USA},
ADDRESS = {Boston},
PUBLISHER = {IASTED},
MONTH = {November},
ISBN = {0-88986-275-3},
YEAR = {1999},
PAGES = {454--460},
ABSTRACT = { Improved parallel, external and parallel-external algorithms for
list-ranking and computing the connected components of a graph are
presented. These algorithms are implemented and tested on a cluster
of workstations using the C programming language and mpich, a
portable implementation of the MPI (Message-Passing Interface)
standard. },
}
@ARTICLE{F.Sibeyn-SIAM-1999,
AUTHOR = {Sibeyn, Jop F.},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Row-Major Sorting on Meshes},
NUMBER = {3},
PUBLISHER = {SIAM},
MONTH = {June},
VOLUME = {28},
YEAR = {1999},
PAGES = {847--863},
ABSTRACT = { In all recent near-optimal sorting algorithms for meshes, the
packets are sorted with respect to some snake-like indexing. In
this paper we present deterministic algorithms for sorting with
respect to the more natural row-major indexing.
For 1-1 sorting on an $n \times n$ mesh, we give an algorithm that
runs in $2 \cdot n + o(n)$ steps, matching the distance bound, with
maximal queue size five. It is considerably simpler than earlier
algorithms. Another algorithm performs $k$-$k$ sorting in $k \cdot
n / 2 + o(k \cdot n)$ steps, matching the bisection bound.
Furthermore, we present {\em uni-axial} algorithms for row-major
sorting. We show that 1-1 sorting can
be performed in $2\breukk{1}{2} \cdot n + o(n)$ steps.
Alternatively, this problem is solved with maximal queue size five
in $4\breukk{1}{3} \cdot n$ steps, without any additional terms. },
}
@INPROCEEDINGS{F.Sibeyn-SIROCCO-1999,
AUTHOR = {Sibeyn, Jop F.},
EDITOR = {Gavoille, Cyril and Bermond, Jean-Claude and Raspaud, Andr{\'e}},
TITLE = {Power and Limitations of Optical Reconfigurable Arrays},
BOOKTITLE = {Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6)},
PADDRESS = {Waterloo, Canada},
ADDRESS = {Lacanau-Oc{\'e}an, France},
PUBLISHER = {Carleton Scientific},
MONTH = {July},
SERIES = {Proceedings in Informatics},
VOLUME = {5},
ISBN = {1-894145-04-6},
YEAR = {1999},
PAGES = {249--263},
ABSTRACT = { The mesh with optical reconfigurable buses is one of the strongest
interconnection networks one can think of. There is a constant-time
randomized selection algorithm. In this paper, a deterministic
selection algorithm is given that runs in $\go{(\log\log N)^2}$ time.
It was known that $h$-relations can be routed randomizedly in
$\go{h}$ time, here we show that the same can be achieved with a
deterministic algorithm. The sorting problem is analyzed in detail,
and a new faster algorithm is presented.},
}
@INPROCEEDINGS{F.Sibeyn-STACS-1999,
AUTHOR = {Sibeyn, Jop F.},
EDITOR = {Meinel, Christoph and Tison, Sophie},
TITLE = {External Selection},
BOOKTITLE = {Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS-99)},
PADDRESS = {Berlin},
ADDRESS = {Trier},
PUBLISHER = {Springer},
MONTH = {March},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1563},
ISBN = {0302-9743},
YEAR = {1999},
PAGES = {291--301},
ABSTRACT = { Sequential selection has been solved in linear time by Blum e.a.
Running this algorithm on a problem of size $N$ with $N > M$, the
size of the main-memory, results in an algorithm that reads and
writes $\go{N}$ elements, while the number of comparisons is also
bounded by $\go{N}$. This is asymptotically optimal, but the
constants are so large that in practice sorting is faster for
most values of $M$ and $N$.
This paper provides the first detailed study of the external
selection problem. A randomized algorithm of a conventional type is
close to optimal in all respects. Our deterministic algorithm is
more or less the same, but first the algorithm builds an index
structure of all the elements. This effort is not wasted: the index
structure allows the retrieval of elements so that we do not need a
second scan through all the data. This index structure can also
be used for repeated selections, and can be extended over time. For
a problem of size $N$, the deterministic algorithm reads $N + o(N)$
elements and writes only $o(N)$ elements and is thereby optimal to
within lower-order terms. },
}
@INPROCEEDINGS{F.SibeynSWAT1998,
AUTHOR = {Sibeyn, Jop F.},
EDITOR = {Arnborg, Stefan and Ivansson, Lars},
TITLE = {Solving Fundamental Problems on Sparse-Meshes},
BOOKTITLE = {Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Stockholm},
PUBLISHER = {Springer},
MONTH = {July},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1432},
ISBN = {0302-9743},
YEAR = {1998},
PAGES = {288--299},
}
@UNPUBLISHED{G4,
AUTHOR = {P. Gao},
TITLE = {Distributions of sparse spanning subgraphs in random graphs},
YEAR = {2012},
NOTE = {Accepted for "SIAM Journal on Discrete Mathematics"},
}
@UNPUBLISHED{G6,
AUTHOR = {P. Gao},
TITLE = {Distribution of the number of spanning regular subgraphs in random graphs},
YEAR = {2012},
NOTE = {Accepted for "Random Structures and Algorithms"},
}
@UNPUBLISHED{G7,
AUTHOR = {P. Gao},
TITLE = {Uniform generation of d-factors in dense host graphs},
YEAR = {2012},
NOTE = {Accepted for "Graphs and Combinatorics"},
}
@INPROCEEDINGS{GaertnerHotzr2009,
AUTHOR = {G{\"a}rtner, Tobias and Hotz, G{\"u}nter},
EDITOR = {Ambos-Spies, Klaus and L{\"o}we, Benedikt and Merkle, Wolfgang},
TITLE = {Computability of Analytic Functions with Analytic Machines},
BOOKTITLE = {Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009},
PADDRESS = {Berlin, Germany},
ADDRESS = {Heidelberg, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5635},
ISBN = {978-3-642-03072-7},
DOI = {10.1007/978-3-642-03073-4_26},
YEAR = {2009},
PAGES = {250--259},
}
@ARTICLE{GameAging2001,
AUTHOR = {Doerr, Benjamin},
JOURNAL = {Electronic Notes in Discrete Mathematics},
TITLE = {Vector Balancing Games with Aging},
VOLUME = {10},
YEAR = {2001},
}
@UNPUBLISHED{Gao2010DegSub,
AUTHOR = {Gao, Pu (Jane) and Wormald, Nicholas and Su, Yi},
TITLE = {Induced subgraphs in sparse random graphs with given degree sequence},
MONTH = {September},
YEAR = {2010},
PAGES = {31},
ABSTRACT = {Let $\mathcal{G}_{n,d}$ denote the uniformly random $d$-regular graph on $n$
vertices. For any $S\subset [n]$, we obtain estimates of the probability that
the subgraph
of $\mathcal{G}_{n,d}$ induced by $S$ is a given graph $H$. The estimate gives
an asymptotic formula for any $d=o(n^{1/3})$, provided that $H$ does not
contain almost all the edges of the random graph. The result is
further extended to the probability space
of random graphs with a given degree sequence.},
}
@UNPUBLISHED{Gao2012dFactor,
AUTHOR = {Gao, Pu (Jane)},
TITLE = {Distribution of spanning regular subgraphs in random graphs},
MONTH = {February},
YEAR = {2011},
PAGES = {13},
ABSTRACT = {In this paper, we examine the moments of the number of spanning
regular subgraphs in $\G(n,p)$ for all $p$ and $d$ satisfying $d^3=o(p^2n)$. We
also determine the limiting distribution of the number of $d$-factors inside
this range with further restriction that $1-p>>(dn)^{-1/2}$.},
}
@INPROCEEDINGS{Garg-et-al96,
AUTHOR = {Garg, Naveen and Papatriantafilou, Marina and Tsigas, Philippas},
TITLE = {Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations},
BOOKTITLE = {8th Annual IEEE Symposium on Parallel and Distributed Processing (SPDP '96)},
PADDRESS = {Los Alamitos},
ADDRESS = {New Orleans},
PUBLISHER = {IEEE},
YEAR = {1996},
PAGES = {18--25},
}
@ARTICLE{Garg-Vazirani-95,
AUTHOR = {Garg, Naveen and Vazirani, Vijay V.},
JOURNAL = {Mathematical Programming (A)},
TITLE = {A polyhedron with all s-t cuts as vertices, and adjacency of cuts},
NUMBER = {1},
PUBLISHER = {Elsevier},
VOLUME = {70},
ISBN = {0025-5610},
YEAR = {1995},
PAGES = {17--25},
}
@ARTICLE{Garg-Vazirani96,
AUTHOR = {Garg, Naveen and Vazirani, Vijay V.},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Approximate max-flow min-(multi)cut theorems and their applications},
NUMBER = {2},
PUBLISHER = {Society for Industrial and Applied Mathematics},
VOLUME = {25},
ISBN = {0097-5397},
YEAR = {1996},
PAGES = {235--251},
}
@ARTICLE{GargKonjevodRavi2000,
AUTHOR = {Garg, Naveen and Konjevod, Goran and Ravi, R.},
JOURNAL = {Journal of Algorithms},
TITLE = {Approximation algorithm for the group {Steiner} tree problem},
ADDRESS = {San Diego, USA},
NUMBER = {1},
PUBLISHER = {Academic Press},
VOLUME = {37},
ISBN = {0196-6774},
YEAR = {2000},
PAGES = {66--84},
ABSTRACT = {Given a weighted graph with some subsets of vertices called groups, the group
Steiner tree problem is to find a minimum-weight subgraph which contains at
least one vertex from each group. We give a randomized algorithm with a
polylogarithmic approximation guarantee for the group Steiner tree problem. The
previous best approximation guarantee was O (i2k1/i) in time O (nik2i)
(Charikar, Chekuri, Goel, and Guha). Our algorithm also improves existing
approximation results for network design problems with location-based
constraints and for the symmetric generalized traveling salesman problem},
}
@INPROCEEDINGS{GasienicJanssonLingasOestlin1997,
AUTHOR = {Gasieniec, Leszek and Jansson, Jesper and Lingas, Andrzej and {\"O}stlin, Anna},
EDITOR = {Jiang, Tao and Lee, D. T.},
TITLE = {On the complexity of computing evolutionary trees},
BOOKTITLE = {Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97)},
PADDRESS = {Berlin},
ADDRESS = {Shanghai, China},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1276},
YEAR = {1997},
PAGES = {134--145},
}
@INPROCEEDINGS{Gasieniec-Indyk-Krysta97,
AUTHOR = {Gasieniec, Leszek and Indyk, Piotr and Krysta, Piotr},
EDITOR = {Apostolico, Alberto and Hein, Jotun},
TITLE = {External inverse pattern matching},
BOOKTITLE = {Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Aarhus, Denmark},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1264},
YEAR = {1997},
PAGES = {90--101},
}
@INPROCEEDINGS{Gasieniec1-96,
AUTHOR = {Gasieniec, Leszek and Karpinski, Marek and Plandowski, Wojciech and Rytter, Wojciech},
EDITOR = {Karlsson, Rolf and Lingas, Andrzej},
TITLE = {Efficient Algorithms for Lempel-Ziv Encoding},
BOOKTITLE = {Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory},
PADDRESS = {Berlin},
ADDRESS = {Reykjavik, Iceland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1097},
YEAR = {1996},
PAGES = {392--403},
}
@INPROCEEDINGS{Gasieniec2-96,
AUTHOR = {Brodal, Gerth St{\o}lting and Gasieniec, Leszek},
EDITOR = {Hirschberg, Dan and Myers, Gene},
TITLE = {Approximate Dictionary Queries},
BOOKTITLE = {Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Laguna Beach},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1075},
YEAR = {1996},
PAGES = {65--74},
}
@INPROCEEDINGS{Gasieniec3-96,
AUTHOR = {Gasieniec, Leszek and Kranakis, Evangelos and Krizanc, Danny and Pelc, Andrzej},
EDITOR = {Penczek, Wojciech and Szalas, Andrzej},
TITLE = {Minimizing Congestion of Layouts for ATM Networks with Faulty Links},
BOOKTITLE = {Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96)},
PADDRESS = {Berlin},
ADDRESS = {Cracow, Poland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1113},
YEAR = {1996},
PAGES = {392--403},
}
@INPROCEEDINGS{Gasieniec4-96,
AUTHOR = {Chlebus, Bogdan S. and Czumaj, Artur and Gasieniec, Leszek and Kowaluk, Miroslaw and Plandowski, Wojciech},
EDITOR = {Penczek, Wojciech and Szalas, Andrzej},
TITLE = {Parallel Alternating-Direction Access Machine},
BOOKTITLE = {Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96)},
PADDRESS = {Berlin},
ADDRESS = {Cracow, Poland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1113},
YEAR = {1996},
PAGES = {255--266},
}
@INPROCEEDINGS{Gasieniec5-96,
AUTHOR = {Gasieniec, Leszek and Karpinski, Marek and Plandowski, Wojciech and Rytter, Wojciech},
EDITOR = {Hirschberg, Dan and Myers, Gene},
TITLE = {Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach},
BOOKTITLE = {Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96)},
PADDRESS = {Berlin},
ADDRESS = {Laguna Beach, CA, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1075},
YEAR = {1996},
PAGES = {39--49},
}
@ARTICLE{Gasieniec6-96,
AUTHOR = {Gasieniec, Leszek and Pelc, Andrzej},
JOURNAL = {Parallel Computing},
TITLE = {Adaptive Broadcasting with Faulty Nodes},
NUMBER = {6},
PUBLISHER = {Elsevier},
VOLUME = {22},
ISBN = {0167-8191},
YEAR = {1996},
PAGES = {903--912},
}
@INPROCEEDINGS{GasieniecIndyk97,
AUTHOR = {Gasieniec, Leszek and Indyk, Piotr},
EDITOR = {Chlebus, Bogdan S. and Czaja, Ludwik},
TITLE = {Efficient Parallel Computing with Memory Faults},
BOOKTITLE = {Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Krakcw, Poland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1279},
YEAR = {1997},
PAGES = {188--197},
}
@ARTICLE{GasieniecPelc97,
AUTHOR = {Gasieniec, Leszek and Pelc, Andrzej},
JOURNAL = {Journal of Parallel and Distributed Computing},
TITLE = {Broadcasting with a bounded fraction of faulty nodes},
NUMBER = {1},
VOLUME = {42},
YEAR = {1997},
PAGES = {11--20},
}
@MASTERSTHESIS{Gast97,
AUTHOR = {Gast, Christoph},
TITLE = {{Das Maximum-Weight-Trace-Problem bei multiplem Sequenz-Alignment}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1997},
}
@INPROCEEDINGS{Gawrychowski2012a,
AUTHOR = {Gawrychowski, Pawel},
EDITOR = {D{\"u}rr, Christoph and Wilke, Thomas},
TITLE = {Tying up the loose ends in fully {LZW}-compressed pattern matching},
BOOKTITLE = {29th International Symposium on Theoretical Aspects of Computer Science : STACS'12},
PADDRESS = {Dagstuhl},
ADDRESS = {Paris, France},
PUBLISHER = {Schloss Dagstuhl/ Leibniz-Zentrum f{\"u}r Informatik},
SERIES = {LIPIcs},
VOLUME = {14},
ISBN = {978-3-939897-35-4},
DOI = {10.4230/LIPIcs.STACS.2012.624},
YEAR = {2012},
PAGES = {624--635},
}
@INPROCEEDINGS{Gawrychowski2012b,
AUTHOR = {Gawrychowski, Pawel},
EDITOR = {K{\"a}rkk{\"a}inen, Juha and Stoye, Jens},
TITLE = {Simple and efficient {LZW}-compressed multiple pattern matching},
BOOKTITLE = {Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012},
PADDRESS = {Berlin},
ADDRESS = {Helsinki, Finland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7354},
ISBN = {978-3-642-31264-9},
DOI = {10.1007/978-3-642-31265-6},
YEAR = {2012},
PAGES = {232--242},
}
@INPROCEEDINGS{Gawrychowski2012c,
AUTHOR = {Gawrychowski, Pawel},
EDITOR = {Calder{\'o}n-Benavides, Liliana and Gonz{\'a}lez-Caro, Cristina N. and Ch{\'a}vez, Edgar and Ziviani, Nivio},
TITLE = {Faster Algorithm for Computing the Edit Distance between {SLP}-Compressed Strings},
BOOKTITLE = {String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012},
PADDRESS = {Berlin},
ADDRESS = {Cartagena de Indias, Colombia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7608},
ISBN = {978-3-642-34108-3},
DOI = {10.1007/978-3-642-34109-0},
YEAR = {2012},
PAGES = {229--236},
}
@INPROCEEDINGS{Gawrychowski2013,
AUTHOR = {Gawrychowski, Pawel and Manea, Florin and Mercas, Robert and Nowotka, Dirk and Tiseanu, Catalin},
EDITOR = {Portier, Natacha and Wilke, Thomas},
TITLE = {Finding Pseudo-repetitions},
BOOKTITLE = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
PADDRESS = {Dagstuhl, Germany},
ADDRESS = {Kiel, Germany},
PUBLISHER = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {20},
ISBN = {978-3-939897-50-7},
DOI = {10.4230/LIPIcs.STACS.2013.257},
YEAR = {2013},
PAGES = {257--268},
}
@INPROCEEDINGS{Gawrychowski2013alphabetic,
AUTHOR = {Gawrychowski, Pawel},
EDITOR = {Bulatov, Andrei A. and Shur, Arseny M.},
TITLE = {Alphabetic Minimax Trees in Linear Time},
BOOKTITLE = {8th International Computer Science Symposium in Russia (CSR 2013)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Yekaterinburg, Russia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7913},
ISBN = {978-3-642-38535-3},
DOI = {10.1007/978-3-642-38536-0_4},
YEAR = {2013},
PAGES = {36--48},
}
@INPROCEEDINGS{Gawrychowski2013ancestors,
AUTHOR = {Gagie, Travis and Gawrychowski, Pawel and Nekrich, Yakov},
TITLE = {Heaviest Induced Ancestors and Longest Common Substrings},
BOOKTITLE = {25th Canadian Conference on Computational Geometry (CCCG 13)},
PADDRESS = {Waterloo, Canada},
ADDRESS = {Waterloo, Canada},
YEAR = {2013},
PAGES = {145--150},
}
@INPROCEEDINGS{Gawrychowski2013beating,
AUTHOR = {Gawrychowski, Pawel and Straszak, Damian},
EDITOR = {Cai, Leizhen and Cheng, Siu-Wing and Lam, Tak Wah},
TITLE = {Beating O(nm) in Approximate LZW-Compressed Pattern Matching},
BOOKTITLE = {Algorithms and Computation - 24th International Symposium (ISAAC 2013)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Hong Kong, China},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8283},
ISBN = {978-3-642-45029-7},
DOI = {10.1007/978-3-642-45030-3},
YEAR = {2013},
PAGES = {78--88},
}
@INPROCEEDINGS{Gawrychowski2013converting,
AUTHOR = {Bannai, Hideo and Gawrychowski, Pawel and Inenaga, Shunsuke and Takeda, Masayuki},
EDITOR = {Fischer, Johannes and Sanders, Peter},
TITLE = {Converting SLP to LZ78 in almost Linear Time},
BOOKTITLE = {Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Bad Herrenalb, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7922},
ISBN = {978-3-642-38904-7},
DOI = {10.1007/978-3-642-38905-4_6},
YEAR = {2013},
PAGES = {38--49},
}
@INPROCEEDINGS{Gawrychowski2013discovering,
AUTHOR = {Gawrychowski, Pawel and Manea, Florin and Nowotka, Dirk},
EDITOR = {Bonizzoni, Paola and Brattka, Vasco and Lowe, Benedikt},
TITLE = {Discovering Hidden Repetitions in Words},
BOOKTITLE = {9th Conference on Computability in Europe (CiE 2013)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Milan, Italy},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7921},
ISBN = {978-3-642-39052-4},
DOI = {10.1007/978-3-642-39053-1},
YEAR = {2013},
PAGES = {210--219},
}
@INPROCEEDINGS{Gawrychowski2013discriminating,
AUTHOR = {Gawrychowski, Pawel and Kucherov, Gregory and Nekrich, Yakov and Starikovskaya, Tatiana},
EDITOR = {Kurland, Oren and Lewenstein, Moshe and Porat, Ely},
TITLE = {Minimal Discriminating Words Problem Revisited},
BOOKTITLE = {String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Jerusalem, Israel},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8214},
ISBN = {978-3-319-02431-8},
DOI = {10.1007/978-3-319-02432-5},
YEAR = {2013},
}
@INPROCEEDINGS{Gawrychowski2014,
AUTHOR = {Gawrychowski, Pawel and Manea, Florin and Nowotka, Dirk},
EDITOR = {Mayr, Ernst W. and Portier, Natacha},
TITLE = {Testing Generalised Freeness of Words},
BOOKTITLE = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
PADDRESS = {Dagstuhl, Germany},
ADDRESS = {Lyon, France},
PUBLISHER = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {25},
ISBN = {978-3-939897-65-1},
DOI = {10.4230/LIPIcs.STACS.2014.337},
YEAR = {2014},
PAGES = {337--349},
}
@INPROCEEDINGS{Gawrychowski2014a,
AUTHOR = {Gagie, Travis and Gawrychowski, Pawel and K{\"a}rkk{\"a}inen, Juha and Nekrich, Yakov and Puglisi, Simon J.},
EDITOR = {Parso, Alberto and Viola, Alfredo},
TITLE = {LZ77-Based Self-indexing with Faster Pattern Matching},
BOOKTITLE = {LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
PADDRESS = {Berlin, Germany},
ADDRESS = {Montevideo, Uruguay},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8392},
ISBN = {978-3-642-54422-4},
DOI = {10.1007/978-3-642-54423-1},
YEAR = {2014},
PAGES = {731--742},
}
@INPROCEEDINGS{Gawrychowski2014b,
AUTHOR = {Gawrychowski, Pawel and Mozes, Shay and Weimann, Oren},
EDITOR = {Esparza, Javier and Fraigniaud, Pierre and Husfeldt, Thore and Koutsoupias, Elias},
TITLE = {Improved Submatrix Maximum Queries in Monge Matrices},
BOOKTITLE = {Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I},
PADDRESS = {Berlin, Germany},
ADDRESS = {Copenhagen, Denmark},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8572},
ISBN = {978-3-662-43947-0},
DOI = {10.1007/978-3-662-43948-7},
YEAR = {2014},
PAGES = {525--537},
}
@INPROCEEDINGS{Gawrychowski2014c,
AUTHOR = {Gawrychowski, Pawel and Uznanski, Przemyslaw},
EDITOR = {Kulikov, Alexander S. and Kuznetsov, Sergei O. and Pevzner, Pavel A.},
TITLE = {Order-Preserving Pattern Matching with k Mismatches},
BOOKTITLE = {Combinatorial Pattern Matching - 25th Annual Symposium, {CPM} 2014, Moscow, Russia, June 16-18, 2014. Proceedings},
PADDRESS = {Berlin, Germany},
ADDRESS = {Moscow, Russia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8486},
ISBN = {978-3-319-07565-5},
DOI = {10.1007/978-3-319-07566-2},
YEAR = {2014},
PAGES = {130--139},
}
@INPROCEEDINGS{Gawrychowski2014d,
AUTHOR = {Babenko, Maxim A. and Gawrychowski, Pawel and Kociumaka, Tomasz and Starikovskaya, Tatiana A.},
EDITOR = {Kulikov, Alexander S. and Kuznetsov, Sergei O. and Pevzner, Pavel A.},
TITLE = {Computing Minimal and Maximal Suffixes of a Substring Revisited},
BOOKTITLE = {Combinatorial Pattern Matching - 25th Annual Symposium, {CPM} 2014, Moscow, Russia, June 16-18, 2014. Proceedings},
PADDRESS = {Springer, Germany},
ADDRESS = {Moscow, Russia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8486},
ISBN = {978-3-319-07565-5},
DOI = {10.1007/978-3-319-07566-2},
YEAR = {2014},
PAGES = {30--39},
}
@ARTICLE{Gawrychowski2014e,
AUTHOR = {Gawrychowski, Pawel},
JOURNAL = {Journal of Discrete Algorithms},
TITLE = {Simple and efficient LZW-compressed multiple pattern matching},
ADDRESS = {Amsterdam, Netherlands},
PUBLISHER = {Elsevier},
MONTH = {March},
VOLUME = {25},
ISBN = {1570-8667},
DOI = {10.1016/j.jda.2013.10.004},
YEAR = {2014},
PAGES = {34--41},
}
@ARTICLE{GawrychowskiJez2014,
AUTHOR = {Gawrychowski, Pawel and Jez, Artur and Jez, Lukasz},
JOURNAL = {Theory of Computing Systems},
TITLE = {Validating the Knuth-Morris-Pratt Failure Function, Fast and Online},
ADDRESS = {Berlin},
NUMBER = {2},
PUBLISHER = {Springer},
MONTH = {February},
VOLUME = {54},
ISBN = {1432-4350},
YEAR = {2014},
PAGES = {337--372},
ABSTRACT = {Let $\pi'_w$ denote the failure function of the Knuth-Morris-Pratt algorithm
for a word $w$.
In this paper we study the following problem: given an integer array $A'[1 ..
n]$, is there
a word $w$ over an arbitrary alphabet $\Sigma$ such that $A'[i]=\pi'_w[i]$ for
all $i$?
Moreover, what is the minimum cardinality of $\Sigma$ required?
We give an elementary and self-contained $\mathcal{O}(n\log n)$ time algorithm
for this problem,
thus improving the previously known solution, which had no polynomial time
bound.
Using both deeper combinatorial insight into the structure of $\pi'$ and
advanced algorithmic
tools, we further improve the running time to $\mathcal{O}(n)$.},
}
@INPROCEEDINGS{GDCompRep1999,
AUTHOR = {Brandenburg, Franz J. and Schreiber, Falk and J{\"u}nger, Michael and Marks, Joe and Mutzel, Petra},
EDITOR = {Kratochv{\'i}l, Jan},
TITLE = {Graph Drawing Contest Report},
BOOKTITLE = {Proceedings of the 7th International Symposium on Graph Drawing (GD-99)},
PADDRESS = {Berlin},
ADDRESS = {Prag, Czech Republic},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1731},
ISBN = {3-540-66904-3},
YEAR = {1999},
PAGES = {400--409},
}
@PROCEEDINGS{gecco2009,
EDITOR = {Raidl, G{\"u}nther R. and Alba, Enrique and Bacardit, Jaume and Beyer, Hans-Georg and Birattari, Mauro and Blum, Christian and Bosman, Peter A.N. and Congdon, Clare B. and Corne, David W. and Cotta, Carlos and Di Penta, Massimiliano and Doerr, Benjamin and Drechsle, Rolf and Ebner, Marc and Grahl, J{\"o}rn and Jansen, Thomas and Knowles, Joshua D. and Lenaerts, Tom and Middendorf, Martin and Miller, Julian F. and O'Neill, Michael and Poli, Riccardo and Squillero, Giovanni and Stanley, Kenneth O. and St{\"u}tzle, Thomas and van Hemert, Jano},
TITLE = {GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.},
PADDRESS = {New York, NY, USA},
ADDRESS = {Montreal, Qu{\'e}bec, Canada},
PUBLISHER = {ACM},
ISBN = {978-1-60558-325-9},
YEAR = {2009},
PAGES = {1--1956},
}
@INPROCEEDINGS{Gergov-et-al96,
AUTHOR = {Gergov, Jordan},
EDITOR = {Diaz, Josep and Serna, Maria},
TITLE = {Approximation Algorithms for Dynamic Storage Allocation},
BOOKTITLE = {Algorithms - ESA '96: 4th Annual European Symposium},
PADDRESS = {Berlin},
ADDRESS = {Barcelona},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1136},
YEAR = {1996},
PAGES = {52--61},
}
@ARTICLE{Gergov-Meinel96,
AUTHOR = {Gergov, Jordan and Meinel, Christoph},
JOURNAL = {Formal Methods in System Design},
TITLE = {Mod-2-OBDDs - a Date Structure that generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams},
ADDRESS = {Boston, USA},
NUMBER = {3},
PUBLISHER = {Kluwer},
VOLUME = {8},
ISBN = {0925-9856},
YEAR = {1996},
PAGES = {273--282},
}
@PHDTHESIS{GergovDiss00,
AUTHOR = {Gergov, Jordan},
TITLE = {Algorithms for Interval Coloring, Geometric Packing and Memory Optimization},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
MONTH = {November},
YEAR = {2000},
}
@INPROCEEDINGS{ghhkms-bo3ds-03,
AUTHOR = {Granados, Miguel and Hachenberger, Peter and Hert, Susan and Kettner, Lutz and Mehlhorn, Kurt and Seel, Michael},
EDITOR = {Di Battista, Giuseppe and Zwick, Uri},
TITLE = {Boolean Operations on {3D} Selective {Nef} Complexes: Data Structure, Algorithms, and Implementation},
BOOKTITLE = {Algorithms - ESA 2003: 11th Annual European Symposium},
PADDRESS = {Berlin, Germany},
ADDRESS = {Budapest, Hungary},
PUBLISHER = {Springer},
MONTH = {September},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2832},
ISBN = {3-540-20064-9},
DOI = {10.1007/b13632},
YEAR = {2003},
PAGES = {654--666},
ABSTRACT = {We describe a data structure for three-dimensional Nef complexes, algorithms
for boolean operations on them, and our implementation of data structure and
algorithms. Nef polyhedra were introduced by W. Nef in his seminal 1978 book on
polyhedra. They are the closure of half-spaces under boolean operations and can
represent non-manifold situations, open and closed boundaries, and mixed
dimensional complexes. Our focus lies on the generality of the data structure,
the completeness of the algorithms, and the exactness and efficiency of the
implementation. In particular, all degeneracies are handled.},
}
@INPROCEEDINGS{ghs-che-01,
AUTHOR = {Geismann, Nicola and Hemmer, Michael and Sch{\"o}mer, Elmar},
TITLE = {The Convex Hull of Ellipsoids (Video)},
BOOKTITLE = {Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01)},
PADDRESS = {New York},
ADDRESS = {Bosten, Massachusetts},
PUBLISHER = {ACM},
YEAR = {2001},
PAGES = {321--322},
ABSTRACT = {The treatment of curved algebraic surfaces becomes more and more the
focus of attention in Computational Geometry. We present a video that
illustrates the computation of the convex hull of a set of
ellipsoids. The underlying algorithm is an application of our
work on determining a cell in a 3-dimensional arrangement of
quadrics, see \cite{ghs-ccaq-01}. In the video, the main
emphasis is on a simple and comprehensible visualization of the
geometric aspects of the algorithm. In addition, we give some insights
into the underlying mathematical problems.},
}
@INPROCEEDINGS{ghs-qsi-01,
AUTHOR = {Geismann, Nicola and Hemmer, Michael and Sch{\"o}mer, Elmar},
TITLE = {Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!},
BOOKTITLE = {Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01)},
ORGANIZATION = {ACM SIGACT and SIGGRAPH},
PADDRESS = {New York},
ADDRESS = {Boston, Massachusetts},
PUBLISHER = {ACM},
YEAR = {2001},
PAGES = {264--273},
ABSTRACT = {We present two approaches to the problem of calculating a cell in a
3-dimensional arrangement of quadrics. The first approach solves the
problem using rational arithmetic. It works with reductions to
planar arrangements of algebraic curves. Degenerate
situations such as tangential intersections and self-intersections of
curves are intrinsic to the planar arrangements we obtain.
The coordinates of the intersection points are given by
the roots of univariate polynomials.
We succeed in locating all intersection points either by extended
local box hit counting arguments or by globally characterizing
them with simple square root expressions.
The latter is realized by a clever factorization of the univariate
polynomials. Only the combination of these two results
facilitates a practical and implementable algorithm.
The second approach operates directly in 3-space by applying
classical solid modeling techniques. Whereas the first
approach guarantees a correct solution in every case the second one
may fail in some degenerate situations. But with the
help of verified floating point arithmetic it can detect these
critical cases and is faster if the quadrics are in general
position.},
}
@INPROCEEDINGS{GiakkoupisS12,
AUTHOR = {Giakkoupis, George and Sauerwald, Thomas},
EDITOR = {Rabani, Yuval},
TITLE = {Rumor spreading and vertex expansion},
BOOKTITLE = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12)},
PADDRESS = {Philadelphia, PA},
ADDRESS = {Kyoto, Japan},
PUBLISHER = {SIAM},
ISBN = {978-1-611972-11-5},
YEAR = {2012},
PAGES = {1623--1641},
}
@ARTICLE{Giannopoulos2010,
AUTHOR = {Giannopoulos, Panos and Klein, Rolf and Kutz, Martin and Marx, Daniel},
JOURNAL = {International Journal of Computational Geometry \& Applications},
TITLE = {Computing geometric minimum-dilation graphs is {NP-hard}},
ADDRESS = {Singapore},
NUMBER = {2},
PUBLISHER = {World Scientific},
VOLUME = {20},
ISBN = {0218-1959},
DOI = {10.1142/S0218195910003244},
YEAR = {2010},
PAGES = {147--173},
}
@INPROCEEDINGS{Gidenstam2007a,
AUTHOR = {Gidenstam, Anders and Papatriantafilou, Marina},
EDITOR = {Tovar, Eduardo and Tsigas, Philippas and Fouchal, Hac{\`e}ne},
TITLE = {LFthreads: A Lock-Free Thread Library},
BOOKTITLE = {11th International Conference On Principles Of Distributed Systems ({OPODIS})},
ORGANIZATION = {Association Pour la Diffusion Scientifique (APODIS); UAG, Universit{\'e} des Antilles et de la Guyane; EPHE, I'Ecole Pratique des Hautes Etudes, Sorbonne, France; LaISC, Laboratoire d'Informatique et des Syst{\'e}mes Complexes, France; GDR ARP du CNRS; INRIA, Institut National de la Recherche en Informatique et en Automatique},
PADDRESS = {Berlin, Germany},
ADDRESS = {Guadeloupe, French West Indies, France},
PUBLISHER = {Springer},
MONTH = {December},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4878},
ISBN = {ISSN 0302-9743},
YEAR = {2007},
PAGES = {217--231},
ABSTRACT = {LFthreads is a thread library entirely based on lock-free methods, i.e. no
spin-locks or similar synchronization mechanisms are employed in the
implementation of the multithreading. Since lock-freedom is highly desirable in
multiprocessors/multicores due to its advantages in parallelism,
fault-tolerance, convoy-avoidance and more, there is an increased demand in
lock-free methods in parallel applications, hence also in
multiprocessor/multicore system services. This is why a lock-free
multithreading library is important. To the best of our knowledge LFthreads is
the first thread library that provides a lock-free implementation of blocking
synchronization primitives for application threads. Lock-free implementation of
objects with blocking semantics may sound like a contradicting goal. However,
such objects have benefits: e.g. library operations that block and unblock
threads on the same synchronization object can make progress in parallel while
maintaining the desired thread-level semantics and without having to wait for
any ``slow'' operations among them. Besides, as no spin-locks or similar
synchronization mechanisms are employed, processors are always able to do
useful work. As a consequence, applications, too, can enjoy enhanced
parallelism and fault-tolerance. The synchronization in LFthreads is achieved
by a new method, which we call \emph{responsibility hand-off} (RHO), that does
not need any special kernel support.},
}
@ARTICLE{Gidenstam200901,
AUTHOR = {Larsson, Andreas and Gidenstam, Anders and Ha, Phuong H. and Papatriantafilou, Marina and Tsigas, Philippas},
JOURNAL = {Journal of experimental algorithmics},
TITLE = {Multiword Atomic Read/Write Registers on Multiprocessor Systems},
ADDRESS = {New York, NY},
NUMBER = {1},
PUBLISHER = {ACM},
VOLUME = {13},
ISBN = {1084-6654},
DOI = {10.1145/1412228.1455262},
YEAR = {2009},
PAGES = {7:1--7:30},
}
@ARTICLE{Gidenstam200902,
AUTHOR = {Gidenstam, Anders and Papatriantafilou, Marina and Sundell, H{\aa}kan and Tsigas, Philippas},
JOURNAL = {IEEE Transactions on Parallel and Distributed Systems},
TITLE = {Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting},
ADDRESS = {Piscataway, NJ},
NUMBER = {8},
PUBLISHER = {IEEE},
VOLUME = {20},
ISBN = {1045-9219},
DOI = {10.1109/TPDS.2008.167},
YEAR = {2009},
PAGES = {1173--1187},
}
@ARTICLE{Gidenstam200903,
AUTHOR = {Gidenstam, Anders and Papatriantafilou, Marina and Tsigas, Phillipas},
JOURNAL = {Algorithmica},
TITLE = {NBmalloc : Allocating Memory in a Lock-Free Manner},
ADDRESS = {New York, NY},
PUBLISHER = {Springer},
VOLUME = {Online First},
ISBN = {1432-0541},
DOI = {10.1007/s00453-008-9268-x},
YEAR = {2009},
PAGES = {1--35},
}
@ARTICLE{Gidenstam2010,
AUTHOR = {Gidenstam, Anders and Papatriantafilou, Marina and Tsigas, Philippas},
JOURNAL = {Algorithmica},
TITLE = {NBmalloc: {Allocating} Memory in a Lock-Free Manner},
ADDRESS = {Berlin},
NUMBER = {2},
PUBLISHER = {Springer},
VOLUME = {58},
ISBN = {0178-4617},
DOI = {10.1007/s00453-008-9268-x},
YEAR = {2010},
PAGES = {304--338},
}
@ARTICLE{Giesen2007,
AUTHOR = {Giesen, Joachim and Schuberth, Eva and Simon, Klaus and Zolliker, Peter and Zweifel, Oliver},
JOURNAL = {IEEE Transactions on Image Processing},
TITLE = {Image-Dependent Gamut Mapping as Optimization Problem},
ADDRESS = {Los Alamitos, CA, USA},
NUMBER = {10},
PUBLISHER = {IEEE},
MONTH = {October},
VOLUME = {16},
ISBN = {1057-7149},
DOI = {10.1109/TIP.2007.904455},
YEAR = {2007},
PAGES = {2401--2410},
}
@ARTICLE{Giesen2007b,
AUTHOR = {Giesen, Joachim},
JOURNAL = {Computational Geometry - Theory and Applications},
TITLE = {Delaunay Triangulation Approximates Anchor Hull},
PUBLISHER = {Elsevier},
VOLUME = {36},
YEAR = {2008},
PAGES = {131--143},
}
@ARTICLE{Giesen2007c,
AUTHOR = {Giesen, Joachim},
JOURNAL = {IEEE Transactions on Visualization and Computer Graphics},
TITLE = {Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering},
NUMBER = {6},
PUBLISHER = {IEEE},
VOLUME = {13},
YEAR = {2008},
PAGES = {1664--1671},
}
@INPROCEEDINGS{Giesen2007col,
AUTHOR = {Giesen, Joachim and Mitsche, Dieter and Schuberth, Eva},
EDITOR = {Kao, Ming-Yang and Li, Xiang-Yang},
TITLE = {Collaborative Ranking: an aggregation algorithm for individuals' preference estimation},
BOOKTITLE = {Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007},
PADDRESS = {Heidelberg, Germany},
ADDRESS = {Portland, USA},
PUBLISHER = {Springer},
VOLUME = {4508},
ISBN = {3-540-72868-9},
DOI = {10.1007/978-3-540-72870-2_6},
YEAR = {2007},
PAGES = {58--67},
}
@INCOLLECTION{Giesen2007conj,
AUTHOR = {Giesen, Joachim},
EDITOR = {A. Gustafsson and A. Herrmann and F. Huber},
TITLE = {The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis},
BOOKTITLE = {Conjoint Measurement: Methods and Applications},
CHAPTER = {13},
ADDRESS = {Heidelberg, Germany},
PUBLISHER = {Springer},
EDITION = {4},
YEAR = {2007},
PAGES = {259--271},
}
@INPROCEEDINGS{Giesen2007e,
AUTHOR = {Giesen, Joachim},
TITLE = {Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool},
BOOKTITLE = {23d Annual ACM Symposium on Computational Geometry},
PADDRESS = {New York},
ADDRESS = {Gyeongju, South-Korea},
PUBLISHER = {ACM},
YEAR = {2007},
PAGES = {123--124},
}
@ARTICLE{Giesen2008z,
AUTHOR = {Giesen, Joachim},
JOURNAL = {Computational Geometry - Theory and Applications},
TITLE = {The Flow Complex: A Data Structure for Geometric Modeling},
PUBLISHER = {Elsevier},
VOLUME = {39},
YEAR = {2008},
PAGES = {178--190},
}
@ARTICLE{GKMMP06,
AUTHOR = {Gotsman, Craig and Kaligosi, Kanela and Mehlhorn, Kurt and Michail, Dimitrios and Pyrga, Evangelia},
JOURNAL = {Computer Aided Geometric Design},
TITLE = {Cycle Bases of Graphs and Sampled Manifolds},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {8/9},
PUBLISHER = {Elsevier},
MONTH = {December},
VOLUME = {24},
DOI = {10.1016/j.cagd.2006.07.001},
YEAR = {2007},
PAGES = {464},
NOTE = {accepted for publication in Computer Aided Geometric Design journal},
}
@ARTICLE{GKS,
AUTHOR = {Georgiou, Chryssis and Kowalski, Dariusz and Shvartsman, Alexander},
JOURNAL = {Theoretical Computer Science},
TITLE = {Efficient gossip and robust distributed computation},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {1},
PUBLISHER = {Elsevier},
VOLUME = {347},
YEAR = {2005},
PAGES = {130--166},
NOTE = {submitted to journal.
The extended abstract appeared DISC 2003.},
}
@INPROCEEDINGS{GKS-DISC2003,
AUTHOR = {Georgiou, Chryssis and Kowalski, Dariusz and Shvartsman, Alexander},
EDITOR = {Fich, Faith},
TITLE = {Efficient Gossip and Robust Distributed Computation},
BOOKTITLE = {Distributed Computing, 17th International Conference (DISC 2003)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Sorrento, Italy},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2848},
ISBN = {3-540-20184-X},
YEAR = {2003},
PAGES = {224--238},
}
@ARTICLE{GKWahlstroemW2012,
AUTHOR = {Giannopoulos, Panos and Knauer, Christian and Wahlstr{\"o}m, Magnus and Werner, Daniel},
JOURNAL = {Journal of Complexity},
TITLE = {Hardness of discrepancy computation and $\varepsilon$-net verification in high dimension},
ADDRESS = {Amsterdam},
NUMBER = {2},
PUBLISHER = {Elsevier},
VOLUME = {28},
ISBN = {0885-064X},
DOI = {10.1016/j.jco.2011.09.001},
YEAR = {2012},
PAGES = {162--176},
}
@ARTICLE{GnewuchWW12,
AUTHOR = {Gnewuch, Michael and Wahlstr{\"o}m, Magnus and Winzen, Carola},
JOURNAL = {SIAM Journal on Numerical Analysis},
TITLE = {A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting},
ADDRESS = {Philadelphia, PA},
NUMBER = {2},
PUBLISHER = {SIAM},
MONTH = {April},
VOLUME = {50},
ISBN = {1095-7170},
DOI = {10.1137/110833865},
YEAR = {2012},
PAGES = {781--807},
NOTE = {Also available from arxiv.},
ABSTRACT = {We present a new algorithm for estimating the star discrepancy of arbitrary
point
sets. Similar to the algorithm for discrepancy approximation of Winker and Fang
[SIAM J. Numer.
Anal., 34 (1997), pp. 2028–2042] it is based on the optimization algorithm
threshold accepting. Our
improvements include, amongst others, a nonuniform sampling strategy, which is
more suited for
higher-dimensional inputs and additionally takes into account the topological
characteristics of given
point sets, and rounding steps which transform axis-parallel boxes, on which
the discrepancy is to be
tested, into critical test boxes. These critical test boxes provably yield
higher discrepancy values and
contain the box that exhibits the maximum value of the local discrepancy. We
provide comprehensive
experiments to test the new algorithm. Our randomized algorithm computes the
exact discrepancy
frequently in all cases where this can be checked (i.e., where the exact
discrepancy of the point set
can be computed in feasible time). Most importantly, in higher dimensions the
new method behaves
clearly better than all previously known methods.},
}
@INCOLLECTION{GnewuchWW13,
AUTHOR = {Doerr, Carola and Gnewuch, Michael and Wahlstr{\"o}m, Magnus},
EDITOR = {Chen, W.W.L. and Srivastav, A. and Travaglini, G.},
TITLE = {Calculation of Discrepancy Measures and Applications},
BOOKTITLE = {A Panorama of Discrepancy Theory},
CHAPTER = {Calculation of Discrepancy Measures and Applications},
ADDRESS = {New York, NY},
PUBLISHER = {Springer},
EDITION = {2013},
YEAR = {2013},
PAGES = {1--55},
NOTE = {To appear},
ABSTRACT = {In this book chapter we survey known approaches and algorithms to compute
discrepancy measures of
point sets. After providing an introduction which puts the calculation of
discrepancy measures in a more general
context, we focus on the geometric discrepancy measures for which computation
algorithms have been designed.
In particular, we explain methods to determine $L_2$-discrepancies and
approaches to tackle
the inherently difficult problem to calculate the star discrepancy of given
sample sets.
We also discuss in more detail three applications of algorithms to approximate
discrepancies. },
}
@ARTICLE{GoemansSkutella2004,
AUTHOR = {Goemans, Michel X. and Skutella, Martin},
JOURNAL = {Journal of Algorithms},
TITLE = {Cooperative facility location games},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {2},
PUBLISHER = {Elsevier},
MONTH = {February},
VOLUME = {50},
ISBN = {0196-6774},
YEAR = {2004},
PAGES = {194--214},
ABSTRACT = {The location of facilities in order to provide service for customers is a
well-studied problem in
the operations research literature. In the basic model, there is a predefined
cost for opening a facility
and also for connecting a customer to a facility, the goal being to minimize
the total cost. Often,
both in the case of public facilities (such as libraries, municipal swimming
pools, fire stations, ...)
and private facilities (such as distribution centers, switching stations, ...),
we may want to find a
‘fair’ allocation of the total cost to the customers—--this is known as the
cost allocation problem.
A central question in cooperative game theory is whether the total cost can be
allocated to the
customers such that no coalition of customers has any incentive to build their
own facility or to ask a
competitor to service them. We establish strong connections between fair cost
allocations and linear
programming relaxations for several variants of the facility location problem.
In particular, we show
that a fair cost allocation exists if and only if there is no integrality gap
for a corresponding linear
programming relaxation; this was only known for the simplest unconstrained
variant of the facility
location problem. Moreover, we introduce a subtle variant of randomized
rounding and derive new
proofs for the existence of fair cost allocations for several classes of
instances. We also show that it is
in general NP-complete to decide whether a fair cost allocation exists and
whether a given allocation
is fair.},
}
@PROCEEDINGS{GoeseleEtal2003,
AUTHOR = {Goesele, Michael and Kautz, Jan and Lang, Jochen and Lensch, Hendrik P. A. and Seidel, Hans-Peter},
EDITOR = {Sch{\"o}mer, Elmar and Reichel, Joachim and Warken, Thomas and Lennerz, Christian},
TITLE = {7th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual Prototyping},
PADDRESS = {Saarbr{\"u}cken, Germany},
ADDRESS = {Saarbr{\"u}cken, Germany},
PUBLISHER = {Max-Planck-Institut f{\"u}r Informatik},
MONTH = {June},
VOLUME = {T1},
YEAR = {2002},
PAGES = {175},
}
@ARTICLE{GoldbergMacKenziePhilipPatersonSrinivasan2000,
AUTHOR = {Goldberg, Leslie Ann and MacKenzie, Philip D. and Paterson, Mike and Srinivasan, Aravind},
JOURNAL = {Journal of the ACM},
TITLE = {Contention resolution with constant expected delay},
ADDRESS = {New York, USA},
NUMBER = {6},
PUBLISHER = {ACM Press},
VOLUME = {42},
YEAR = {2000},
PAGES = {1048--1096},
}
@ARTICLE{GolinRamanSchwarzSmidSIAMJCOMPUT1998,
AUTHOR = {Golin, Mordecai J. and Raman, Rajeev and Schwarz, Christian and Smid, Michiel},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Randomized Data Structures for the Dynamic Closest-Pair Problem},
NUMBER = {4},
PUBLISHER = {SIAM},
MONTH = {August},
VOLUME = {27},
ISBN = {0097-5397},
YEAR = {1998},
PAGES = {1036--1072},
}
@ARTICLE{GolumbicMR06,
AUTHOR = {Golumbic, Martin Charles and Mintz, Aviad and Rotics, Udi},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees},
NUMBER = {10},
VOLUME = {154},
YEAR = {2006},
PAGES = {1465--1477},
}
@ARTICLE{Goodrich-Ramos97,
AUTHOR = {Goodrich, Michael T. and Ramos, Edgar A.},
JOURNAL = {Discrete and Computational Geometry},
TITLE = {Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming},
VOLUME = {18},
YEAR = {1997},
PAGES = {397--420},
}
@ARTICLE{Govindarajan2007,
AUTHOR = {Govindarajan, Sathish and Dietze, Michael C. and Agarwal, Pankaj K. and Clark, James S.},
JOURNAL = {Journal of Intellingent Information Systems},
TITLE = {A scalable algorithm for dispersing population},
ADDRESS = {Berlin, Germany},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {29},
ISBN = {0925-9902},
DOI = {10.1007/s10844-006-0030-z},
YEAR = {2008},
PAGES = {39--61},
ABSTRACT = {Models of forest ecosystems are needed to understand how climate and land-use
change can impact biodiversity. In this paper we describe an ecological
dispersal model developed for the specific case of predicting seed dispersal by
trees on a landscape for use in a forest simulation model. We present efficient
approximation algorithms for computing seed dispersal. These algorithms allow
us to simulate large landscapes for long periods of time. We also present
experimental results that (1) quantify the inherent uncertainty in the
dispersal model and (2) describe the variation of the approximation error as a
function of the approximation parameters. Based on these experiments, we
provide guidelines for choosing the right approximation parameters, for a given
model simulation. },
}
@INPROCEEDINGS{GPFOGA11,
AUTHOR = {Durrett, Greg and Neumann, Frank and O'Reilly, Una-May},
EDITOR = {Beyer, Hans- Georg and Langdon, William},
TITLE = {Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics},
BOOKTITLE = {FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI},
PADDRESS = {New York, NY},
ADDRESS = {Schwarzenberg, Austria},
PUBLISHER = {ACM},
ISBN = {978-1-4503-0633-1},
DOI = {10.1145/1967654.1967661},
YEAR = {2011},
PAGES = {69--80},
}
@INPROCEEDINGS{Graphlets,
AUTHOR = {Shervashidze, Nino and Vishwanathan, S .V. N. and Petri, Tobias H. and Mehlhorn, Kurt and Borgwardt, Karsten M.},
EDITOR = {van Dyk, David and Welling, Max},
TITLE = {Efficient Graphlet Kernels for Large Graph Comparison},
BOOKTITLE = {Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS)},
PADDRESS = {Cambridge, MA},
ADDRESS = {Clearwater Beach, Florida, USA},
PUBLISHER = {CSAIL},
SERIES = {JMLR: Workshop and Conference Proceedings},
VOLUME = {5},
YEAR = {2009},
PAGES = {488--495},
}
@INPROCEEDINGS{Grove-et-al-1-95a,
AUTHOR = {Awerbuch, Baruch and Azar, Yossi and Grove, Edward and Kao, Ming-Yang and Krishnan, P. and Vitter, Jeffrey Scott},
TITLE = {Load Balancing in the Euclidean Norm},
BOOKTITLE = {36th Annual Symposium on Foundations of Computer Science},
PADDRESS = {Los Alamitos},
ADDRESS = {Milwaukee, Wisconsin, USA},
PUBLISHER = {IEEE},
YEAR = {1995},
PAGES = {383--391},
}
@INPROCEEDINGS{Grove-et-al-1-95b,
AUTHOR = {Chian, Yi-Feng and Goodrich, Michael T. and Grove, Edward and Tamassia, Roberto and Vengroff, Darren Erik and Vitter, Jeffrey Scott},
TITLE = {External-Memory Graph Algorithms},
BOOKTITLE = {6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95)},
PADDRESS = {New York},
ADDRESS = {San Francisco, California, USA},
PUBLISHER = {acm-Press},
YEAR = {1995},
PAGES = {139--149},
}
@INPROCEEDINGS{Grove-et-al-2-95,
AUTHOR = {Barve, Rakesh D. and Grove, Edward and Vitter, Jeffrey Scott},
TITLE = {An Application-Controlled Paging Algorithm for a Shared Cache},
BOOKTITLE = {36th Annual Symposium on Foundations of Computer Science},
PADDRESS = {Los Alamitos},
ADDRESS = {Milwaukee, Wisconsin, USA},
PUBLISHER = {IEEE},
YEAR = {1995},
PAGES = {204--213},
}
@INPROCEEDINGS{Grove-et-al95,
AUTHOR = {Grove, Edward and Kao, Ming-Yang and Krishnan, P. and Vitter, Jeffrey Scott},
EDITOR = {Akl, Selim G. and Dehne, Frank and Sack, J{\"o}rg-R{\"u}diger and Santoro, Nicola},
TITLE = {Online Perfect Matching and Mobile Computing},
BOOKTITLE = {Algorithms and Data Structures: 4th International Workshop (WADS95)},
PADDRESS = {Berlin},
ADDRESS = {Kingston, Canada},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {955},
YEAR = {1995},
PAGES = {194--205},
}
@INPROCEEDINGS{Grove95,
AUTHOR = {Grove, Edward},
TITLE = {On-line Bin Packing with Lookahead},
BOOKTITLE = {6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95)},
PADDRESS = {New York},
ADDRESS = {San Francisco, California, USA},
PUBLISHER = {acm-Press},
YEAR = {1995},
PAGES = {430--436},
}
@INPROCEEDINGS{GSV,
AUTHOR = {Garg, Naveen},
TITLE = {A 3-approximation for the minimum tree spanning with k-vertices},
BOOKTITLE = {Foundations of computer science (FOCS-96) : 37th annual symposium},
PADDRESS = {Los Alamitos, USA},
ADDRESS = {Burlington, USA},
PUBLISHER = {IEEE},
YEAR = {1996},
PAGES = {302--309},
}
@INPROCEEDINGS{GuentherKM2010,
AUTHOR = {G{\"u}nther, Elisabeth and K{\"o}nig, Felix and Megow, Nicole},
EDITOR = {Bampis, Evripidis and Jansen, Klaus},
TITLE = {Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width},
BOOKTITLE = {Approximation and Online Algorithms : 7th International Workshop, WAOA 2009},
PADDRESS = {Berlin},
ADDRESS = {Copenhagen, Denmark},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5893},
ISBN = {978-3-642-12449-5},
DOI = {10.1007/978-3-642-12450-1_16},
YEAR = {2010},
PAGES = {170--181},
}
@MASTERSTHESIS{Guillaume97,
AUTHOR = {Guillaume, Frank},
TITLE = {{Praktisches Paralleles Paralleles List Ranking}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1997},
}
@INPROCEEDINGS{Gunopulos-et-al97,
AUTHOR = {Gunopulos, Dimitrios and Mannila, Heikki and Saluja, Sanjeev},
EDITOR = {Afrati, Foto and Kolaitis, Photokion},
TITLE = {Discovering all most specific sentences by randomized algorithms},
BOOKTITLE = {Proceedings of the 6th International Conference on Database Theory (ICDT-97)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Delphi, Greece},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1186},
YEAR = {1997},
PAGES = {215--229},
}
@INPROCEEDINGS{Gupta-et-al95,
AUTHOR = {Gupta, Prosenjit and Janardan, Ravi and Smid, Michiel and Dasgupta, Bhaskar},
TITLE = {The rectangle enclosure and point-dominance problems revisited},
BOOKTITLE = {11th Annual ACM Symposium on Computing Geometry},
PADDRESS = {-},
ADDRESS = {-},
PUBLISHER = {-},
YEAR = {1995},
PAGES = {162--171},
}
@ARTICLE{Gupta-Janardan-Smid-1-95,
AUTHOR = {Gupta, Prosenjit and Janardan, Ravi and Smid, Michiel},
JOURNAL = {Journal of Algorithms},
TITLE = {Further results on generalized intersection searching problems:
counting, reporting, and dynamization},
NUMBER = {2},
PUBLISHER = {Academic Press},
VOLUME = {19},
ISBN = {0196-6774},
YEAR = {1995},
PAGES = {282--317},
}
@INPROCEEDINGS{Gupta-Janardan-Smid-2-95,
AUTHOR = {Gupta, Prosenjit and Janardan, Ravi and Smid, Michiel},
TITLE = {The rectangle enclosure and point-dominance problems revisited},
BOOKTITLE = {11th Annual !CM Symposium on Computational Geometry},
PADDRESS = {New York},
ADDRESS = {Vancouver, British Columbia, Canada},
PUBLISHER = {acm-Press},
YEAR = {1995},
PAGES = {162--171},
}
@ARTICLE{GuptaJanardanSmid96a-1,
AUTHOR = {Gupta, Prosenjit and Janardan, Ravi and Smid, Michiel},
JOURNAL = {Computational Geometry},
TITLE = {Algorithms for generalized halfspace range searching and other intersection searching problems},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {6},
PUBLISHER = {Elsevier},
VOLUME = {5},
ISBN = {0925-7721},
YEAR = {1996},
PAGES = {321--340},
ABSTRACT = {In a generalized intersection searching problem, a set S of colored geometric
objects is to be preprocessed so that, given a query object q, the distinct
colors of the objects of S that are intersected by q can be reported or counted
efficiently. These problems generalize the well-studied standard intersection
searching problems and have many applications. Unfortunately, the solutions
known for the standard problems do not yield efficient solutions to the
generalized problems. Recently, efficient solutions have been given for
generalized problems where the input and query objects are iso-oriented (i.e.,
axes-parallel) or where the color classes satisfy additional properties (e.g.,
connectedness). In this paper, efficient algorithms are given for several
generalized problems involving objects that are not necessarily iso-oriented.
These problems include: generalized halfspace range searching in , for any
fixed d ≥ 2, and segment intersection searching, triangle stabbing, and
triangle range searching in for certain classes of line segments and triangles.
The techniques used include: computing suitable sparse representations of the
input, persistent data structures, and filtering search. },
}
@ARTICLE{GuptaJanardanSmid96a-2,
AUTHOR = {Gupta, Prosenjit and Janardan, Ravi and Smid, Michiel},
JOURNAL = {Computational Geometry},
TITLE = {Algorithms for generalized halfspace range searching and other intersection searching problems},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {1},
PUBLISHER = {Elsevier},
VOLUME = {6},
ISBN = {0925-7721},
YEAR = {1996},
PAGES = {1--19},
ABSTRACT = {In a generalized intersection searching problem, a set S of colored geometric
objects is to be preprocessed so that, given a query object q, the distinct
colors of the objects of S that are intersected by q can be reported or counted
efficiently. These problems generalize the well-studied standard intersection
searching problems and have many applications. Unfortunately, the solutions
known for the standard problems do not yield efficient solutions to the
generalized problems. Recently, efficient solutions have been given for
generalized problems where the input and query objects are iso-oriented (i.e.,
axes-parallel) or where the color classes satisfy additional properties (e.g.,
connectedness). In this paper, efficient algorithms are given for several
generalized problems involving objects that are not necessarily iso-oriented.
These problems include: generalized halfspace range searching in , for any
fixed d ≥ 2, and segment intersection searching, triangle stabbing, and
triangle range searching in for certain classes of line segments and triangles.
The techniques used include: computing suitable sparse representations of the
input, persistent data structures, and filtering search. },
}
@ARTICLE{GuptaJanardanSmid96b,
AUTHOR = {Gupta, Prosenjit and Janardan, Ravi and Smid, Michiel},
JOURNAL = {Computational Geometry},
TITLE = {Fast algorithms for collision and proximity problems involving moving geometric objects},
ADDRESS = {Amsterdam, The Netherlands},
PUBLISHER = {Elsevier},
VOLUME = {6},
ISBN = {0925-7721},
YEAR = {1996},
PAGES = {371--391},
}
@ARTICLE{GuptaJanardanSmid99,
AUTHOR = {Gupta, Prosenjit and Janardan, Ravi and Smid, Michiel},
JOURNAL = {Information Processing Letters},
TITLE = {Efficient algorithms for counting and reporting pairwise intersections between convex polygons},
NUMBER = {1},
MONTH = {January},
VOLUME = {69},
YEAR = {1999},
PAGES = {7--13},
}
@ARTICLE{GuptaJanardanSmidDasgupta1997,
AUTHOR = {Gupta, Prosenjit and Janardan, Ravi and Smid, Michiel and Dasgupta, Bhaskar},
JOURNAL = {International Journal of Computational Geometry and Applications},
TITLE = {The rectangle enclosure and point-dominance problems revisited},
NUMBER = {5},
VOLUME = {7},
YEAR = {1997},
PAGES = {437--456},
}
@INPROCEEDINGS{GuptaKallerMahajanShermer96,
AUTHOR = {Gupta, Arvind and Kaller, Damon and Mahajan, Sanjeev and Shermer, Thomas C.},
EDITOR = {Karlsson, Rolf and Lingas, Andrzej},
TITLE = {Vertex partitioning problems on partial k-trees},
BOOKTITLE = {Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory},
PADDRESS = {Berlin},
ADDRESS = {Reykjavik, Iceland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1097},
YEAR = {1996},
PAGES = {161--172},
}
@ARTICLE{GuptaMahajan1997,
AUTHOR = {Gupta, Arvind and Mahajan, Sanjeev},
JOURNAL = {Computational Complexity},
TITLE = {Using amplification to compute majority with small majority gates},
NUMBER = {1},
VOLUME = {6},
YEAR = {1997},
PAGES = {46--63},
}
@ARTICLE{Gurvich77,
AUTHOR = {Gurvich, Vladimir},
JOURNAL = {Uspekhi Mat. Nauk. (Russian Math. Surveys)},
TITLE = {On repetition-free Boolean functions},
VOLUME = {32},
YEAR = {1977},
PAGES = {183--184},
NOTE = {(in Russian)},
}
@ARTICLE{Gurvich91,
AUTHOR = {Gurvich, Vladimir},
JOURNAL = {Soviet Math. Dokl.},
TITLE = {Criteria for repetition-freeness of functions in the algebra of logic},
NUMBER = {3},
VOLUME = {43},
YEAR = {1991},
PAGES = {721--726},
}
@MASTERSTHESIS{Gutwenger1999,
AUTHOR = {Gutwenger, Carsten},
TITLE = {{Design und Implementierung einer Algorithmen-Bibliothek zum Zeichnen von Graphen}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {May},
YEAR = {1999},
}
@INPROCEEDINGS{GutwengerMutzel1998,
AUTHOR = {Gutwenger, Carsten and Mutzel, Petra},
EDITOR = {Whitesides, Sue H.},
TITLE = {Planar Polyline Drawings with Good Angular Resolution},
BOOKTITLE = {Proceedings of the 6th International Symposium on Graph Drawing (GD-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Montreal, Canada},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1547},
ISBN = {3-540-65473-9},
YEAR = {1998},
PAGES = {167--182},
}
@INPROCEEDINGS{h-cap-01,
AUTHOR = {Hert, Susan},
TITLE = {Connected Area Partitioning},
BOOKTITLE = {Proceedings of the 17th European Workshop on Computational Geometry (CG-01)},
TYPE = {Extended Abstract},
PADDRESS = {Berlin, Germany},
ADDRESS = {Berlin, Germany},
PUBLISHER = {Freie Universit{\"a}t Berlin},
MONTH = {March},
YEAR = {2001},
PAGES = {35--38},
ABSTRACT = {We present an algorithm to solve the following polygon partitioning
problem, which is motivated by a terrain-covering application in robotics:
Given a simply connected polygon $\cal P$ and values
\subrange{a}{1}{p+1} such that $\sum_{i = 1}^{p+1} a_i = Area({\cal P})$,
find a partitioning of $\cal P$ into $p+1$ polygons \subrange{P}{1}{p+1}
such that $Area(P_i) = a_i$ for all $i$ and polygon $P_{p+1}$ is connected
to each of the other polygons. The algorithm we present runs in
$O(n + q \log q + pn)$ time for a polygon with $n$ vertices that has
been partitioned into $q$ convex pieces.},
}
@MASTERSTHESIS{Hachenberger1999,
AUTHOR = {Hachenberger, Peter},
TITLE = {Dynamic shortest Path Algorithms for Planar and Outerplanar Graphs},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {August},
YEAR = {1999},
}
@INPROCEEDINGS{HachenbergerKettner2005Nef,
AUTHOR = {Hachenberger, Peter and Kettner, Lutz},
EDITOR = {Kobbelt, Leif and Shapiro, Vadim},
TITLE = {Boolean Operations on 3D Selective {Nef} Complexes: Optimized Implementation and Experiments},
BOOKTITLE = {ACM Symposium on Solid and Physical Modeling (SPM 2005)},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Cambridge, MA, USA},
PUBLISHER = {ACM},
MONTH = {June},
ISBN = {1-59593-015-9},
YEAR = {2005},
PAGES = {163--174},
ABSTRACT = {Nef polyhedra in $d$-dimensional space are the closure of
half-spaces under boolean set operation. In consequence, they can
represent non-manifold situations, open and closed sets,
mixed-dimensional complexes and they are closed under all boolean
and topological operations, such as complement and boundary. They
were introduced by W. Nef in his seminal 1978 book on polyhedra.
We presented in previous work a new data structure for the boundary
representation of three-dimensional Nef polyhedra with
efficient algorithms for boolean operations. These algorithms were
designed for correctness and can handle all cases, in particular all
\emph{degeneracies}. To this extent we rely on exact
arithmetic to avoid well known problems with floating-point
arithmetic.
In this paper, we present important optimizations for the
algorithms. We describe the chosen implementations for the
point-location and the intersection-finding subroutines, a kd-tree
and a fast box-intersection algorithm, respectively. We evaluate
this optimized implementation with extensive experiments that
supplement the runtime analysis from our previous paper and that
illustrate the effectiveness of our optimizations. We compare our
implementation with the \textsc{Acis} CAD kernel and demonstrate the power and
cost of the exact arithmetic in near-degenerate situations.
The implementation was released as Open Source in the
\textsc{Cgal} release 3.1 in December 2004.},
}
@INPROCEEDINGS{Hagedoorn2000:nvpapm,
AUTHOR = {Hagedoorn, Michiel and Overmars, Mark H. and Veltkamp, Remco},
EDITOR = {Borgefors, G and Nystrom, I and Sanniti di Baja, G},
TITLE = {A New Visibility Partition for Affine Pattern Matching},
BOOKTITLE = {Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00)},
ORGANIZATION = {Swedish Society for Automated Image Analysis, International Association for Pattern Recognition},
PADDRESS = {Berlin, Germany},
ADDRESS = {Uppsala, Sweden},
PUBLISHER = {Springer},
MONTH = {December},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1953},
ISBN = {0302-9743},
YEAR = {2000},
PAGES = {358--370},
}
@INPROCEEDINGS{Hagedoorn2003:nncbfe,
AUTHOR = {Hagedoorn, Michiel},
EDITOR = {Calvanese, Diego and Lenzerini, Maurizio and Motwani, Rajeev},
TITLE = {Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size},
BOOKTITLE = {Database Theory - ICDT 2003 : 9th International Conference},
PADDRESS = {New York, USA},
ADDRESS = {Siena, Italy},
PUBLISHER = {Springer},
MONTH = {January},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2572},
ISBN = {3-540-00323-1},
YEAR = {2003},
PAGES = {440--454},
}
@ARTICLE{Hagerup-1-95,
AUTHOR = {Hagerup, Torben},
JOURNAL = {Information and Computation},
TITLE = {A Lower Bound for the Emulation of PRAM Memories on Processor Networks},
NUMBER = {1},
PUBLISHER = {Academic Press},
VOLUME = {119},
ISBN = {0890-5401},
YEAR = {1995},
PAGES = {124--128},
}
@ARTICLE{Hagerup-2-95,
AUTHOR = {Hagerup, Torben},
JOURNAL = {Journal of Algorithms},
TITLE = {Fast Deterministic Processor Allocation},
NUMBER = {3},
PUBLISHER = {Academic Press},
VOLUME = {18},
ISBN = {0196-6774},
YEAR = {1995},
PAGES = {629--649},
}
@ARTICLE{Hagerup-3-95,
AUTHOR = {Hagerup, Torben},
JOURNAL = {Information Processing Letters},
TITLE = {The Parallel Complexity of Integer Prefix Summation},
NUMBER = {1},
PUBLISHER = {Elsevier},
VOLUME = {56},
ISBN = {0020-0190},
YEAR = {1995},
PAGES = {59--64},
}
@ARTICLE{Hagerup-97b,
AUTHOR = {Hagerup, Torben},
JOURNAL = {Journal of Parallel and Distributed Computing},
TITLE = {Allocating Independent Tasks to Parallel Processors: An Experimental Study},
NUMBER = {2},
VOLUME = {47},
YEAR = {1997},
PAGES = {185--197},
}
@INPROCEEDINGS{Hagerup-et-al-1-95,
AUTHOR = {Andersson, Arne and Hagerup, Torben and Nilsson, Stefan and Raman, Rajeev},
TITLE = {Sorting in Linear Time?},
BOOKTITLE = {27th Annual ACM Symposium on Theory of Computing (STOC95)},
PADDRESS = {New York},
ADDRESS = {Las Vegas, Nevada, USA},
PUBLISHER = {acm-Press},
YEAR = {1995},
PAGES = {427--436},
}
@INPROCEEDINGS{Hagerup-et-al-1-96,
AUTHOR = {Hagerup, Torben},
EDITOR = {Ferreira, Afonso and Rolim, Jos{\'e} and Saad, Youssef and Yang, Tao},
TITLE = {Allocating Independent Tasks to Parallel Processors: An Experimental Study},
BOOKTITLE = {Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96)},
PADDRESS = {Berlin},
ADDRESS = {Santa Barbara},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1117},
YEAR = {1996},
PAGES = {1--33},
}
@INPROCEEDINGS{Hagerup-et-al-2-95,
AUTHOR = {Hagerup, Torben and Katajainen, Jyrki and Nishimura, Naomi and Ragde, Prabhakar},
TITLE = {Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees},
BOOKTITLE = {6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95)},
PADDRESS = {New York},
ADDRESS = {San Francisco, California, USA},
PUBLISHER = {asm-Press},
YEAR = {1995},
PAGES = {641--649},
}
@INPROCEEDINGS{Hagerup-et-al95,
AUTHOR = {Berthom{\'e}, P. and Duboux, T. and Hagerup, Torben and Newman, I. and Schuster, Assaf},
EDITOR = {Spirakis, Paul},
TITLE = {Self-Simulation for the Passive Optical Star Model},
BOOKTITLE = {Algorithms-ESA'95: 3rd Annual European Symposium},
PADDRESS = {Berlin},
ADDRESS = {Corfu, Greece},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {979},
YEAR = {1995},
PAGES = {268--380},
}
@ARTICLE{Hagerup-et-al97,
AUTHOR = {Dietzfelbinger, Martin and Hagerup, Torben and Katajainen, Jyrki and Penttonen, Martti},
JOURNAL = {Journal of Algorithms},
TITLE = {A reliable randomized algorithm for the closest-pair problem},
NUMBER = {1},
VOLUME = {25},
YEAR = {1997},
PAGES = {19--51},
}
@ARTICLE{Hagerup-Keller95,
AUTHOR = {Hagerup, Torben and Keller, J{\"o}rg},
JOURNAL = {Parallel Processing Letters},
TITLE = {Fast Parallel Permutation Algorithms},
NUMBER = {2},
VOLUME = {5},
YEAR = {1995},
PAGES = {139--148},
}
@ARTICLE{Hagerup-Kutylowski97,
AUTHOR = {Hagerup, Torben and Kutylowski, Miroslaw},
JOURNAL = {Algorithmica},
TITLE = {Fast integer merging on the EREW PRAM},
VOLUME = {17},
YEAR = {1997},
PAGES = {55--66},
}
@ARTICLE{Hagerup00,
AUTHOR = {Hagerup, Torben},
JOURNAL = {Information and Computation},
TITLE = {Parallel preprocessing for path queries without concurrent reading},
ADDRESS = {San Diego, USA},
NUMBER = {1},
PUBLISHER = {Academic Press},
MONTH = {April},
VOLUME = {158},
ISBN = {0890-5401},
YEAR = {2000},
PAGES = {18--28},
}
@ARTICLE{Hagerup2000a,
AUTHOR = {Hagerup, Torben},
JOURNAL = {Algorithmica},
TITLE = {Dynamic algorithms for graphs of bounded treewidth},
ADDRESS = {New York, USA},
NUMBER = {3/4},
PUBLISHER = {Springer},
VOLUME = {27},
ISBN = {0178-4617},
YEAR = {2000},
PAGES = {292--315},
ABSTRACT = {The formalism of monadic second-order (MS) logic has been very successful in
unifying a large number of algorithms for graphs of bounded treewidth. We
extend the elegant framework of MS logic from static problems to dynamic
problems, in which queries about MS properties of a graph of bounded treewidth
are interspersed with updates of vertex and edge labels. This allows us to
unify and occasionally strengthen a number of scattered previous results
obtained in an ad hoc manner and to enable solutions to a wide range of
additional problems to be
derived automatically.
As an auxiliary result of independent interest, we dynamize a data structure
of Chazelle for answering queries about products of labels along paths in a
tree with edges labeled by elements of a semigroup.},
}
@INPROCEEDINGS{Hagerup97a,
AUTHOR = {Hagerup, Torben},
EDITOR = {Degano, Pierpaolo and Gorrieri, Roberto and Marchetti-Spaccamela, Alberto},
TITLE = {Dynamic algorithms for graphs of bounded treewidth},
BOOKTITLE = {Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97)},
PADDRESS = {Berlin},
ADDRESS = {Bologna, Italy},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1256},
YEAR = {1997},
PAGES = {292--302},
}
@INPROCEEDINGS{Hagerup98,
AUTHOR = {Hagerup, Torben},
EDITOR = {Morvan, Michel and Meinel, Christoph and Krob, Daniel},
TITLE = {Sorting and Searching on the Word RAM},
BOOKTITLE = {Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Paris, France},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1373},
ISBN = {3-540-64230-7},
YEAR = {1998},
PAGES = {366--398},
}
@INPROCEEDINGS{HagerupICAL98,
AUTHOR = {Hagerup, Torben},
EDITOR = {Larsen, Kim G. and Skyum, Sven},
TITLE = {Simpler and Faster Dictionaries on the AC° RAM},
BOOKTITLE = {Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Aalborg, Denmark},
PUBLISHER = {Springer},
MONTH = {July},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1443},
ISBN = {0302-9743},
YEAR = {1998},
PAGES = {79--90},
}
@INPROCEEDINGS{HagSanTra98,
AUTHOR = {Hagerup, Torben and Sanders, Peter and Tr{\"a}ff, Jesper Larsson},
EDITOR = {Mehlhorn, Kurt},
TITLE = {An Implementation of the Binary Blocking Flow Algorithm},
BOOKTITLE = {Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98)},
PADDRESS = {Saarbr{\"u}cken, Germany},
ADDRESS = {Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-98-1-019},
PUBLISHER = {Max-Planck-Institut f{\"u}r Informatik},
MONTH = {August},
YEAR = {1998},
PAGES = {143--154},
}
@INPROCEEDINGS{HaJaPS11,
AUTHOR = {Harren, Rolf and Jansen, Klaus and Pr{\"a}del, Lars and van Stee, Rob},
EDITOR = {Dehne, Frank and Iacono, John and Sack, J{\"o}rg-R{\"u}diger},
TITLE = {A (5/3 + $\varepsilon$)-Approximation for Strip Packing},
BOOKTITLE = {Algorithms and Data Structures : 12th International Symposium, WADS 2011},
PADDRESS = {New York, NY},
ADDRESS = {New York, NY},
PUBLISHER = {Springer},
MONTH = {August},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6844},
ISBN = {978-3-642-22299-3},
DOI = {10.1007/978-3-642-22300-6_40},
YEAR = {2011},
PAGES = {475--487},
ABSTRACT = {We study strip packing, which is one of the most classical two-dimensional
packing problems: given a collection of rectangles, the problem is to find a
feasible orthogonal packing without rotations into a strip of width $1$ and
minimum height. In this paper we present an approximation algorithm for the
strip packing problem with absolute approximation ratio of $5/3+\eps$ for any
$\eps>0$. This result significantly narrows the gap between the best known
upper bound and the lower bound of $3/2$; previously, the best upper bound was
$1.9396$ due to Harren and van Stee.},
}
@INPROCEEDINGS{HallHipplerSkutella2003,
AUTHOR = {Hall, Alex and Hippler, Steffen and Skutella, Martin},
EDITOR = {Baeten, Jos C.M. and Lenstra, Jan Karel and Parrow, Joachim and Woeginger, Gerhard J.},
TITLE = {Multicommodity Flows Over Time: Efficient Algorithms and Complexity},
BOOKTITLE = {Automata, languages and programming : 30th International Colloquium, ICALP 2003},
PADDRESS = {Berlin, Germany},
ADDRESS = {Eindhoven, The Netherlands},
PUBLISHER = {Springer},
MONTH = {June},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2719},
ISBN = {3-540-40493-7},
YEAR = {2003},
PAGES = {397--409},
ABSTRACT = { Flow variation over time is an important feature in network flow
problems arising in various applications such as road or air traffic
control, production systems, communication networks (e.g., the
Internet), and financial flows. The common characteristic are
networks with capacities and transit times on the arcs which specify
the amount of time it takes for flow to travel through a particular
arc. Moreover, in contrast to static flow problems, flow values on
arcs may change with time in these networks.
While the `maximum $s$-$t$-flow over time' problem can be solved
efficiently and `min-cost flows over time' are known to be NP-hard,
the complexity of (fractional) `multicommodity flows over time' has
been open for many years. We prove that this problem is NP-hard,
even for series-parallel networks, and present new and efficient
algorithms under certain assumptions on the transit times or on the
network topology. As a result, we can draw a complete picture of
the complexity landscape for flow over time problems.},
}
@INPROCEEDINGS{HallLangkauSkutella2003,
AUTHOR = {Hall, Alex and Langkau, Katharina and Skutella, Martin},
EDITOR = {Arora, Sanjeev and Jansen, Klaus and Rolim, Jose D. P. and Sahai, Amit},
TITLE = {An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times},
BOOKTITLE = {Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003},
PADDRESS = {Berlin, Germany},
ADDRESS = {Princeton, USA},
PUBLISHER = {Springer},
MONTH = {August},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2764},
ISBN = {3-540-40770-7},
YEAR = {2003},
PAGES = {71--82},
ABSTRACT = { Given a network with capacities and transit times on the arcs, the
quickest flow problem asks for a `flow over time' that satisfies
given demands within minimal time. In the setting of flows over
time, flow on arcs may vary over time and the transit time of an arc
is the time it takes for flow to travel through this arc. In most
real-world applications (such as, e.g., road traffic, communication
networks, production systems, etc.), transit times are not fixed but
depend on the current flow situation in the network. We consider
the model where the transit time of an arc is given as a
nondecreasing function of the rate of inflow into the arc. We prove
that the quickest $s$-$t$-flow problem is NP-hard in this setting
and give various approximation results, including an FPTAS for the
quickest multicommodity flow problem with bounded cost.},
}
@MASTERSTHESIS{Hammerschmidt1999,
AUTHOR = {Hammerschmidt, Frank},
TITLE = {{Konzeption und Entwicklung des streng strukturierten und erweiterbaren Datentyps html_page f{\"u}r LEDA}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {November},
YEAR = {1999},
}
@INPROCEEDINGS{Happ2008,
AUTHOR = {Doerr, Benjamin and Happ, Edda and Klein, Christian},
EDITOR = {Ryan, Conor and Keijzer, Maarten},
TITLE = {Crossover Can Provably be Useful in Evolutionary Computation},
BOOKTITLE = {Genetic and Evolutionary Computation Conference 2008},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Atlanta, USA},
PUBLISHER = {ACM},
SERIES = {Proceedings of the 10th annual conference on Genetic and evolutionary computation},
ISBN = {978-1-60558-130-9},
YEAR = {2008},
PAGES = {539--546},
NOTE = {Best paper award},
}
@INPROCEEDINGS{HappJohannsenKleinNeumann2008a,
AUTHOR = {Happ, Edda and Johannsen, Daniel and Klein, Christian and Neumann, Frank},
EDITOR = {Ryan, Conor and Keijzer, Maarten},
TITLE = {Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions},
BOOKTITLE = {Genetic and Evolutionary Computation Conference 2008},
ORGANIZATION = {Association for Computing Machinery (ACM)},
PADDRESS = {New York, USA},
ADDRESS = {Atlanta, USA},
PUBLISHER = {ACM},
ISBN = {978-1-60558-130-9},
DOI = {http://doi.acm.org/10.1145/1389095.1389277},
YEAR = {2008},
PAGES = {953--960},
ABSTRACT = {Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate
algorithms that use elitist selection methods. Two algorithms commonly studied
are Randomized Local Search (RLS) and the (1+1)~EA and it is well known that
both optimize any linear pseudo-Boolean function on $n$ bits within an expected
number of $\ensuremath{{O}}(n \log n)$ fitness evaluations. In this paper, we
analyze variants of these algorithms that use fitness proportional selection.
A well-known method in analyzing the local changes in the solutions of RLS is a
reduction to the gambler's ruin problem. We extend this method in order to
analyze the global changes imposed by the (1+1)~EA. By applying this new
technique we show that with high probability using fitness proportional
selection
leads to an exponential optimization time for any linear pseudo-Boolean
function with non-zero weights. Even worse, all solutions of the algorithms
during an exponential number of fitness evaluations differ with high
probability in linearly many bits from the optimal solution.
Our theoretical studies are complemented by experimental investigations which
confirm the asymptotic results on realistic input sizes.},
}
@PHDTHESIS{HappPhD2009,
AUTHOR = {Happ, Edda},
TITLE = {Analyses of Evolutionary Algorithms},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
ADDRESS = {Saarbr{\"u}cken},
PUBLISHER = {Universit{\"a}t des Saarlandes},
YEAR = {2009},
}
@ARTICLE{Hariharan-et-al95,
AUTHOR = {Cole, Richard and Hariharan, Ramesh and Paterson, Mike and Zwick, Uri},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Tighter Lower Bounds on the Exact Complexity of String Matching},
NUMBER = {1},
PUBLISHER = {Society for Industrial and Applied Mathematics},
VOLUME = {24},
ISBN = {0097-5397},
YEAR = {1995},
PAGES = {30--45},
}
@ARTICLE{Hariharan-Kapoor95,
AUTHOR = {Hariharan, Ramesh and Kapoor, Sanjiv},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Algorithms for Enumerating all Spanning Trees of an Undirected Graph},
NUMBER = {2},
PUBLISHER = {Society for Industrial and Applied Mathematics},
VOLUME = {24},
ISBN = {0097-5397},
YEAR = {1995},
PAGES = {247--265},
}
@INPROCEEDINGS{Hariharan-Kelsen-Mahajan96,
AUTHOR = {Hariharan, Ramesh and Kelsen, Pierre and Mahajan, Sanjeev},
EDITOR = {Karlsson, Rolf and Lingas, Andrzej},
TITLE = {Coloring 2-colorable hypergraphs with a sublinear number of colors},
BOOKTITLE = {Scandinavian Workshop on Algorithm Theory (SWAT96)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Reykjavik, Iceland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1097},
YEAR = {1996},
PAGES = {41--52},
}
@INPROCEEDINGS{Hariharan-Mahajan95,
AUTHOR = {Hariharan, Ramesh and Mahajan, Sanjeev},
TITLE = {Derandomizing semidefinite programming based approximation algorithms},
BOOKTITLE = {36th IEEE Symposium on Foundations of Computer Science},
PADDRESS = {-},
ADDRESS = {-},
PUBLISHER = {-},
YEAR = {1995},
PAGES = {162--16},
}
@ARTICLE{Hariharan-Muthukrishnan95,
AUTHOR = {Hariharan, Ramesh and Muthukrishnan, S.},
JOURNAL = {Information and Computation},
TITLE = {String Matching over a General Matching Relation},
NUMBER = {1},
PUBLISHER = {Academic Press},
VOLUME = {122},
ISBN = {0890-5401},
YEAR = {1995},
PAGES = {140--148},
}
@INPROCEEDINGS{HarKer11,
AUTHOR = {Harren, Rolf and Kern, Walter},
EDITOR = {Solis-Oba, Roberto and Persiano, Giuseppe},
TITLE = {Improved Lower Bound for Online Strip Packing},
BOOKTITLE = {Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011},
PADDRESS = {Berlin},
ADDRESS = {Saarbruecken, Germany},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7164},
ISBN = {978-3-642-29115-9},
DOI = {10.1007/978-3-642-29116-6_18},
YEAR = {2012},
PAGES = {211--218},
}
@ARTICLE{HarksHKS2013,
AUTHOR = {Harks, Tobias and Hoefer, Martin and Klimm, Max and Skopalik, Alexander},
JOURNAL = {Mathematical Programming},
TITLE = {Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games},
NUMBER = {1-2},
VOLUME = {141},
YEAR = {2013},
PAGES = {193--215},
}
@INPROCEEDINGS{Harren2006a,
AUTHOR = {Harren, Rolf},
EDITOR = {Bugliesi, M. and Preneel, B. and Sassone, V. and Wegener, I.},
TITLE = {Approximating the Orthogonal Knapsack Problem for Hypercubes},
BOOKTITLE = {Automata, Languages and Programming},
PADDRESS = {Berlin / Heidelberg},
ADDRESS = {Venice, Italy},
NUMBER = {1},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4051},
ISBN = {978-3-540-35904-3},
DOI = {10.1007/11786986_22},
YEAR = {2006},
PAGES = {238--249},
ABSTRACT = {Given a list of $d$-dimensional cuboid items with associated profits, the
\emph{orthogonal knapsack problem} asks for a packing of a selection with
maximal profit into the unit cube. We restrict the items to hypercube shapes
and derive a $(\frac{5}{4}+\epsilon)$-approximation for the two-dimensional
case. In a second step we generalize our result to a
$(\frac{2^d+1}{2^d}+\epsilon)$-approximation for $d$-dimensional packing.},
}
@MASTERSTHESIS{Harren2006b,
AUTHOR = {Harren, Rolf},
TITLE = {{Approximation mehrdimensionaler Packungsprobleme}},
SCHOOL = {Universit{\"a}t Dortmund},
TYPE = {Diploma thesis},
MONTH = {December},
YEAR = {2006},
ABSTRACT = {Orthogonal packing problems are natural multidimensional generalizations of the
classical \probname{Bin Packing Problem} and \probname{Knapsack Problem} and
occur in many different settings. The input consists of a set $I=\{r_1, \ldots,
r_n\}$ of $d$-dimensional rectangular items $r_i = (a_{i1}, \ldots, a_{id})$
and a space $B$. The task is to pack the items in an orthogonal,
non-rotational, non-overlapping manner into the given space. In the
\probname{Bin Packing} setting the space $B$ is an unlimited number of unit
sized bins and the goal is to minimize the number of used bins in order to pack
the whole list of items. In the \probname{Strip Packing} setting the space $B$
is given by a strip of bounded basis and unlimited height. The objective is to
pack all items into a strip of minimal height. Finally, in the
\probname{Knapsack Packing} setting the given space $B$ is a single, usually
unit sized bin and the items have an associated profit $p_i$. The goal is to
maximize the profit of a selection of items that can be packed into the bin.
In this thesis we present state-of-the-art algorithms for two-dimensional
\probname{Strip Packing} \cite{KenyonRemila2000} and \probname{Knapsack Packing
with large resources} \cite{FishkinGerberJansen2004} as well as for
multidimensional \probname{Bin Packing for hypercubes}
\cite{BansalCorreaKenyonSviridenko2005}. Furthermore, we describe our own
results on orthogonal packing problems restricted to hypercubes, i.e., a
$(\frac{5}{4}+\epsilon)$-approximation algorithm for \probname{Square Packing},
a $(\frac{2^d+1}{2^d}+\epsilon)$-approximation algorithm for $d$-dimensional
\probname{Knapsack Packing for hypercubes} and asymptotic polynomial time
approximation schemes (\complexity{APTAS}) for $d$-dimensional \probname{Strip
Packing for hypercubes} as well as for $d$-dimensional \probname{Knapsack
Packing with large Resources for hypercubes}. All of these results were
published in \cite{Harren2006} but especially for the latter two approximation
schemes no details were given due to page limitations.},
}
@INPROCEEDINGS{Harren2007,
AUTHOR = {Diedrich, Florian and Harren, Rolf and Jansen, Klaus and Th{\"o}le, Ralf and Thomas, Henning},
EDITOR = {Cai, Jin-Yi and Cooper, S. Barry and Zhu, Hong},
TITLE = {Approximation Algorithms for 3D Orthogonal Knapsack},
BOOKTITLE = {Theory and Applications of Models of Computation},
PADDRESS = {Berlin / Heidelberg},
ADDRESS = {Shanghai, China},
PUBLISHER = {Springer},
MONTH = {May},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4484},
ISBN = {978-3-540-72503-9},
DOI = {10.1007/978-3-540-72504-6_3},
YEAR = {2007},
PAGES = {34--45},
ABSTRACT = {We study non-overlapping axis-parallel packings of 3D boxes with profits into a
dedicated bigger box where rotation is forbidden; we wish to maximize the total
profit. Since this optimization problem is NP-hard, we focus on approximation
algorithms. We obtain fast and simple algorithms with approximation ratios
$9+\epsilon$ and $8+\epsilon$ as well as an algorithm with approximation ratio
$7+\epsilon$ that uses more sophisticated techniques; these are the smallest
approximation ratios known for this problem.},
}
@BOOK{Harren2007b,
AUTHOR = {Harren, Rolf},
TITLE = {{Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer Packungsprobleme}},
ADDRESS = {Saarbr{\"u}cken, Germany},
PUBLISHER = {VDM Verlag Dr. M{\"u}ller},
MONTH = {November},
ISBN = {978-3836446891},
YEAR = {2007},
PAGES = {66},
ABSTRACT = {Das Rucksackproblem ist eines der grundlegenden Probleme der Informatik. Die in
diesem Buch betrachtete Variante l{\"a}sst sich leicht anhand einer allt{\"a}glichen
Situation beschreiben: Wie finde ich eine Auswahl an Gegenst{\"a}nden, die sich
gemeinsam in meinen Rucksack packen lassen und mir bei meiner Reise den
gr{\"o}{\ss}tm{\"o}glichen Nutzen bringen? In der kombinatorischen Optimierung beschr{\"a}nkt
man sich auf rechteckige Gegenst{\"a}nde und Rucks{\"a}cke. Anwendungen finden sich bei
Schnittproblemen - hier werden Objekte aus einem Materialblock
herausgeschnitten - sowie in der Transportindustrie.
Der Autor gibt einf{\"u}hrend einen {\"U}berblick {\"u}ber die verschiedenen
Verallgemeinerungen klassischer Packungsprobleme. Dies sind neben dem
Rucksackproblem auch das Aufteilungs- sowie ein Stapelungsproblem. Nach einer
ausf{\"u}hrlichen Behandlung wichtiger Methoden werden Approximationsalgorithmen
f{\"u}r die zweidimensionalen Problemvarianten vorgestellt. Darauf aufbauend werden
die h{\"o}herdimensionalen Probleme behandelt.
Das Buch richtet sich an Studenten der Informatik, die ihren Schwerpunkt auf
den Bereich Algorithmik legen, sowie an alle, die sich im wissenschaftlichen
Kontext mit Approximationsalgorithmen besch{\"a}ftigen.},
}
@ARTICLE{Harren2009a,
AUTHOR = {Harren, Rolf},
JOURNAL = {Theoretical Computer Science},
TITLE = {Approximation Algorithms for Orthogonal Packing Problems for Hypercubes},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {44},
PUBLISHER = {Elsevier},
VOLUME = {410},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2009.07.030},
YEAR = {2009},
PAGES = {4504--4532},
ABSTRACT = {Orthogonal packing problems are natural multidimensional generalizations of the
classical bin packing problem and knapsack problem and occur in many different
settings. The input consists of a set $I=\{r_1, \ldots, r_n\}$ of
$d$-dimensional rectangular items $r_i = (a_{i,1}, \ldots, a_{i,d})$ and a
space $Q$. The task is to pack the items in an orthogonal and non-overlapping
manner without using rotations into the given space. In the strip packing
setting the space $Q$ is given by a strip of bounded basis and unlimited
height. The objective is to pack all items into a strip of minimal height. In
the knapsack packing setting the given space $Q$ is a single, usually unit
sized bin and the items have associated profits $p_i$. The goal is to maximize
the profit of a selection of items that can be packed into the bin.
We mainly focus on orthogonal knapsack packing restricted to hypercubes and our
main results are a $(5/4+\epsilon)$-approximation algorithm for two-dimensional
hypercube knapsack packing, also known as square packing, and a $(1 +
1/2^d+\epsilon)$-approximation algorithm for $d$-dimensional hypercube knapsack
packing. In addition we consider $d$-dimensional hypercube strip packing in the
case of a bounded ratio between the shortest and longest side of the basis of
the strip. We derive an asymptotic polynomial time approximation scheme (APTAS)
for this problem.
Finally, we present an algorithm that packs hypercubes with a total profit of
at least $(1-\epsilon)\mathrm{OPT}$ into a large bin (the size of the bin
depends on $\epsilon$). This problem is known as hypercube knapsack packing
with large resources.
A preliminary version was published in [H., \emph{Approximating the orthogonal
knapsack problem for hypercubes}, ICALP 2006] but especially for the latter two
approximation schemes no details were given due to page limitations.},
}
@PHDTHESIS{HarrenPhD2010,
AUTHOR = {Harren, Rolf},
TITLE = {Two-dimensional packing problems},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
ADDRESS = {Saarbr{\"u}cken},
PUBLISHER = {Universit{\"a}t des Saarlandes},
MONTH = {October},
YEAR = {2010},
PAGES = {118},
}
@INPROCEEDINGS{HarrenvanStee2008,
AUTHOR = {Harren, Rolf and van Stee, Rob},
EDITOR = {Gudmundsson, Joachim},
TITLE = {Packing Rectangles into 2 OPT Bins using Rotations},
BOOKTITLE = {11th Scandinavian Workshop on Algorithm Theory},
PADDRESS = {Berlin},
ADDRESS = {Gothenburg, Sweden},
PUBLISHER = {Springer},
MONTH = {July},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5124},
ISBN = {978-3-540-69900-2},
DOI = {10.1007/978-3-540-69903-3},
YEAR = {2008},
PAGES = {306--318},
ABSTRACT = {We consider the problem of packing rectangles into bins that are unit squares,
where the goal is to minimize the number of bins used. All rectangles can be
rotated by $90$ degrees and have to be packed non-overlapping and orthogonal,
i.e., axis-parallel. We present an algorithm for this problem with an absolute
worst-case ratio of 2, which is optimal provided $\mathcal{P} \not=
\mathcal{NP}$.},
}
@INPROCEEDINGS{HarrenvanStee2009b,
AUTHOR = {Harren, Rolf and van Stee, Rob},
EDITOR = {Dinur, Irit and Jansen, Klaus and Naor, Joseph and Rolim, Jos{\'e}},
TITLE = {Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems},
BOOKTITLE = {Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009},
PADDRESS = {Berlin, Germany},
ADDRESS = {Berkeley, CA},
PUBLISHER = {Springer},
MONTH = {August},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5687},
ISBN = {978-3-642-03684-2},
DOI = {10.1007/978-3-642-03685-9_14},
YEAR = {2009},
PAGES = {177--189},
ABSTRACT = {We consider the two-dimensional bin packing and strip packing problem, where a
list of rectangles has to be packed into a minimal number of rectangular bins
or a strip of minimal height, respectively. All packings have to be
non-overlapping and orthogonal, i.e., axis-parallel. Our algorithm for strip
packing has an absolute approximation ratio of $1.9396$ and is the first
algorithm to break the approximation ratio of 2 which was established more than
a decade ago. Moreover, we present an algorithm for two-dimensional bin packing
with an absolute worst-case ratio of 2, which is optimal provided $\mathcal{P}
\not= \mathcal{NP}$. },
}
@ARTICLE{HarSte12,
AUTHOR = {Harren, Rolf and van Stee, Rob},
JOURNAL = {Journal of Scheduling},
TITLE = {Absolute Approximation Ratios for Packing Rectangles into Bins},
ADDRESS = {New York, NY},
NUMBER = {1},
PUBLISHER = {Springer},
MONTH = {February},
VOLUME = {15},
ISBN = {1094-6136},
DOI = {10.1007/s10951-009-0110-3},
YEAR = {2012},
PAGES = {63--75},
ABSTRACT = {We consider the problem of packing rectangles into bins that are unit squares,
where the goal is to minimize the number of bins used. All rectangles have to
be packed non-overlapping and orthogonal, i.e., axis-parallel. We present an
algorithm with an absolute worst-case ratio of 2 for the case where the
rectangles can be rotated by 90 degrees. This is optimal provided P != NP. For
the case where rotation is not allowed, we prove an approximation ratio of 3
for the algorithm Hybrid First Fit which was introduced by Chung, Gary \&
Johnson [1982] and whose running time is slightly better than the running time
of Zhang's previously known 3-approximation algorithm [2005].},
}
@MASTERSTHESIS{Hazboun1999,
AUTHOR = {Hazboun, Jack},
TITLE = {{Molek{\"u}l-Docking-Reaktionen}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {November},
YEAR = {1999},
}
@INPROCEEDINGS{Hebbinghaus2005,
AUTHOR = {Doerr, Benjamin and Hebbinghaus, Nils},
EDITOR = {Felsner, Stefan},
TITLE = {Discrepancy of Products of Hypergraphs},
BOOKTITLE = {2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
PADDRESS = {Nancy, France},
ADDRESS = {Berlin, Germany},
PUBLISHER = {DMTCS},
MONTH = {September},
SERIES = {DMTCS Proceedings},
VOLUME = {AE},
YEAR = {2005},
PAGES = {323--328},
ABSTRACT = {For a hypergraph {${\mathcal{H} = (V,\mathcal{E})}$}, its {${d}$}--fold
symmetric product is {${ \Delta ^{d} \mathcal{H} = (V^{d},\{ E^{d} | E
{\in}\mathcal{E} \}) }$}. We give several upper and lower bounds for the
{${c}$}-color discrepancy of such products. In particular, we show that the
bound {${ \textrm{disc}(\Delta ^{d} \mathcal{H},2)
{\leq}\textrm{disc}(\mathcal{H},2) }$} proven for all {${d}$} in [B.\ Doerr,
A.\ Srivastav, and P.\ Wehr, Discrepancy of {C}artesian products of arithmetic
progressions, Electron. J. Combin. 11(2004), Research Paper 5, 16 pp.] cannot
be extended to more than {${c = 2}$} colors. In fact, for any {${c}$} and
{${d}$} such that {${c}$} does not divide {${d!}$}, there are hypergraphs
having arbitrary large discrepancy and {${ \textrm{disc}(\Delta ^{d}
\mathcal{H},c) = \Omega_{d}(\textrm{disc}(\mathcal{H},c)^{d}) }$}. Apart from
constant factors (depending on {${c}$} and {${d}$}), in these cases the
symmetric product behaves no better than the general direct product
{${\mathcal{H}^{d}}$}, which satisfies {${ \textrm{disc}(\mathcal{H}^{d},c) =
O_{c,d}(\textrm{disc}(\mathcal{H},c)^{d}) }$}. },
}
@INPROCEEDINGS{Hebbinghaus2006,
AUTHOR = {Doerr, Benjamin and Hebbinghaus, Nils and Neumann, Frank},
EDITOR = {Runarsson, Thomas Ph. and Beyer, Hans G. and Burke, Edmund and Merelo-Guerv{\'o}s, Juan J. and Whitley, L. Darrell and Yao, Xin},
TITLE = {Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators},
BOOKTITLE = {Parallel Problem Solving from Nature - PPSN IX, 9th International Conference},
ORGANIZATION = {Springer-Verlag GmbH},
PADDRESS = {Berlin, Germany},
ADDRESS = {Reykjavik, Iceland},
PUBLISHER = {Springer},
MONTH = {October},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4193},
ISBN = {978-3-540-38990-3},
YEAR = {2006},
PAGES = {978--987},
ABSTRACT = {We investigate the effect of restricting the mutation operator in evolutionary
algorithms with respect to the runtime behavior. For the Eulerian cycle
problem; we present runtime bounds on evolutionary algorithms with a restricted
operator that are much smaller than the best upper bounds for the general case.
It turns out that a plateau that both algorithms have to cope with is left
faster by the new algorithm. In addition, we present a lower bound for the
unrestricted algorithm which shows that the restricted operator speeds up
computation by at least a linear factor.},
}
@ARTICLE{Hebbinghaus2006a,
AUTHOR = {Bundy, David and Hebbinghaus, Nils and Stellmacher, Bernd},
JOURNAL = {Journal of Algebra},
TITLE = {The Local C(G,T) Theorem},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {2},
PUBLISHER = {Elsevier},
MONTH = {June},
VOLUME = {300},
ISBN = {0021-8693},
YEAR = {2006},
PAGES = {741--789},
}
@TECHREPORT{Hebbinghaus2007,
AUTHOR = {Hebbinghaus, Nils},
TITLE = {Discrepancy of Sums of two Arithmetic Progressions},
INSTITUTION = {Cornell University (ArXiv)},
TYPE = {ArXiv},
ADDRESS = {ArXiv},
NUMBER = {math.NT/0703108},
MONTH = {March},
YEAR = {2007},
PAGES = {15},
ABSTRACT = {Estimating the discrepancy of the hypergraph of all arithmetic progressions in
the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in
combinatorial discrepancy theory for a long time. An extension of this
classical hypergraph is the hypergraph of sums of $k$ ($k\geq 1$ fixed)
arithmetic progressions. The hyperedges of this hypergraph are of the form
$A_{1}+A_{2}+\hdots+A_{k}$ in $[N]$, where the $A_{i}$ are arithmetic
progressions. For this hypergraph Hebbinghaus (2004) proved a lower bound of
$\Omega(N^{k/(2k+2)})$. Note that the probabilistic method gives an upper bound
of order $O((N\log N)^{1/2})$ for all fixed $k$. P\v{r}\'{i}v\v{e}tiv\'{y}
improved the lower bound for all $k\geq 3$ to $\Omega(N^{1/2})$ in 2005. Thus,
the case $k=2$ (hypergraph of sums of two arithmetic progressions) remained the
only case with a large gap between the known upper and lower bound. We bridge
his gap (up to a logarithmic factor) by proving a lower bound of order
$\Omega(N^{1/2})$ for the discrepancy of the hypergraph of sums of two
arithmetic progressions.},
}
@MASTERSTHESIS{HeidrichBachelor2012,
AUTHOR = {Heydrich, Sandy},
TITLE = {Dividing connected chores fairly},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Bachelor thesis},
YEAR = {2012},
}
@ARTICLE{HeinyKasprzikKoetzing2012,
AUTHOR = {Heinz, Jeffrey and Kasprzik, Anna and K{\"o}tzing, Timo},
JOURNAL = {Theoretical Computer Science},
TITLE = {Learning in the limit with lattice-structured hypothesis spaces},
ADDRESS = {Amsterdam},
PUBLISHER = {Elsevier},
VOLUME = {457},
ISBN = {0304-3975},
DOI = {10.1016/j.tcs.2012.07.017},
YEAR = {2012},
PAGES = {111 -- 127},
}
@INPROCEEDINGS{HelNeuWan2009,
AUTHOR = {Helwig, Sabine and Neumann, Frank and Wanka, Rolf},
EDITOR = {Bouchachia, Abdelhamid and Nedjah, Nadia and de Macedo Mourelle, Luiza and Pedrycz, Witold},
TITLE = {Particle Swarm Optimization with Velocity Adaptation},
BOOKTITLE = {2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings},
PADDRESS = {Los Alamitos, CA},
ADDRESS = {Klagenfurt, Austria},
PUBLISHER = {IEEE Computer Society},
ISBN = {978-0-7695-3827-3},
DOI = {10.1109/ICAIS.2009.32},
YEAR = {2009},
PAGES = {146--151},
NOTE = {Best Paper Award},
}
@MASTERSTHESIS{Hemmer2002,
AUTHOR = {Hemmer, Michael},
TITLE = {Reliable computation of planar and spatial arrangements of quadrics},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {April},
YEAR = {2002},
}
@INPROCEEDINGS{Hemmer2007,
AUTHOR = {Dupont, Laurent and Hemmer, Michael and Petitjean, Sylvain and Sch{\"o}mer, Elmar},
EDITOR = {Arge, Lars and Hoffmann, Michael and Welzl, Emo},
TITLE = {Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics},
BOOKTITLE = {15th Annual European Symposium on Algorithms},
PADDRESS = {Heidelberg},
ADDRESS = {Eilat, Israel},
PUBLISHER = {Springer},
MONTH = {October},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4698},
ISBN = {978-3-540-75519-7},
DOI = {10.1007/978-3-540-75520-3_56},
YEAR = {2007},
PAGES = {633--644},
ABSTRACT = {We present a complete, exact and efficient implementation to compute the
adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic
degree 2. This is a major step towards the computation of the full 3D
arrangement. We enhanced an implementation for an exact parameterization of the
intersection curves of two quadrics, such that we can compute the exact
parameter value for intersection points and from that the adjacency graph of
the arrangement. Our implementation is complete in the sense that it can handle
all kinds of inputs including all degenerate ones, i.e. singularities or
tangential intersection points. It is exact in that it always computes the
mathematically correct result. It is efficient measured in running times, i.e.
it compares favorably to the only previous implementation.},
}
@PHDTHESIS{Hemmer2008,
AUTHOR = {Hemmer, Michael},
TITLE = {Exact Computation of the Adjacency Graph of an Arrangement of Quadrics},
SCHOOL = {Johannes Gutenberg-Universit{\"a}t Mainz},
TYPE = {Doctoral dissertation},
ADDRESS = {Saarstr. 21, D 55122 Mainz},
PUBLISHER = {Johannes Gutenberg-Universit{\"a}t Mainz},
MONTH = {May},
YEAR = {2008},
ABSTRACT = {We present a complete, exact and efficient algorithm to compute the adjacency
graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This
is a major step towards the computation of the full 3D arrangement. We enhanced
an implementation for an exact parameterization of the intersection curves of
two quadrics, such that we can compute the exact parameter value for
intersection points and from that the adjacency graph of the arrangement. Our
implementation is complete in the sense that it can handle all kinds of inputs
including all degenerate ones, i.e. singularities or tangential intersection
points. It is exact in that it always computes the mathematically correct
result. It is efficient measured in running times, i.e. it compares favorably
to the only previously implemented approach. Our approach has been implemented
within the EXACUS project. The central goal of Exacus is the development of a
demonstrator of a reliable and efficient CAD geometry kernel. Although we call
our library design prototypical, we spent nonetheless a great effort on
completeness, exactness, efficiency, documentation and reusability. Beside its
primary contribution, the algorithm presented in this work had an essential
impact on fundamental parts of EXACUS due to its specific requirements. This
work has in particular contributed to the generic number type support and the
modular methods used within Exacus. In the context of our ongoing integration
of EXACUS into CGAL these parts have been successfully advanced into mature
CGAL packages.},
}
@ARTICLE{Hemmer2011,
AUTHOR = {Hemmer, Michael and Dupon, Laurent and Petitjean, Sylvain and Schomer, Elmar},
JOURNAL = {Journal of Symbolic Computation},
TITLE = {A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics},
ADDRESS = {Amsterdam},
NUMBER = {4},
PUBLISHER = {Elsevier},
VOLUME = {46},
ISBN = {0747-7171},
DOI = {10.1016/j.jsc.2010.11.002},
YEAR = {2011},
PAGES = {467--494},
}
@INPROCEEDINGS{Hermelin2010,
AUTHOR = {Bar-Yehuda, Reuven and Hermelin, Danny and Rawitz, Dror},
EDITOR = {de Berg, Mark and Meyer, Ulrich},
TITLE = {Minimum Vertex Cover in Rectangle Graphs},
BOOKTITLE = {Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I},
PADDRESS = {Berlin},
ADDRESS = {Liverpool, England},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6347},
ISBN = {978-3-642-15780-6},
DOI = {10.1007/978-3-642-15775-2_22},
YEAR = {2010},
PAGES = {255--266},
}
@ARTICLE{Hermelin2010b,
AUTHOR = {Butman, Ayelet and Hermelin, Danny and Lewenstein, Moshe and Rawitz, Dror},
JOURNAL = {ACM Transactions on Algorithms},
TITLE = {Optimization problems in multiple-interval graphs},
ADDRESS = {New York, NY},
NUMBER = {2},
PUBLISHER = {ACM},
VOLUME = {6},
ISBN = {1549-6325},
DOI = {10.1145/1721837.1721856},
YEAR = {2010},
PAGES = {40,1--40,18},
}
@INPROCEEDINGS{Hermelin2012,
AUTHOR = {Hermelin, Danny and Rizzi, Romeo and Vialette, Stephane},
EDITOR = {Chao, Kun-Mao and Hsu, Tsan-sheng and Lee, Der-Tsai},
TITLE = {Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph},
BOOKTITLE = {Algorithms and Computation : 23rd International Symposium, ISAAC 2012},
PADDRESS = {Berlin},
ADDRESS = {Taipei, Taiwan},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7676},
ISBN = {978-3-642-35260-7},
DOI = {10.1007/978-3-642-35261-4_49},
YEAR = {2012},
PAGES = {465--474},
}
@INPROCEEDINGS{HermelinCulex2010,
AUTHOR = {Nor, Igor and Hermelin, Danny and Charlat, Sylvain and Engelstadter, Jan and Reuter, Max and Duron, Olivier Sagot, Marie-France},
EDITOR = {Amir, Amihood and Parida, Laxmi},
TITLE = {Mod/Resc Parsimony Inference},
BOOKTITLE = {Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010},
PADDRESS = {Berlin},
ADDRESS = {New York, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6129},
ISBN = {978-3-642-13508-8},
DOI = {10.1007/978-3-642-13509-5_19},
YEAR = {2010},
PAGES = {202--213},
}
@INPROCEEDINGS{HermelinHuangKratschWahlstrom2011,
AUTHOR = {Hermelin, Danny and Huang, Chien-Chung and Kratsch, Stefan and Wahlstr{\"o}m, Magnus},
EDITOR = {Kolman, Petr and Kratochv{\'i}l, Jan},
TITLE = {Parameterized Two-Player {N}ash Equilibrium},
BOOKTITLE = {Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011},
PADDRESS = {Berlin},
ADDRESS = {Tepl{\'a} Monastery, Czech Republic},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6986},
ISBN = {978-3-642-25869-5},
DOI = {10.1007/978-3-642-25870-1_20},
YEAR = {2011},
PAGES = {215--226},
}
@INPROCEEDINGS{HermelinLCS2010,
AUTHOR = {Gotthilf, Zvi and Hermelin, Danny and Landau, Gad M. and Lewenstein, Moshe},
TITLE = {Restricted {LCS}},
BOOKTITLE = {17th International Symposium on String Processing and Information Retrieval},
PADDRESS = {Berlin},
ADDRESS = {Los Cabos, Mexico},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6393},
YEAR = {2010},
PAGES = {250--257},
}
@INPROCEEDINGS{HermelinLevyWeimanYuster2011,
AUTHOR = {Hermelin, Danny and Levy, Avivit and Weimann, Oren and Yuster, Raphael},
EDITOR = {Aceto, Luca and Henzinger, Monika and Sgall, Jiri},
TITLE = {Distance Oracles for Vertex-Labeled Graphs},
BOOKTITLE = {Automata, Languages and Programming : 38th International Colloquium, ICALP 2011},
PADDRESS = {Berlin},
ADDRESS = {Zurich, Switzerland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6756},
ISBN = {978-3-642-22011-1},
DOI = {10.1007/978-3-642-22012-8_39},
YEAR = {2011},
PAGES = {490--501},
}
@INPROCEEDINGS{HermelinMestreRawitz2012,
AUTHOR = {Hermelin, Danny and Mestre, Julian and Rawitz, Dror},
EDITOR = {Golumbic, Martin Charles and Stern, Michal and Levy, Avivit and Morgenstern, Gila},
TITLE = {Optimization Problems in Dotted Interval Graphs},
BOOKTITLE = {Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012},
PADDRESS = {Berlin},
ADDRESS = {Jerusalem, Israel},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7551},
ISBN = {978-3-642-34610-1},
DOI = {10.1007/978-3-642-34611-8_8},
YEAR = {2012},
PAGES = {46--56},
}
@INPROCEEDINGS{HermelinMnichvanLeeuwen2012,
AUTHOR = {Hermelin, Danny and Mnich, Matthias and van Leeuwen, Erik Jan},
EDITOR = {Epstein, Leah and Ferragina, Paolo},
TITLE = {Parameterized complexity of induced {H}-matching on claw-free graphs},
BOOKTITLE = {Algorithms - ESA 2012 : 20th Annual European Symposium},
PADDRESS = {Berlin},
ADDRESS = {Ljubljana, Slovenia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7501},
ISBN = {978-3-642-33089-6},
DOI = {10.1007/978-3-642-33090-2_54},
YEAR = {2012},
PAGES = {624--635},
}
@INPROCEEDINGS{HermelinMnichVanLeeuwenWoeginger2011,
AUTHOR = {Hermelin, Danny and Mnich, Matthias and van Leeuwen, Erik Jan and Woeginger, Gerhard J.},
EDITOR = {Aceto, Luca and Henzinger, Monika and Sgall, Jiri},
TITLE = {Domination When the Stars Are Out},
BOOKTITLE = {Automata, Languages and Programming : 38th International Colloquium, ICALP 2011},
PADDRESS = {Berlin},
ADDRESS = {Zurich, Switzerland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6746},
ISBN = {978-3-642-22011-1},
DOI = {10.1007/978-3-642-22006-7_39},
YEAR = {2011},
PAGES = {462--473},
}
@ARTICLE{HermelinRawitz2011,
AUTHOR = {Hermelin, Danny and Rawitz, Dror},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Optimization problems in multiple subtree graphs},
ADDRESS = {Amsterdam},
NUMBER = {7},
PUBLISHER = {Elsevier},
VOLUME = {159},
DOI = {/10.1016/j.dam.2010.03.010},
YEAR = {2011},
PAGES = {588--594},
}
@INPROCEEDINGS{HermelinWu2012,
AUTHOR = {Hermelin, Danny and Wu, Xi},
EDITOR = {Rabani, Yuval},
TITLE = {Weak compositions and their applications to polynomial lower bounds for kernelization},
BOOKTITLE = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12)},
PADDRESS = {Philadelphia, PA},
ADDRESS = {Tokyo, Japan},
PUBLISHER = {SIAM},
ISBN = {978-1-611972-11-5},
YEAR = {2012},
PAGES = {104--113},
}
@ARTICLE{Hert1999,
AUTHOR = {Hert, Susan and Lumelsky, Vladimir},
JOURNAL = {IEEE Transactions on Robotics and Automation},
TITLE = {Motion Planning in R^3 for Multiple Tethered Robots},
NUMBER = {4},
MONTH = {August},
VOLUME = {15},
YEAR = {1999},
PAGES = {623--639},
ABSTRACT = {The problem of motion planning in three dimensions for $n$ tethered
robots is considered. Motivation for this problem comes from the
need to coordinate the motion of a group of tethered underwater
vehicles. The motion plan must be such that it can be executed without
the robots' tethers becoming tangled. The simultaneous-motion plan
is generated in three steps. First, an ordering of the robots is
produced that maximizes the number of robots that can move along
straight lines to their targets. Then paths for the robots are
computed assuming they move sequentially in the given order.
Two methods of computing the sequential-motion plan for the
robots are presented. The first method is computationally
simple but guarantees no bound on the path length with respect
to the optimal length; the second method guarantees nearly
optimal paths for the given ordering at the expense of additional
computation. Finally, trajectories are determined that allow the
robots to move simultaneously. The motion plan generated is
guaranteed not to result in tangled tethers. The algorithms we
present are shown to run in $O(n^4)$ time in total in the
worst case, which is less than the additional computation needed
to produce the nearly optimal paths using existing approximation
algorithms.},
}
@TECHREPORT{Hertel84/02,
AUTHOR = {Hertel, Stefan and Mehlhorn, Kurt and M{\"a}ntyl{\"a}, Martti and Nievergelt, Jurg},
TITLE = {Space sweep solves intersection of two convex polyhedra elegantly},
INSTITUTION = {Universit{\"a}t des Saarlandes / Fachbereich Angewandte Mathematik und Informatik},
ADDRESS = {Saarbr{\"u}cken},
NUMBER = {A 84/02},
YEAR = {1984},
PAGES = {33S.},
}
@ARTICLE{Heydrich2015,
AUTHOR = {Heydrich, Sandy and van Stee, Rob},
JOURNAL = {Theoretical Computer Science},
TITLE = {Dividing Connected Chores Fairly},
MONTH = {August},
VOLUME = {593},
DOI = {10.1016/j.tcs.2015.05.041},
YEAR = {2015},
PAGES = {51--61},
ABSTRACT = {In this paper we consider the fair division of chores (tasks that need to be
performed by agents, with negative utility for them), and study the loss in
social welfare due to fairness. Previous work has been done on this so-called
price of fairness, concerning fair division of cakes and chores with
non-connected pieces and of cakes with connected pieces. In this paper, we
consider situations where each player has to receive one connected piece of the
chores. We provide tight or nearly tight bounds on the price of fairness with
respect to the three main fairness criteria proportionality, envy-freeness and
equitability and for utilitarian and egalitarian welfare. We also give the
first proof of the existence of equitable divisions for chores with connected
pieces.},
}
@INPROCEEDINGS{HeySte13,
AUTHOR = {Heydrich, Sandy and van Stee, Rob},
EDITOR = {Voecking, Berthold},
TITLE = {Dividing connected chores fairly},
BOOKTITLE = {6th International Symposium on Algorithmic Game Theory},
PADDRESS = {New York},
ADDRESS = {Aachen, Germany},
PUBLISHER = {Springer},
MONTH = {October},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8146},
ISBN = {978-3-642-41391-9},
YEAR = {2013},
PAGES = {420--433},
}
@ARTICLE{HF2009,
AUTHOR = {Fountoulakis, Nikolaos and Huber, Anna},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading},
NUMBER = {4},
VOLUME = {23},
DOI = {10.1137/09075768X},
YEAR = {2009},
PAGES = {1964--1991},
ABSTRACT = {In this paper, we provide a detailed comparison between a fully randomized
protocol for rumour spreading on a complete graph
and a quasirandom protocol introduced by Doerr, Friedrich and Sauerwald (2008).
In the former, initially there is one vertex which
holds a piece of information and during each round every one of the informed
vertices chooses one of its neighbours uniformly at random
and independently and informs it. In the quasirandom version of this method
(cf. Doerr et al.) each vertex has a cyclic list of
its neighbours. Once a vertex has been informed, it chooses uniformly at random
only one neighbour. In the following round, it informs this neighbour and at
each subsequent round it picks the next neighbour from its list and informs it.
We give a precise analysis of the evolution of the quasirandom protocol on the
complete graph with $n$ vertices
and show that it evolves essentially in the same way as the randomized
protocol.
In particular, if $S(n)$ denotes the number of rounds that are needed until all
vertices are informed, we show that for any
slowly growing function $\omega (n)$
$$\log_2 n + \ln n - 4\ln \ln n \leq S(n) \leq \log_2 n + \ln n + \omega (n),$$
with probability $1-o(1)$. },
}
@INPROCEEDINGS{hh-mgcd-2009,
AUTHOR = {Hemmer, Michael and H{\"u}lse, Dominik},
TITLE = {Generic implementation of a modular GCD over Algebraic Extension Fields},
BOOKTITLE = {EuroCG'09 : 25th European Workshop on Computational Geometry},
PADDRESS = {Brussels, Belgium},
ADDRESS = {Brussels, Belgium},
PUBLISHER = {Universit{\'e} Libre de Bruxelles},
YEAR = {2009},
PAGES = {321--324},
}
@INPROCEEDINGS{hhkps-aegk-01,
AUTHOR = {Hert, Susan and Hoffmann, Michael and Kettner, Lutz and Pion, Sylvain and Seel, Michael},
EDITOR = {Brodal, Gerth Stolting and Frigioni, Daniele and Marchetti-Spaccamela, Alberto},
TITLE = {An Adaptable and Extensible Geometry {Kernel}},
BOOKTITLE = {Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Aarhus, Denmark},
PUBLISHER = {Springer},
MONTH = {September},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2141},
ISBN = {3-540-42500-4},
YEAR = {2001},
PAGES = {79--90},
ABSTRACT = { Geometric algorithms are based on geometric objects such as points,
lines and circles. The term \textit{Kernel\/} refers to a collection
of representations for constant-size geometric objects and
operations on these representations. This paper describes how such a
geometry kernel can be designed and implemented in C++, having
special emphasis on adaptability, extensibility and efficiency. We
achieve these goals following the generic programming paradigm and
using templates as our tools. These ideas are realized and tested in
\cgal~\cite{svy-cgal}, the Computational Geometry Algorithms
Library.},
}
@MASTERSTHESIS{Hilpert96,
AUTHOR = {Hilpert, Peter},
TITLE = {{Heuristiken fur das euklidische Travelling Salesman Problem}},
SCHOOL = {Universitat des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1996},
}
@INPROCEEDINGS{HKMN08,
AUTHOR = {Huang, Chien-Chung and Kavitha, Telikepalli and Michail, Dimitrios and Nasre, Meghana},
TITLE = {Bounded Unpopularity Matchings},
BOOKTITLE = {11th Scandinavian Workshop on Algorithm Theory (SWAT)},
PADDRESS = {Heidelberg, Germany},
ADDRESS = {Gothenburg, Sweden},
PUBLISHER = {Springer},
YEAR = {2008},
PAGES = {127--137},
}
@INPROCEEDINGS{hls-qarr-2009,
AUTHOR = {Hemmer, Michael and Limbach, Sebastian and Sch{\"o}mer, Elmar},
TITLE = {Continued Work on the Computation of an Exact Arrangement of Quadrics},
BOOKTITLE = {EuroCG'09 : 25th European Workshop on Computational Geometry},
PADDRESS = {Brussels, Belgium},
ADDRESS = {Brussels, Belgium},
PUBLISHER = {Universit{\'e} Libre de Bruxelles},
MONTH = {March},
YEAR = {2009},
PAGES = {313--316},
}
@INPROCEEDINGS{HMPT97,
AUTHOR = {Hundack, Christoph and Mutzel, Petra and Pouchkarev, Igor and Thome, Stefan},
EDITOR = {Di Battista, Giuseppe},
TITLE = {ArchE: A Graph Drawing System for Archaeology},
BOOKTITLE = {Proceedings of the 5th Symposium on Graph Drawing (GD-97)},
TYPE = {Demo},
PADDRESS = {Berlin},
ADDRESS = {Rome, Italy},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1353},
YEAR = {1997},
PAGES = {297--302},
}
@ARTICLE{HMT04:round-robin,
AUTHOR = {Henz, Martin and M{\"u}ller, Tobias and Thiel, Sven},
JOURNAL = {European Journal of Operational Research},
TITLE = {Global constraints for round robin tournament scheduling},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {1},
PUBLISHER = {Elsevier},
VOLUME = {153},
YEAR = {2004},
PAGES = {92--101},
}
@ARTICLE{Hoefer-IJGT-2013,
AUTHOR = {Hoefer, Martin},
JOURNAL = {International Journal of Game Theory},
TITLE = {Strategic Cooperation in Cost Sharing Games},
NUMBER = {1},
VOLUME = {42},
YEAR = {2013},
PAGES = {29--53},
}
@INPROCEEDINGS{Hoefer03,
AUTHOR = {Hoefer, Martin},
EDITOR = {Jansen, Klaus and Margraf, Marian and Mastrolli, Monaldo and Rolim, Jos{\'e} D. P.},
TITLE = {Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location},
BOOKTITLE = {2nd International Workshop on Experimental and Efficient Algorithms (WEA-03)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Ascona, Switzerland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2647},
ISBN = {3-540-40205-5},
YEAR = {2003},
PAGES = {165--178},
}
@ARTICLE{Hoefer2013,
AUTHOR = {Hoefer, Martin},
JOURNAL = {Information \& Computation},
TITLE = {Local Matching Dynamics in Social Networks},
VOLUME = {222},
YEAR = {2013},
PAGES = {20--35},
}
@INPROCEEDINGS{HoeferK2013,
AUTHOR = {Hoefer, Martin and Kesselheim, Thomas},
TITLE = {Brief Announcement: Universally Truthful Secondary Spectrum Auctions},
BOOKTITLE = {25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13)},
PADDRESS = {New York, USA},
ADDRESS = {Montreal, Canada},
PUBLISHER = {ACM},
YEAR = {2013},
PAGES = {99--101},
}
@INPROCEEDINGS{HoeferKV2013,
AUTHOR = {Hoefer, Martin and Kesselheim, Thomas and V{\"o}cking, Berthold},
TITLE = {Truthfulness and Stochastic Dominance with Monetary Transfers.},
BOOKTITLE = {14th Conf. Electronic Commerce (EC-13)},
PADDRESS = {New York, USA},
ADDRESS = {Philadelphia, USA},
PUBLISHER = {ACM},
YEAR = {2013},
PAGES = {567--582},
}
@ARTICLE{HoeferS-TEAC-2013,
AUTHOR = {Hoefer, Martin and Skopalik, Alexander},
JOURNAL = {ACM Transactions on Economics and Computation},
TITLE = {Altruism in Atomic Congestion Games},
NUMBER = {4},
VOLUME = {1},
YEAR = {2013},
PAGES = {21},
}
@ARTICLE{HoeferS-TOCS-2013,
AUTHOR = {Hoefer, Martin and Skopalik, Alexander},
JOURNAL = {Theory of Computing Systems},
TITLE = {On the Complexity of Pareto-optimal Nash and Strong Equilibria},
NUMBER = {3},
VOLUME = {53},
YEAR = {2013},
PAGES = {441--453},
}
@INPROCEEDINGS{HoeferS2013,
AUTHOR = {Hoefer, Martin and Sauerwald, Thomas},
TITLE = {Brief Announcement: Threshold Load Balancing in Networks},
BOOKTITLE = {32nd Symposium on Principles of Distributed Computing (PODC-13)},
PADDRESS = {New York, USA},
ADDRESS = {Montreal, Canada},
PUBLISHER = {ACM},
YEAR = {2013},
PAGES = {54--56},
}
@INPROCEEDINGS{HoeferW-WINE-2013,
AUTHOR = {Hoefer, Martin and Wagner, Lisa},
EDITOR = {Chen, Yiling and Immorlica, Nicole},
TITLE = {Designing Profit Shares in Matching and Coalition Formation Games},
BOOKTITLE = {9th Conference on Web and Internet Economics (WINE-13)},
PADDRESS = {New York, USA},
ADDRESS = {Cambridge, USA},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {8289},
YEAR = {2013},
PAGES = {249--262},
}
@INPROCEEDINGS{HoeferW2013,
AUTHOR = {Hoefer, Martin and Wagner, Lisa},
EDITOR = {Fomin, Fedor and Freivalds, Rusins and Kwiatkowska, Marta and Peleg, David},
TITLE = {Locally Stable Marriage with Strict Preferences},
BOOKTITLE = {40th International Colloquium on Automata, Languages and Programming (ICALP-13)},
PADDRESS = {New York, USA},
ADDRESS = {Riga, Latvia},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7966},
YEAR = {2013},
PAGES = {620--631},
}
@INPROCEEDINGS{Hoepman-Papatr-Tsigas95,
AUTHOR = {Hoepman, Jaap-Henk and Papatriantafilou, Marina and Tsigas, Philippas},
EDITOR = {H{\'e}lary, Jean-Michel and Raynal, Michel},
TITLE = {Self-Stabilization in Wait-Free Shared Memory Objects},
BOOKTITLE = {Distributed Algorithms: 9th International Workshop (WDAG95)},
PADDRESS = {Berlin},
ADDRESS = {Le Mont-Saint Michel, France},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {972},
YEAR = {1995},
PAGES = {273--287},
}
@ARTICLE{HoogeveenSkutellaWoeginger2003,
AUTHOR = {Hoogeveen, Han and Skutella, Martin and Woeginger, Gerhard J.},
JOURNAL = {Mathematical Programming},
TITLE = {Preemptive scheduling with rejection},
ADDRESS = {Berlin, Germany},
NUMBER = {2-3},
PUBLISHER = {Springer},
MONTH = {January},
VOLUME = {94},
ISBN = {0025-5610},
YEAR = {2003},
PAGES = {361--374},
ABSTRACT = { We consider the problem of preemptively scheduling a set of $n$ jobs
on $m$ (identical, uniformly related, or unrelated) parallel
machines. The scheduler may reject a subset of the jobs and thereby
incur job-dependent penalties for each rejected job, and he must
construct a schedule for the remaining jobs so as to optimize the
preemptive makespan on the $m$ machines plus the sum of the
penalties of the jobs rejected.
We provide a complete classification of these scheduling problems
with respect to complexity and approximability. Our main results
are on the variant with an arbitrary number of unrelated machines.
This variant is \apx-hard, and we design a $1.58$-approximation
algorithm for it. All other considered variants are weakly
\np-hard, and we provide fully polynomial time approximation schemes
for them. Finally, we argue that our results for unrelated machines
can be carried over to the corresponding preemptive open shop
scheduling problem with rejection.},
}
@INPROCEEDINGS{HorNeuFOGA2009,
AUTHOR = {Horoba, Chrisitian and Neumann, Frank},
TITLE = {Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms},
BOOKTITLE = {FOGA'09 : Revised Selected Papers from ACM SIGEVO Foundations of Genetic Algorithms X},
PADDRESS = {New York, NY},
ADDRESS = {Orlando, USA},
PUBLISHER = {ACM},
ISBN = {978-1-60558-414-0},
DOI = {10.1145/1527125.1527137},
YEAR = {2009},
PAGES = {79--86},
}
@INPROCEEDINGS{HorNeuGECCO2008,
AUTHOR = {Horoba, Christian and Neumann, Frank},
EDITOR = {Ryan, Conor and Keijzer, Maarten},
TITLE = {Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization},
BOOKTITLE = {Genetic and Evolutionary Computation Conference 2008},
PADDRESS = {New York, USA},
ADDRESS = {Atlanta, USA},
PUBLISHER = {ACM Press},
YEAR = {2008},
PAGES = {641--680},
}
@INPROCEEDINGS{hr-mrmpipppg-01,
AUTHOR = {Hert, Susan and Richards, Brad},
EDITOR = {Christensen, Henrik and Hager, Greg},
TITLE = {Multiple Robot Motion Planning = Parallel Processing + Geometry},
BOOKTITLE = {Sensor Based Intelligent Robots},
PADDRESS = {Berlin, Germany},
ADDRESS = {Schloss Dagstuhl, Wadern, Germany},
PUBLISHER = {Springer},
MONTH = {November},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2238},
YEAR = {2002},
PAGES = {183--205},
ABSTRACT = {We present two problems in multiple-robot motion planning that can be quite
naturally solved using techniques from the parallel processing community to
dictate how the robots interact with each other and techniques from
computational geometry to apply these techniques in the geometric environment
in which the robots operate. The first problem we consider is a load-balancing
problem in which a pool of work must be divided among a set of
processors in order to minimize the amount of time required to complete all
the work. We describe a simple polygon partitioning algorithm that allows
techniques from parallel processor scheduling to be applied in the
multiple-robot setting in order to achieve a good balance of the work.
The second problem is that of collision avoidance, where one must avoid that
two (or more) processors occupy the same resource at the same time.
For this problem, we describe a procedure for robot interaction that is
derived from procedures used to shared-memory computers along with a geometric
data structure that can efficiently determine when there are potential
robot collisions.},
}
@INPROCEEDINGS{HTM06a,
AUTHOR = {Hariharan, Ramesh and Telikepalli, Kavitha and Mehlhorn, Kurt},
EDITOR = {Bugliesi, Michele and Preneel, Bart and Sassone, Vladimir and Wegener, Ingo},
TITLE = {A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs},
BOOKTITLE = {Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I},
PADDRESS = {Berlin, Germany},
ADDRESS = {Venice, Italy},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4051},
ISBN = {3-540-35904-4},
DOI = {10.1007/11786986_23},
YEAR = {2006},
PAGES = {250--261},
ABSTRACT = {We consider the problem of computing a minimum cycle basis in a directed graph.
The input to this problem is a directed graph G whose edges have non-negative
weights. A cycle in this graph is actually a cycle in the underlying undirected
graph with edges traversable in both directions. A {–1,0,1} edge incidence
vector is associated with each cycle: edges traversed by the cycle in the right
direction get 1 and edges traversed in the opposite direction get -1. The
vector space over generated by these vectors is the cycle space of G. A minimum
cycle basis is a set of cycles of minimum weight that span the cycle space of
G. The current fastest algorithm for computing a minimum cycle basis in a
directed graph with m edges and n vertices runs in time (where ω< 2.376 is the
exponent of matrix multiplication). Here we present an O(m3n + m2n2logn)
algorithm. We also slightly improve the running time of the current fastest
randomized algorithm from O(m2nlogn) to O(m2 n + mn2 logn).},
}
@INPROCEEDINGS{HTZ-AKCROSS-2009,
AUTHOR = {Hemmer, Michael and Tsigaridas, Elias P. and Zafeirakopoulos, Zafeirakis and Emiris, Ioannis Z. and Karavelas, Menelaos I. and Mourrain, Bernard},
TITLE = {Experimental evaluation and cross-benchmarking of univariate real solvers},
BOOKTITLE = {Symbolic Numeric Computation 2009 (SNC 2009)},
PADDRESS = {New York, NY},
ADDRESS = {Kyoto, Japan},
PUBLISHER = {ACM},
ISBN = {978-1-60558-664-9},
DOI = {10.1145/1577190.1577202},
YEAR = {2009},
PAGES = {45--54},
}
@INPROCEEDINGS{Huang2008,
AUTHOR = {Bhaskar, Umang and Fleischer, Lisa and Hoy, Darrell and Huang, Chien-Chung},
EDITOR = {Mathieu, Claire},
TITLE = {Equilibria of Atomic Flow Games are not Unique},
BOOKTITLE = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009)},
PADDRESS = {New York, NY},
ADDRESS = {New York, U.S.A.},
PUBLISHER = {ACM},
MONTH = {January},
YEAR = {2009},
PAGES = {748--757},
ABSTRACT = {In STOC 2006, Hayrapetyan, Tardos and Wexler introduced the problem
of studying collusion in network routing games. In this
work, we show that collusion adds significant
complexity to the structure of equilibria in nonatomic routing games,
answering an open question posed by
Cominetti, Correa, and Stier-Moses (ICALP 2006):
Without collusion, it follows from well-known convexity arguments
that equilibria exist and are unique (up to induced delays, and under
weak assumptions on delay functions). The question
is, does this uniqueness continue to hold in the presence of collusion?
We answer no: we show that if collusion is allowed in nonatomic routing games,
there may be multiple equilibria.
We demonstrate the multiplicity via two specific examples.
In addition, we show our examples are topologically minimal
by giving a complete characterization of the class of
network topologies for which unique equilibria exist. Our
proofs and examples are based on a novel characterization of
these topologies in terms of sets of circulations.},
}
@INPROCEEDINGS{Huang2010,
AUTHOR = {Huang, Chien-Chung},
EDITOR = {Charikar, Moses},
TITLE = {Classified stable matching},
BOOKTITLE = {21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010)},
PADDRESS = {Philadelphia, Pa.},
ADDRESS = {Austin, TX, USA},
PUBLISHER = {SIAM},
ISBN = {978-0-898716-98-6},
YEAR = {2010},
PAGES = {1235--1253},
}
@ARTICLE{Huang2010a,
AUTHOR = {Huang, Chien-Chung},
JOURNAL = {Algorithmica},
TITLE = {Circular stable matching and 3-way kidney transplant},
ADDRESS = {New York, NY},
NUMBER = {1},
PUBLISHER = {Springer},
VOLUME = {58},
ISBN = {0178-4617},
DOI = {10.1007/s00453-009-9356-6},
YEAR = {2010},
PAGES = {137--150},
}
@ARTICLE{Huang2011,
AUTHOR = {Huang, Chien-Chung and Kavitha, Telikepalli and Michael, Dimitrios and Nasr, Meghana},
JOURNAL = {Algorithmica},
TITLE = {Bounded Unpopularity Matchings},
ADDRESS = {New York, NY},
NUMBER = {3},
PUBLISHER = {Springer},
VOLUME = {61},
ISBN = {0178-4617},
DOI = {10.1007/s00453-010-9434-9},
YEAR = {2011},
PAGES = {738--757},
}
@INPROCEEDINGS{Huang2011a,
AUTHOR = {Huang, Chien-Chung and Kavitha, Telikepalli},
TITLE = {Popular Matchings in the Stable Marriage Problem},
BOOKTITLE = {38th International Colloquium on Automata, Languages and Programming (ICALP)},
PADDRESS = {Springer-Verlag GmbH Heidelberger Platz 3 14197 Berlin},
ADDRESS = {Z{\"u}rich, Switzerland},
PUBLISHER = {Springer},
YEAR = {2011},
NOTE = {Journal version to appear in Information and Computation},
}
@INPROCEEDINGS{Huang2011b,
AUTHOR = {Huang, Chien-Chung and Kavitha, Telikepalli},
TITLE = {Near-popular matchings in the Roommates problem},
BOOKTITLE = {19th European Symposium on Algorithms (ESA)},
PADDRESS = {Springer-Verlag GmbH Heidelberger Platz 3 14197 Berlin},
ADDRESS = {Saarbr{\"u}cken, Germany},
PUBLISHER = {Springer},
YEAR = {2011},
NOTE = {Journal version to appear in SIAM Journal on Discrete Mathematics},
}
@INPROCEEDINGS{Huang2012a,
AUTHOR = {Huang, Chien-Chung},
EDITOR = {Fomin, Fedor V. and Kaski, Petteri},
TITLE = {Non-preemptive Speed Scaling},
BOOKTITLE = {Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops},
PADDRESS = {Berlin},
ADDRESS = {Helsinki, Finland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7357},
ISBN = {978-3-642-31154-3},
DOI = {10.1007/978-3-642-31155-0_22},
YEAR = {2012},
PAGES = {249--260},
NOTE = {Journal version to appear at Journal of Scheduling},
}
@PHDTHESIS{HuberPhD2010,
AUTHOR = {Huber, Anna},
TITLE = {Randomized rounding and rumor spreading with stochastic dependencies},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Doctoral dissertation},
ADDRESS = {Saarbr{\"u}cken},
PUBLISHER = {Universit{\"a}t des Saarlandes},
MONTH = {September},
YEAR = {2010},
PAGES = {105},
}
@MASTERSTHESIS{Humble97,
AUTHOR = {Humble, Monika},
TITLE = {{Die Berechnung maximaler Fl{\"u}sse in Netzwerken}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
YEAR = {1997},
}
@INCOLLECTION{HundackProemelSteger97,
AUTHOR = {Hundack, Christoph and Pr{\"o}mel, Hans J{\"u}rgen and Steger, Angelika},
EDITOR = {Bellob{\'a}s, B{\'e}la and Thomason, Andrew},
TITLE = {Extremal Graph Problems for Graphs with a Color-Critical Vertex},
BOOKTITLE = {Combinatorics, Geometry and Probability},
ADDRESS = {Cambridge},
PUBLISHER = {Cambridge University Press},
ISBN = {0-521-58472-8},
YEAR = {1997},
PAGES = {421--433},
}
@INPROCEEDINGS{HutSanVit2001,
AUTHOR = {Hutchinson, David A. and Sanders, Peter and Vitter, Jeffrey Scott},
EDITOR = {Meyer auf der Heide, Friedhelm},
TITLE = {Duality Between Prefetching and Queued Writing with Parallel Disks},
BOOKTITLE = {Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01)},
ORGANIZATION = {EATCS},
PADDRESS = {Berlin, Germany},
ADDRESS = {Aarhus, Denmark},
PUBLISHER = {Springer},
MONTH = {August},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2161},
ISBN = {3-540-42493-8},
YEAR = {2001},
PAGES = {62--73},
ABSTRACT = {Parallel disks promise to be a cost effective means for achieving
high bandwidth in applications involving massive data sets, but
algorithms for parallel disks can be difficult to devise. To combat
this problem, we define a useful and natural duality between writing
to parallel disks and the seemingly more difficult problem of
prefetching. We first explore this duality for applications involving
read-once accesses using parallel disks. We get a simple linear time
algorithm for computing optimal prefetch schedules and analyze the
efficiency of the resulting schedules for randomly placed data and for
arbitrary interleaved accesses to striped sequences. Duality also
provides an optimal schedule for the integrated caching and
prefetching problem, in which blocks can be accessed multiple times.
Another application of this duality gives us the first parallel disk
sorting algorithms that are provably optimal up to lower order terms.
One of these algorithms is a simple and practical variant of multiway
merge sort, addressing a question that has been open for some time.},
}
@INPROCEEDINGS{HutSanVit2001a,
AUTHOR = {Hutchinson, David A. and Sanders, Peter and Vitter, Jeffrey Scott},
TITLE = {The Power of Duality for Prefetching and Sorting with Parallel Disks},
BOOKTITLE = {Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01)},
PADDRESS = {New York},
ADDRESS = {Crete Island, Greece},
PUBLISHER = {ACM},
MONTH = {July},
ISBN = {1-58113-409-6},
YEAR = {2001},
PAGES = {334--335},
}
@INPROCEEDINGS{HybridVC07,
AUTHOR = {Friedrich, Tobias and He, Jun and Hebbinghaus, Nils and Neumann, Frank and Witt, Carsten},
TITLE = {On Improving Approximate Solutions by Evolutionary Algorithms},
BOOKTITLE = {IEEE Congress on Evolutionary Computation 2007},
ORGANIZATION = {IEEE},
PADDRESS = {Vancouver, BC, Canada,},
ADDRESS = {Singapore, Singapore},
PUBLISHER = {IEEE},
ISBN = {1-4244-1340-0},
YEAR = {2007},
PAGES = {2614--2621},
}
@INPROCEEDINGS{ICALP::MehlhornP1989,
AUTHOR = {Mehlhorn, Kurt and Paul, Wolfgang J.},
EDITOR = {Ausiello, Giorgio and Dezani-Ciancaglini, Mariangiola and Ronchi Della Rocca, Simonetta},
TITLE = {Two Versus One Index Register and Modifiable Versus Non-modifiable Programs},
BOOKTITLE = {Automata, languages and programming (ICALP-89) : 16th international colloquium},
PADDRESS = {Berlin, Germany},
ADDRESS = {Stresa, Italy},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {372},
ISBN = {3-540-51371-X},
YEAR = {1989},
PAGES = {603--609},
}
@INPROCEEDINGS{ICALP::MehlhornY1988,
AUTHOR = {Mehlhorn, Kurt and Yap, Chee-Keng},
EDITOR = {Lepist{\"o}, Timo and Salomaa, Arto},
TITLE = {Constructive {Hopf's} Theorem: Or How to Untangle Closed Planar Curves},
BOOKTITLE = {Automata, languages and programming (ICALP-88) : 15th international colloquium},
PADDRESS = {Berlin, Germany},
ADDRESS = {Tampere, Finland},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {317},
YEAR = {1988},
PAGES = {410--423},
}
@ARTICLE{IC::HoffmanMRT1986,
AUTHOR = {Hoffmann, Kurt and Mehlhorn, Kurt and Rosenstiehl, Pierre and Tarjan, Robert E.},
JOURNAL = {Information and Control},
TITLE = {Sorting {Jordan} Sequences in Linear Time Using Level-Linked Search Trees},
ADDRESS = {New York, NY, USA},
NUMBER = {1--3},
PUBLISHER = {Academic Press},
VOLUME = {68},
YEAR = {1986},
PAGES = {170--184},
}
@ARTICLE{IC::MehlhornP1987,
AUTHOR = {Mehlhorn, Kurt and Preparata, Franco P.},
JOURNAL = {Information and Computation},
TITLE = {Area-Time Optimal Division for $T=\Omega((\log n)^{1+\epsilon})$},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {3},
PUBLISHER = {Elsevier},
VOLUME = {72},
ISBN = {0890-5401},
YEAR = {1987},
PAGES = {270--282},
ABSTRACT = {Area-time optimal VLSI division circuits are described for all computation
times in the range for arbitrary > 0.},
}
@MASTERSTHESIS{ImmichDipl01,
AUTHOR = {Immich, Stefan},
TITLE = {{Berechnung der Momente von quadratischen Komplexen}},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
MONTH = {November},
YEAR = {2001},
}
@ARTICLE{ImpBoun2006,
AUTHOR = {Doerr, Benjamin and Hebbinghaus, Nils and Werth, S{\"o}ren},
JOURNAL = {Theoretical Computer Science},
TITLE = {Improved Bounds and Schemes for the Declustering Problem},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {1-3},
PUBLISHER = {Elsevier},
VOLUME = {359},
ISBN = {0304-3975},
YEAR = {2006},
PAGES = {123--132},
ABSTRACT = {The declustering problem is to allocate given data on parallel working storage
devices in such a manner that typical requests find their data evenly
distributed on the devices. Using deep results from discrepancy theory, we
improve previous work of several authors concerning range queries to
higher-dimensional data. We give a declustering scheme with an additive error
of Od(logd-1M) independent of the data size, where d is the dimension, M the
number of storage devices and d-1 does not exceed the smallest prime power in
the canonical decomposition of M into prime powers. In particular, our schemes
work for arbitrary M in dimensions two and three. For general d, they work for
all Md-1 that are powers of two. Concerning lower bounds, we show that a recent
proof of a Ωd(log(d-1)/2M) bound contains an error. We close the gap in the
proof and thus establish the bound.},
}
@INPROCEEDINGS{Imreh2001,
AUTHOR = {Epstein, Leah and Imreh, Csan{\'a}d and van Stee, Rob},
EDITOR = {Diks, Krzysztof and Rytter, Wojciech},
TITLE = {More on weighted servers or FIFO is better than LRU},
BOOKTITLE = {Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002},
ORGANIZATION = {European Association for theoretical Computer Science},
PADDRESS = {Berlin, Germany},
ADDRESS = {Warsawa-Otwock, Poland},
NUMBER = {2420},
PUBLISHER = {Springer},
MONTH = {August},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {August},
YEAR = {2002},
PAGES = {257--268},
ABSTRACT = {We consider a generalized 2-server problem on the uniform space
in which servers have different costs. Previous work focused on the
case where the ratio between these costs was very large.
We give results for varying ratios.
For ratios below 2.2, we present an optimal algorithm which is trackless.
%Furthermore, our algorithm is trackless,
%which means that it is restricted from storing
%explicitly points from the metric space.
We present a general lower bound for trackless algorithms
depending on the cost ratio, proving that our algorithm
is the optimal trackless algorithm up to a constant factor
for any cost ratio.
The results are extended for the case where we have two sets of
servers with different costs.},
}
@MASTERSTHESIS{IngalalliMaster2011,
AUTHOR = {Ingalalli, Vijay},
TITLE = {Evolutionary algorithms to compute lower bounds for the star discrepancy},
SCHOOL = {Universit{\"a}t des Saarlandes},
TYPE = {Master's thesis},
ADDRESS = {Saarbr{\"u}cken},
PUBLISHER = {Universit{\"a}t des Saarlandes},
MONTH = {October},
YEAR = {2011},
PAGES = {XIII,63},
}
@TECHREPORT{INRIA-00340887:1,
AUTHOR = {Emiris, Ioannis Z. and Hemmer, Michael and Karavelas, Menelaos and Mourrain, Bernard and Tsigaridas, Elias P. and Zafeirakopoulos, Zafeirakis},
TITLE = {Experimental evaluation and cross-benchmarking of univariate real solvers},
INSTITUTION = {INRIA},
TYPE = {Rapport de recherche},
ADDRESS = {Sophia Antipolis, France},
NUMBER = {EMIRIS:2008:INRIA-00340887:1},
MONTH = {December},
YEAR = {2008},
PAGES = {20},
}
@ARTICLE{inserpoints2006,
AUTHOR = {Teramoto, Sachio and Asano, Tetsuo and Katoh, Naoki and Doerr, Benjamin},
JOURNAL = {IEICE - Transactions on Information and Systems},
TITLE = {Inserting Points Uniformly at Every Instance},
ADDRESS = {Oxford, UK},
NUMBER = {8},
PUBLISHER = {Oxford University Press},
VOLUME = {E89-D},
ISBN = {0916-8532},
YEAR = {2006},
PAGES = {2348--2356},
ABSTRACT = {Arranging n points as uniformly as possible is a frequently occurring problem.
It is equivalent to packing n equal and non-overlapping circles in a unit
square. In this paper we generalize this problem in such a way that points are
inserted one by one with uniformity preserved at every instance. Our criterion
for uniformity is to minimize the gap ratio (which is the maximum gap over the
minimum gap) at every point insertion. We present a linear time algorithm for
finding an optimal n-point sequence with the maximum gap ratio bounded by 2n/2
/(n/2+1) in the 1-dimensional case. We describe how hard the same problem is
for a point set in the plane and propose a local search heuristics for finding
a good solution.},
}
@INPROCEEDINGS{IntLiar2006,
AUTHOR = {Doerr, Benjamin and Lengler, Johannes and Steurer, Daniel},
EDITOR = {Asano, Tetsuo},
TITLE = {The Interval Liar Game},
BOOKTITLE = {Algorithms and Computation : 17th International Symposium, ISAAC 2006},
PADDRESS = {Berlin, Germany},
ADDRESS = {Kolkata, India},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4288},
ISBN = {3-540-49694-6},
YEAR = {2006},
PAGES = {318--327},
ABSTRACT = {We regard the problem of communication in the presence of faulty
transmissions. In contrast to the classical works in this area, we assume some
structure on the times when the faults occur. More realistic seems the model
that
all faults occur in some small time interval.
Like previous work, our problem can best be modelled as a two-player perfect
information game, in which one player (“Paul”) has to guess a number x from
{1, . . . , n} using Yes/No-questions, which the second player (“Carole”) has to
answer truthfully apart from few lies. In our setting, all lies have to be in a
consecutive
set of k rounds.
We show that Paul needs roughly log n + log log n + k rounds to determine the
number, which is only k more than the case of just one single lie.},
}
@ARTICLE{IPL::FriesMNT1987,
AUTHOR = {Fries, O. and Mehlhorn, Kurt and N{\"a}her, Stefan and Tsakalidis, A.},
JOURNAL = {Information Processing Letters},
TITLE = {A {$\log \log n$} data structure for three-sided range queries},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {4},
PUBLISHER = {Elsevier},
VOLUME = {25},
ISBN = {0020-0190},
YEAR = {1987},
PAGES = {269--273},
}
@ARTICLE{IPL::JungM1988,
AUTHOR = {Jung, Hermann and Mehlhorn, Kurt},
JOURNAL = {Information Processing Letters},
TITLE = {Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {5},
PUBLISHER = {Elsevier},
VOLUME = {27},
ISBN = {0020-0190},
YEAR = {1988},
PAGES = {227--236},
}
@ARTICLE{IPL::Mehlhorn1988,
AUTHOR = {Mehlhorn, Kurt},
JOURNAL = {Information Processing Letters},
TITLE = {A faster approximation algorithm for the {Steiner} problem in graphs},
ADDRESS = {Amsterdam, The Netherlands},
NUMBER = {3},
PUBLISHER = {Elsevier},
VOLUME = {27},
ISBN = {0020-0190},
YEAR = {1988},
PAGES = {125--128},
}
@INPROCEEDINGS{Issac2015Sampling,
AUTHOR = {Issac, Davis},
EDITOR = {Xu, Dachuan and Du, Donglei and Du, Dingzhu},
TITLE = {Sampling in Space Restricted Settings},
BOOKTITLE = {Computing and Combinatorics 2015},
PADDRESS = {Basel, Switzerland},
ADDRESS = {Beijng, China},
PUBLISHER = {Springer},
YEAR = {2015},
}
@ARTICLE{ITMMP2006,
AUTHOR = {Irving, Robert W. and Telikepalli, Kavitha and Mehlhorn, Kurt and Michail, Dimitrios and Paluch, Katarzyna},
JOURNAL = {ACM Transactions on Algorithms},
TITLE = {Rank-Maximal Matchings},
ADDRESS = {New York, USA},
NUMBER = {4},
PUBLISHER = {ACM},
MONTH = {October},
VOLUME = {2},
DOI = {10.1145/1198513.1198520},
YEAR = {2006},
PAGES = {602--610},
ABSTRACT = {Suppose that each member of a set A of applicants ranks a subset of a set P of
posts in an order of preference, possibly involving ties. A matching is a set
of (applicant, post) pairs such that each applicant and each post appears in at
most one pair. A rank-maximal matching is one in which the maximum possible
number of applicants are matched to their first choice post, and subject to
that condition, the maximum possible number are matched to their second choice
post, and so on. This is a relevant concept in any practical matching situation
and it was first studied by Irving [2003].We give an algorithm to compute a
rank-maximal matching with running time O(min(n + C,C√n)m), where C is the
maximal rank of an edge used in a rank-maximal matching, n is the number of
applicants and posts and m is the total size of the preference lists.},
}
@ARTICLE{JACM::MehlhornP1986,
AUTHOR = {Mehlhorn, Kurt and Preparata, F. P.},
JOURNAL = {Journal of the ACM},
TITLE = {Routing through a Rectangle},
ADDRESS = {New York, NY, USA},
NUMBER = {1},
PUBLISHER = {ACM},
VOLUME = {33},
YEAR = {1986},
PAGES = {60--85},
ABSTRACT = {In this paper an O(N log N) algorithm for routing through a rectangle is
presented. Consider an n-by-m rectangular grid and a set of N two-terminal
nets. A net is a pair of points on the boundary of the rectangle. A layout is a
set of edge-disjoint paths, one for each net. Our algorithm constructs a
layout, if there is one, in O(N log N) time; this contrasts favorably with the
area of the layout that might be as large as N2. The layout constructed can be
wired using four layers of interconnect with only O(N) contact cuts. A partial
extension to multiterminal nets is also discussed.},
}
@INPROCEEDINGS{JainKoetzingStephan2011,
AUTHOR = {Jain, Sanjay and K{\"o}tzing, Timo and Stephan, Frank},
EDITOR = {Bshouty, Nader and Stoltz, Gilles and Vayatis, Nicolas and Zeugmann, Thomas},
TITLE = {Enlarging Learnable Classes},
BOOKTITLE = {Algorithmic Learning Theory : 23rd International Conference, ALT 2012},
PADDRESS = {Berlin},
ADDRESS = {Lyon, France},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {7568},
ISBN = {978-3-642-34105-2},
DOI = {10.1007/978-3-642-34106-9_7},
YEAR = {2012},
PAGES = {36--50},
}
@ARTICLE{JALGO::KaufmannM1986,
AUTHOR = {Kaufmann, Michael and Mehlhorn, Kurt},
JOURNAL = {Journal of Algorithms},
TITLE = {Routing through a Generalized Switchbox},
ADDRESS = {Orlando, FL, USA},
NUMBER = {4},
PUBLISHER = {Academic Press},
VOLUME = {7},
YEAR = {1986},
PAGES = {510--531},
}
@INPROCEEDINGS{Janardan-Smid95,
AUTHOR = {Janardan, Ravi and Smid, Michiel},
TITLE = {On the width and roundness of a set of points in the plane},
BOOKTITLE = {7th Canadian Conference on Computational Geometry},
PADDRESS = {-},
ADDRESS = {-},
PUBLISHER = {-},
YEAR = {1995},
PAGES = {193--198},
}
@INPROCEEDINGS{Jansen-Latin-98,
AUTHOR = {Jansen, Klaus},
EDITOR = {Lucchesi, Cl{\'a}udio L. and Moura, Arnaldo V.},
TITLE = {A New Characterization for Parity Graphs and a Coloring Problem with Costs},
BOOKTITLE = {Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (Latin-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Campinas, Brazil},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1380},
ISBN = {30540-64275-7},
YEAR = {1998},
PAGES = {249--260},
}
@INPROCEEDINGS{Jansen-STACS-98,
AUTHOR = {Jansen, Klaus},
EDITOR = {Morvan, Michel and Meinel, Christoph and Krob, Daniel},
TITLE = {The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs},
BOOKTITLE = {Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98)},
PADDRESS = {Berlin, Germany},
ADDRESS = {Paris, France},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1373},
ISBN = {3-540-64230-7},
YEAR = {1998},
PAGES = {287--297},
}
@INPROCEEDINGS{JansenKMS2010,
AUTHOR = {Jansen, Klaus and Kratsch, Stefan and Marx, D{\'a}niel and Schlotter, Ildik{\'o}},
EDITOR = {Kaplan, Haim},
TITLE = {Bin Packing with Fixed Number of Bins Revisited},
BOOKTITLE = {Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory},
PADDRESS = {Berlin},
ADDRESS = {Bergen, Norway},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6139},
ISBN = {978-3-642-13730-3},
DOI = {10.1007/978-3-642-13731-0_25},
YEAR = {2010},
PAGES = {260--272},
}
@ARTICLE{JansenNeumann2010,
AUTHOR = {Jansen, Thomas and Neumann, Frank},
JOURNAL = {Evolutionary Computation},
TITLE = {Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization},
ADDRESS = {Cambridge, Mass.},
NUMBER = {3},
PUBLISHER = {MIT Press},
VOLUME = {18},
ISBN = {1063-6560},
DOI = {10.1162/EVCO_e_00019},
YEAR = {2010},
PAGES = {333--334},
}
@ARTICLE{JansenPorkolab2002,
AUTHOR = {Jansen, Klaus and Porkolab, Lorant},
JOURNAL = {Algorithmica},
TITLE = {Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks},
ADDRESS = {Berlin, Germany},
NUMBER = {3},
PUBLISHER = {Springer},
VOLUME = {32},
ISBN = {0178-4617},
YEAR = {2002},
PAGES = {507--520},
}
@INCOLLECTION{JansenSolisObaSviridenko2000,
AUTHOR = {Jansen, Klaus and Solis-Oba, Roberto and Sviridenko, Maxim},
EDITOR = {Pardalos, Panos M.},
TITLE = {Linear time approximation schemes for shop scheduling problems},
BOOKTITLE = {Approximation and complexity in numerical optimization},
ADDRESS = {Dordrecht, The Netherlands},
PUBLISHER = {Kluwer},
SERIES = {Nonconvex optimization and its applications},
VOLUME = {42},
ISBN = {0-7923-6275-6},
YEAR = {2000},
PAGES = {338--346},
}
@ARTICLE{Jez2008ICALP,
AUTHOR = {Jez, Artur and Okhotin, Alexander},
JOURNAL = {Information and Computation},
TITLE = {Computational completeness of equations over sets of natural numbers},
ADDRESS = {Amsterdam, The Netherlands},
PUBLISHER = {Elsevier},
MONTH = {October},
VOLUME = {237},
ISBN = {0890-5401},
YEAR = {2014},
PAGES = {56--94},
ABSTRACT