Veröffentlichungen der Mitarbeiter (Gruppe Srivastav)
Ahuja, Nitin:
N. A.:
Application of genetic algorithms and simulated annealing algorithms.
MastersThesis, IIT Bombay, 1999
\cite{AHUJA:99A}
N. A. and Anand Srivastav:
Improved approximation algorithms for hypergraph coloring and resource constrained scheduling.
preprint, 2001, submitted
\cite{AHUJA:01A}
Baltz, Andreas:
A. B.:
Über exakte Numerierungen von Graphen, insbesonders von Kreisen.
MastersThesis, University of Kiel, 1997
\cite{BALTZ:97A}
A. B.:
Algorithmic and probabilistic aspects of the bipartite traveling salesman problem.
PhD Thesis, University of Kiel, 2001
\cite{BALTZ:01A}
A. B. and T. Schoen:
The structure of maximum subsets of {1,...,n} with no solutions to a+b=kc.
preprint, 1999
\cite{BALTZ:99A}
A. B., T. Schoen and A. Srivastav:
Probabilistic construction of small strongly sum-free sets via large Sidon sets.
Colloq. Math. 86 No. 2, 171 - 176, 2000
\cite{BALTZ:00A}
A. B., T. Schoen and A. Srivastav:
Probabilistic analysis of bipartite traveling salesman problems.
Electronic Notes in Discrete Mathematics 7, Elsevier Science, 2001
\cite{BALTZ:01B}
A. B. and A. Srivastav
Approximation algorithms for the euclidean bipartite TSP.
preprint, 2001
\cite{BALTZ:01C}
A. B., T. Schoen and A. Srivastav
On the b-partite asymmetric traveling salesman problem and its assignment relaxation.
preprint, 2001
\cite{BALTZ:01D}
Doerr, Benjamin:
B. D.:
J(T)-Komponenten.
MastersThesis, University Kiel, 1998.
\cite{DOERR:98A}
B. D., A. Srivastav and P. Wehr:
Discrepancies of cartesian products of arithmetic progressions.
Technical Report 98-42, Berichtsreihe des Mathematischen Seminars der Universität Kiel, 1998.
\cite{DOERR:98B}
B. D.:
Communication complexity and the protocol partition number.
Technical Report 99-28, Berichtsreihe des Mathematischen Seminars der Universität Kiel, 1999.
\cite{DOERR:99A}
B. D. and A. Srivastav:
Approximation of multi-color discrepancy.
In D. Hochbaum, K. Jansen, J. D. P. Rolim, and A. Sinclair, editors, Randomization, Approximation and
Combinatorial Optimization, volume 1671 of Lecture Notes in Computer Science, pages 39-50,
Berlin-Heidelberg, 1999. Springer Verlag.
\cite{DOERR:99B}
B. D.:
Linear and hereditary discrepancy.
Combinatorics, Probability and Computing, 9:349-354, 2000.
\cite{DOERR :00A}
B. D.:
Linear discrepancy of basic unimodular matrices.
Electron. J. Combin., 7:Research Paper 48, approx. 4 pp. (electronic), 2000.
\cite{DOERR:00B}
B. D.:
Multi-Color Discrepancies.
Dissertation, Christian-Albrechts-Universität zu Kiel, 2000.
\cit e{DOERR:00C}
B. D., A. Srivastav and P. Wehr:
Multi-color discrepancy of higher dimensional arithmetic progressions.
Preprint, 12 pages, 2000.
\cite{DOERR:00D}
G. Agnarsson, B. D. and T. Schoen:
Coloring t-dimensional m-boxes.
Discrete Math. 226, 21-33, 2001
\cite{AGNARSSON:01A}
B. D.:
Lattice approximation and linear discrepancy of totally unimodular matrices.
In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 119-125, 2001.
To appear in Combinatorica.
\cite{DOERR:01A}
B. D. and A. Srivastav:
Recursive randomized coloring beats fair dice random colorings.
In A. Ferreira and H. Reichel, editors, Proceedings of the 18th Annual Symposium on Theoretical Aspects of
Computer Science (STACS) 2001, volume 2010 of Lecture Notes in Computer Science, pages 183-194,
Berlin-Heidelberg, 2001. Springer Verlag.
\cite{DOERR:01B}
B. D.:
Structured randomized rounding and coloring.
In Proceedings of the 1st International Workshop on Efficient Algorithms (WEA 2001),
Lecture Notes in Computer Science, Berlin-Heidelberg, 2001. Springer Verlag.
To appear.
\cite{DOERR:01C}
B. D.:
Discrepancy in different numbers of colors.
Discrete Mathematics, 2001.
To appear.
\cite{DOERR:01D}
B. D.:
Vector balancing games respecting aging.
J. Comb. Theory Ser. A, 2001.
To appear.
\cite{DOERR:01E}
B. D. and A. Srivastav:
Multi-color discrepancies.
In Jayme Szwarcfiter and Siang Song, editors, Electronic Notes in Discrete Mathematics, volume 7.
Elsevier Science Publishers, 2001.
\cite {DOERR:01F}
B. D. and A. Srivastav:
Multicolor discrepancies of arithmetic progressions.
In Electronic Notes in Discrete Mathematics. Elsevier Science Publishers, 2001.
To appear.
\cite{DOERR:01G}
B. D. and A. Srivastav:
Multi-color discrepancies.
Submitted, 37 pages, 2001.
\cite{DOERR:01H}
Schoen, Tomasz:
T. S.:
Ultrafilters and Ramsey Theory.
MastersThesis, Adam Mickiewicz University, Poznan, 1991
\cite{SCHOEN:91A}
T. S.:
Sum-free sets.
PhdThesis, Adam Mickiewicz University, Poznan, 1997
\cite{SCHOEN:97A}
T. S.:
Combinatorial number theory.
Habilitationsschrift, University of Kiel, 2001
\cite{SCHOEN:01E}
T. Luczak and T. S.:
On strongly sum-free subsets of abelian groups.
Colloq. Math. 71, 149 - 151, 1996
\cite{LUCZAK:96A}
T. Luczak and T. S.:
On large sum-free sets of abelian groups.
submitted
\cite{LUCZAK:96B}
T. Luczak and T. S.:
On infinite sum-free sets of natural numbers.
J. Numb. Theory 66, 1997, 211-224
\cite{LUCZAK:97A}
T. Luczak, V. Rödl and T. S.:
Independent finite sums in graphs defined on the natural numbers.
Discrete Math. 181, 1998, 289-294
\cite{LUCZAK:98A}
T. Luczak and T. S.:
Small bases for finite groups.
Coll. Math. 78 No 1, 1998, 35 - 37,
\cite{LUCZAK:98B}
T. S.:
On sets of natural numbers whose sumset is free of squares.
J. Combin. Theory Ser. A 88, 385 - 388, 1999
\cite{SCHOEN:99A}
T. S.:
On the density of universal sum-free sets.
Combinatorics, Probability and Computing 8, 277 - 280, 1999
\cite{SCHOEN:99B}
T. S.:
The number of monochromatic Schur triples.
European J. Combin. 20, 855 - 866, 1999
\cite{SCHOEN:99C}
T. S.:
On the density of sets summing to no square.
to appear in Journal of Combinatorial Theory A, 1999
\cite{SCHOEN:99D}
T. S.:
On the number of (k,l) sum-free sets.
Technical report, University Kiel, 1999
\cite{SCHOEN:99E}
A. Baltz and T. S.:
The structure of maximum subsets of {1,...,n} with no solutions to a+b=kc.
preprint, 1999
\cite{BALTZ:99A}
A. Baltz, T. S. and A. Srivastav:
Probabilistic construction of small strongly sum-free sets via large Sidon sets.
Colloq. Math. 86 No. 2, 171 - 176, 2000
\cite{BALTZ:00A}
T. S.:
On sets of natural numbers without solutions to a noninvariant linear equation.
Acta Arithm. 93, 149 - 155, 2000
\cite{SCHOEN:00A}
T. Luczak and T. S.:
On the maximal density of sum-free sets
Acta Arithm. 95, 225 - 229, 2000
\cite{LUCZAK:00A}
T. S.:
On the density of sets containing no three distinct numbers with all their sums.
Results in Math. 38, 144 - 151, 2000
\cite{SCHOEN:00B}
T. S.:
A note on the number of (k,l)-sum-free sets.
Electronic J. Combin., R30, 2000
\cite{SCHOEN:00C}
G. Agnarsson, B. Doerr and T. S.:
Coloring t-dimensional m-boxes.
Discrete Math. 226, 21 - 33, 2001
\cite{AGNARSSON:01A}
A. Baltz, T. S. and A. Srivastav:
Probabilistic analysis of bipartite traveling salesman problems.
Electronic Notes in Discrete Mathematics 7, Elsevier Science, 2001
\cite{BALTZ:01B}
A. Baltz, T. S. and A. Srivastav
On the b-partite asymmetric traveling salesman problem and its assignment relaxation.
preprint, 2001
\cite{BALTZ:01D}
T. S.:
On a problem of Erdös and Sárközy.
J. Combin. Theory Ser. A 94, 191 - 195, 2001
\cite{SCHOEN:01A}
T. Luczak and T. Schoen:
Sum-free subsets of right cancellative semigroups.
to appear in European J. Combinn, 2001
\cite{LUCZAK:01A}
T. S.:
The cardinality of restricted sumsets.
to appear in J. Number Theory, 2001
\cite{SCHOEN:01B}
V. F. Lev, T. Luczak and T. S.:
Sum-free sets in abelian groups.
to appear in Israel. J. Math., 2001
\cite{LEV:01A}
T. Luczak and T. S.:
On the number of maximal sum-free sets.
to appear in Proc. Am. Math. Soc., 2001
\cite{LUCZAK:01B}
T. S.:
The number of (2,3)-sum-free subsets of {1,...,n}
to appear in Acta Arithm., 2001
\cite{SCHOEN:01C}
T. S.:
The distribution of Sidon subsets of Zn.
to appear in Arch. Math., 2001
\cite{SCHOEN:01D}
V. F. Lev and T. S.:
Cameron-Erdös modulo a prime.
submitted to Finite Fields Theory & Applications, 2001
\cite{LEV:01B}
T. Luczak and T. S.:
Integer sets containing no solutions to linear equations.
submitted to J. Number Theory, 2001
\cite{LUCZAK:01C}
Mail an
WebMaster
[Thu Mai 10 15:53:36 MET 2001]
Impressum