The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sebastian Seibert: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
    On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:189-200 [Conf]
  2. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:72-86 [Conf]
  3. Sebastian Seibert, Walter Unger
    The Hardness of Placing Street Names in a Manhattan Type Map. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:102-112 [Conf]
  4. Sebastian Seibert
    Quantifier Hierarchies over Word Relations. [Citation Graph (0, 0)][DBLP]
    CSL, 1991, pp:329-352 [Conf]
  5. Sebastian Seibert, Thomas Wilke
    Bounds for Approximating MAXLINEQ3-2 and MAXEKSAT. [Citation Graph (0, 0)][DBLP]
    Lectures on Proof Verification and Approximation Algorithms, 1997, pp:179-212 [Conf]
  6. Sebastian Seibert
    Efficient Transformations from Regular Expressions to Finite Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:28-42 [Conf]
  7. Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
    On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:59-70 [Conf]
  8. Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
    Measures of Nondeterminism in Finite Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:199-210 [Conf]
  9. Sebastian Seibert, Walter Unger
    A 1.5-Approximation of the Minimal Manhattan Network Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:246-255 [Conf]
  10. Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert
    On the Stability of Approximation for Hamiltonian Path Problems. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:147-156 [Conf]
  11. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:382-394 [Conf]
  12. Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas
    Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:365-375 [Conf]
  13. Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
    Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:55-66 [Conf]
  14. Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
    Measures of Nondeterminism in Finite Automata [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:76, pp:- [Journal]
  15. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:31, pp:- [Journal]
  16. Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas
    Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:125, n:1, pp:32-45 [Journal]
  17. Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger
    Communication Complexity Method for Measuring Nondeterminism in Finite Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:172, n:2, pp:202-217 [Journal]
  18. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    Approximation algorithms for the TSP with sharpened triangle inequality. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:3, pp:133-138 [Journal]
  19. Hans-Joachim Böckenhauer, Sebastian Seibert
    Improved lower bounds on the approximability of the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:3, pp:213-255 [Journal]
  20. Mika Hirvensalo, Sebastian Seibert
    Lower Bounds for Las Vegas Automata by Information Theory. [Citation Graph (0, 0)][DBLP]
    ITA, 2003, v:37, n:1, pp:39-49 [Journal]
  21. Juraj Hromkovic, Sebastian Seibert, Thomas Wilke
    Translating Regular Expressions into Small -Free Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:4, pp:565-588 [Journal]
  22. Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
    On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:137-153 [Journal]
  23. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:285, n:1, pp:3-24 [Journal]
  24. Sebastian Seibert, Walter Unger
    The hardness of placing street names in a Manhattan type map. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:285, n:1, pp:89-99 [Journal]
  25. Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert
    On the Stability of Approximation for Hamiltonian Path Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmic Operations Research, 2006, v:1, n:1, pp:- [Journal]

  26. Reoptimization of the Shortest Common Superstring Problem. [Citation Graph (, )][DBLP]


  27. The Minimal Manhattan Network Problem in Three Dimensions. [Citation Graph (, )][DBLP]


Search in 0.026secs, Finished in 0.027secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002