Conferences in DBLP

Discrete Mathematics and Theoretical Computer Science (dmtcs)
2003 (conf/dmtcs/2003)

1. Gregory J. Chaitin
   Two Philosophical Applications of Algorithmic Information Theory. [Citation Graph (0, 0)][DBLP]
   DMTCS, 2003, pp:1-10 [Conf]
   
2. Cunsheng Ding, Jin Yuan
   Covering and Secret Sharing with Linear Codes. [Citation Graph (0, 0)][DBLP]
   DMTCS, 2003, pp:11-25 [Conf]
   
3. Bjarni V. Halldórsson, Vineet Bafna, Nathan Edwards, Ross Lippert, Shibu Yooseph, Sorin Istrail
   Combinatorial Problems Arising in SNP and Haplotype Analysis. [Citation Graph (0, 0)][DBLP]
   DMTCS, 2003, pp:26-47 [Conf]
   
4. Maurice Margenstern
   Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey. [Citation Graph (0, 0)][DBLP]
   DMTCS, 2003, pp:48-72 [Conf]
   
5. Timothy Walsh
   Generating Gray Codes in O(1) Worst-Case Time per Word. [Citation Graph (0, 0)][DBLP]
   DMTCS, 2003, pp:73-88 [Conf]
   
6. Sammani D. Abdullahi, Martin E. Dyer, Les G. Proll
   Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems. [Citation Graph (0, 0)][DBLP]
   DMTCS, 2003, pp:89-96 [Conf]
   
7. Klaus Ambos-Spies, Edgar Busse
   Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata. [Citation Graph (0, 0)][DBLP]
   DMTCS, 2003, pp:97-108 [Conf]
   
8. Marian Alexandru Baroni
   On the Order Dual of a Riesz Space. [Citation Graph (0, 0)][DBLP]
   DMTCS, 2003, pp:109-117 [Conf]
   
9. Symeon Bozapalidis, Antonios Kalampakas
   A Finite Complete Set of Equations Generating Graphs. [Citation Graph (0, 0)][DBLP]
   DMTCS, 2003, pp:118-128 [Conf]
   
10. Alberto Del Lungo, Andrea Frosini, Simone Rinaldi
    ECO Method and the Exhaustive Generation of Convex Polyominoes. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:129-140 [Conf]
    
11. Catalin Dima
    Regular Expressions with Timed Dominoes. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:141-154 [Conf]
    
12. Olivier Finkel
    On Infinitary Rational Relations and Borel Sets. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:155-167 [Conf]
    
13. Frédéric Gardi
    Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:168-180 [Conf]
    
14. André Große, Harald Hempel
    On Functions and Relations. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:181-192 [Conf]
    
15. Mustapha Kchikech, Olivier Togni
    Paths Coloring Algorithms in Mesh Networks. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:193-202 [Conf]
    
16. Bakhadyr Khoussainov
    Finite State Strategies in One Player McNaughton Games. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:203-214 [Conf]
    
17. Mark Korenblit, Vadim E. Levit
    On Algebraic Expressions of Series-Parallel and Fibonacci Graphs. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:215-224 [Conf]
    
18. Sven Kosub
    Boolean NP-Partitions and Projective Closure. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:225-236 [Conf]
    
19. Vadim E. Levit, Eugen Mandrescu
    On Unimodality of Independence Polynomials of Some Well-Covered Trees. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:237-256 [Conf]
    
20. Val Pinciu
    A Coloring Algorithm for Finding Connected Guards in Art Galleries. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:257-264 [Conf]
    
21. K. Subramani
    An Analysis of Quantified Linear Programs. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:265-277 [Conf]
    
22. Etsuji Tomita, Tomokazu Seki
    An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:278-289 [Conf]
    
23. Xizhong Zheng, George Barmpalias
    On the Monotonic Computability of Semi-computable Real Numbers. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:290-300 [Conf]