The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jörg Flum: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yijia Chen, Jörg Flum, Martin Grohe
    Bounded Nondeterminism and Alternation in Parameterized Complexity Theory. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:13-29 [Conf]
  2. Yijia Chen, Jörg Flum
    Machine Characterization of the Classes of the W-Hierarchy. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:114-127 [Conf]
  3. Jörg Flum
    On Bounded Theories. [Citation Graph (0, 0)][DBLP]
    CSL, 1991, pp:111-118 [Conf]
  4. Jörg Flum, Martin Grohe
    The Parameterized Complexity of Counting Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:538-0 [Conf]
  5. Jörg Flum, Martin Grohe, Mark Weyer
    Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:555-567 [Conf]
  6. Jörg Flum, Markus Frick, Martin Grohe
    Query Evaluation via Tree-Decompositions. [Citation Graph (0, 14)][DBLP]
    ICDT, 2001, pp:22-38 [Conf]
  7. Jörg Flum, Max Kubierschky, Bertram Ludäscher
    Total and Partial Well-Founded Datalog Coincide. [Citation Graph (0, 7)][DBLP]
    ICDT, 1997, pp:113-124 [Conf]
  8. Yijia Chen, Jörg Flum
    On Miniaturized Problems in Parameterized Complexity Theory. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:108-120 [Conf]
  9. Yijia Chen, Jörg Flum
    The Parameterized Complexity of Maximality and Minimality Problems. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2006, pp:25-37 [Conf]
  10. Jörg Flum, Martin Grohe
    Model-Checking Problems as a Basis for Parameterized Intractability. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:388-397 [Conf]
  11. Jörg Flum, Martin Grohe
    Describing Parameterized Complexity Classes. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:359-371 [Conf]
  12. Jörg Flum, Martin Grohe
    Fixed-parameter tractability, definability, and model checking [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  13. Jörg Flum
    Tree-Decompositions and the Model-Checking Problem. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2001, v:73, n:, pp:78-98 [Journal]
  14. Jörg Flum, Martin Grohe
    Parametrized Complexity and Subexponential Time (Column: Computational Complexity). [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2004, v:84, n:, pp:71-100 [Journal]
  15. Jörg Flum, Martin Grohe
    Describing parameterized complexity classes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:187, n:2, pp:291-319 [Journal]
  16. Jörg Flum, Markus Frick, Martin Grohe
    Query evaluation via tree-decompositions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:6, pp:716-752 [Journal]
  17. Jörg Flum, Martin Grohe, Mark Weyer
    Bounded fixed-parameter tractability and log2n nondeterministic bits. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:1, pp:34-71 [Journal]
  18. Jörg Flum
    A Remark on Infinitary Languages. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1971, v:36, n:3, pp:461-462 [Journal]
  19. Jörg Flum
    L(Q)-Preservation Theorems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1975, v:40, n:3, pp:410-418 [Journal]
  20. Jörg Flum, Martin Grohe
    On Fixed-Point Logic With Counting. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:2, pp:777-787 [Journal]
  21. Jörg Flum, Juan Carlos Martínez
    On Topological Spaces Equivalent to Ordinals. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1988, v:53, n:3, pp:785-795 [Journal]
  22. Jörg Flum, Martin Ziegler 0002
    Pseudo-Finite Homogeneity and Saturation. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:4, pp:1689-1699 [Journal]
  23. Jörg Flum, Martin Grohe
    Model-checking problems as a basis for parameterized intractability. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2005, v:1, n:1, pp:- [Journal]
  24. Jörg Flum
    An Extension of the Lemma of Rasiowa and Sikorski. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1998, v:44, n:, pp:509-514 [Journal]
  25. Jörg Flum
    Games, Kernels, and Antitone Operations. [Citation Graph (0, 0)][DBLP]
    Order, 2000, v:17, n:1, pp:61-73 [Journal]
  26. Jörg Flum, Matthias Schiehlen, Jouko A. Väänänen
    Quantifiers and Congruence Closure. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1999, v:62, n:3, pp:315-340 [Journal]
  27. Jörg Flum, Martin Grohe
    Fixed-Parameter Tractability, Definability, and Model-Checking. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:1, pp:113-145 [Journal]
  28. Jörg Flum, Martin Grohe
    The Parameterized Complexity of Counting Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:4, pp:892-922 [Journal]
  29. Yijia Chen, Jörg Flum
    On miniaturized problems in parameterized complexity theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:351, n:3, pp:314-336 [Journal]
  30. Yijia Chen, Jörg Flum, Martin Grohe
    Machine-based methods in parameterized complexity theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:339, n:2-3, pp:167-199 [Journal]
  31. Jörg Flum, Max Kubierschky, Bertram Ludäscher
    Games and total Datalog¬ queries. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:239, n:2, pp:257-276 [Journal]
  32. Jörg Flum
    Parameterized Complexity and Logic. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:278-289 [Conf]
  33. Yijia Chen, Jörg Flum
    On Parameterized Path and Chordless Path Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:250-263 [Conf]
  34. Yijia Chen, Jörg Flum
    Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:389-404 [Conf]
  35. Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer
    Bounded fixed-parameter tractability and reducibility. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2007, v:148, n:1-3, pp:1-19 [Journal]
  36. Jörg Flum, Martin Grohe
    Model-Checking Problems as a Basis for Parameterized Intractability [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]

  37. A Logic for PTIME and a Parameterized Halting Problem. [Citation Graph (, )][DBLP]


  38. Lower Bounds for Kernelizations and Other Preprocessing Procedures. [Citation Graph (, )][DBLP]


  39. On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT. [Citation Graph (, )][DBLP]


  40. On p-Optimal Proof Systems and Logics for PTIME. [Citation Graph (, )][DBLP]


  41. A Logic for PTIME and a Parameterized Halting Problem. [Citation Graph (, )][DBLP]


  42. The parameterized complexity of maximality and minimality problems. [Citation Graph (, )][DBLP]


  43. A logic for PTIME and a parameterized halting problem. [Citation Graph (, )][DBLP]


  44. Lower Bounds for Kernelizations. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
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