4. DMTCS 2003:
Dijon,
France
Cristian Calude, Michael J. Dinneen, Vincent Vajnovszki (Eds.):
Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings.
Lecture Notes in Computer Science 2731 Springer/DMTCS 2003, ISBN 3-540-40505-4 BibTeX
@proceedings{DBLP:conf/dmtcs/2003,
editor = {Cristian Calude and
Michael J. Dinneen and
Vincent Vajnovszki},
title = {Discrete Mathematics and Theoretical Computer Science, 4th International
Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings},
booktitle = {DMTCS},
publisher = {Springer DMTCS},
series = {Lecture Notes in Computer Science},
volume = {2731},
year = {2003},
isbn = {3-540-40505-4},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Papers
Contributed Papers
- Sammani D. Abdullahi, Martin E. Dyer, Les G. Proll:
Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems.
89-96
Electronic Edition (Springer LINK) BibTeX
- Klaus Ambos-Spies, Edgar Busse:
Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata.
97-108
Electronic Edition (Springer LINK) BibTeX
- Marian Alexandru Baroni:
On the Order Dual of a Riesz Space.
109-117
Electronic Edition (Springer LINK) BibTeX
- Symeon Bozapalidis, Antonios Kalampakas:
A Finite Complete Set of Equations Generating Graphs.
118-128
Electronic Edition (Springer LINK) BibTeX
- Alberto Del Lungo, Andrea Frosini, Simone Rinaldi:
ECO Method and the Exhaustive Generation of Convex Polyominoes.
129-140
Electronic Edition (Springer LINK) BibTeX
- Catalin Dima:
Regular Expressions with Timed Dominoes.
141-154
Electronic Edition (Springer LINK) BibTeX
- Olivier Finkel:
On Infinitary Rational Relations and Borel Sets.
155-167
Electronic Edition (Springer LINK) BibTeX
- Frédéric Gardi:
Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems.
168-180
Electronic Edition (Springer LINK) BibTeX
- André Große, Harald Hempel:
On Functions and Relations.
181-192
Electronic Edition (Springer LINK) BibTeX
- Mustapha Kchikech, Olivier Togni:
Paths Coloring Algorithms in Mesh Networks.
193-202
Electronic Edition (Springer LINK) BibTeX
- Bakhadyr Khoussainov:
Finite State Strategies in One Player McNaughton Games.
203-214
Electronic Edition (Springer LINK) BibTeX
- Mark Korenblit, Vadim E. Levit:
On Algebraic Expressions of Series-Parallel and Fibonacci Graphs.
215-224
Electronic Edition (Springer LINK) BibTeX
- Sven Kosub:
Boolean NP-Partitions and Projective Closure.
225-236
Electronic Edition (Springer LINK) BibTeX
- Vadim E. Levit, Eugen Mandrescu:
On Unimodality of Independence Polynomials of Some Well-Covered Trees.
237-256
Electronic Edition (Springer LINK) BibTeX
- Val Pinciu:
A Coloring Algorithm for Finding Connected Guards in Art Galleries.
257-264
Electronic Edition (Springer LINK) BibTeX
- K. Subramani:
An Analysis of Quantified Linear Programs.
265-277
Electronic Edition (Springer LINK) BibTeX
- Etsuji Tomita, Tomokazu Seki:
An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique.
278-289
Electronic Edition (Springer LINK) BibTeX
- Xizhong Zheng, George Barmpalias:
On the Monotonic Computability of Semi-computable Real Numbers.
290-300
Electronic Edition (Springer LINK) BibTeX
Copyright © Sat May 16 23:07:15 2009
by Michael Ley (ley@uni-trier.de)