Discrete mathematics and theoretical computer science. 4th international conference, DMTCS 2003, Dijon, France, July 7--12, 2003. Proceedings (Q1414848)

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 0967.00065). Indexed articles: \textit{Chaitin, Gregory}, Two philosophical applications of algorithmic information theory, 1-10 [Zbl 1038.68054] \textit{Ding, Cunsheng; Yuan, Jin}, Covering and secret sharing with linear codes, 11-25 [Zbl 1038.94008] \textit{Halldórsson, Bjarni V.; Bafna, Vineet; Edwards, Nathan; Lippert, Ross; Yooseph, Shibu; Istrail, Sorin}, Combinatorial problems arising in SNP and haplotype analysis, 26-47 [Zbl 1040.92026] \textit{Margenstern, Maurice}, Cellular automata and combinatoric tilings in hyperbolic spaces. A survey, 48-72 [Zbl 1040.68062] \textit{Walsh, Timothy}, Generating Gray codes in \(O(1)\) worst-case time per word, 73-88 [Zbl 1038.68566] \textit{Abdullahi, Sammani D.; Dyer, Martin E.; Proll, Les G.}, Listing vertices of simple polyhedra associated with dual LI(2) systems, 89-96 [Zbl 1038.68575] \textit{Ambos-Spies, Klaus; Busse, Edgar}, Automatic forcing and genericity: On the diagonalization strength of finite automata, 97-108 [Zbl 1038.03046] \textit{Baroni, Marian Alexandru}, On the order dual of a Riesz space, 109-117 [Zbl 1038.03055] \textit{Bozapalidis, Symeon; Kalampakas, Antonios}, A finite complete set of equations generating graphs, 118-128 [Zbl 1038.68085] \textit{Del Lungo, Alberto; Frosini, Andrea; Rinaldi, Simone}, ECO method and the exhaustive generation of convex polyominoes, 129-140 [Zbl 1038.68084] \textit{Dima, Cătălin}, Regular expressions with timed dominoes, 141-154 [Zbl 1040.68052] \textit{Finkel, Olivier}, On infinitary rational relations and Borel sets, 155-167 [Zbl 1040.03033] \textit{Gardi, Frédéric}, Efficient algorithms for disjoint matchings among intervals and related problems, 168-180 [Zbl 1038.68148] \textit{Große, André; Hempel, Harald}, On functions and relations, 181-192 [Zbl 1040.68044] \textit{Kchikech, Mustapha; Togni, Olivier}, Paths coloring algorithms in mesh networks, 193-202 [Zbl 1038.68944] \textit{Khoussainov, Bakhadyr}, Finite state strategies in one player McNaughton games, 203-214 [Zbl 1038.91024] \textit{Korenblit, Mark; Levit, Vadim E.}, On algebraic expressions of series-parallel and Fibonacci graphs, 215-224 [Zbl 1038.68086] \textit{Kosub, Sven}, Boolean NP-partitions and projective closure, 225-236 [Zbl 1038.68050] \textit{Levit, Vadim E.; Mandrescu, Eugen}, On unimodality of independence polynomials of some well-covered trees, 237-256 [Zbl 1039.05022] \textit{Pinciu, Val}, A coloring algorithm for finding connected guards in art galleries, 257-264 [Zbl 1038.68137] \textit{Subramani, K.}, An analysis of quantified linear programs, 265-277 [Zbl 1038.90052] \textit{Tomita, Etsuji; Seki, Tomokazu}, An efficient branch-and-bound algorithm for finding a maximum clique, 278-289 [Zbl 1038.68565] \textit{Zheng, Xizhong; Barmpalias, George}, On the monotonic computability of semi-computable real numbers, 290-300 [Zbl 1038.03056]