Search the dblp DataBase
Jörg Flum :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
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 ] 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 ] Jörg Flum On Bounded Theories. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:111-118 [Conf ] Jörg Flum , Martin Grohe The Parameterized Complexity of Counting Problems. [Citation Graph (0, 0)][DBLP ] FOCS, 2002, pp:538-0 [Conf ] Jörg Flum , Martin Grohe , Mark Weyer Bounded Fixed-Parameter Tractability and log2 n Nondeterministic Bits. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:555-567 [Conf ] Jörg Flum , Markus Frick , Martin Grohe Query Evaluation via Tree-Decompositions. [Citation Graph (0, 14)][DBLP ] ICDT, 2001, pp:22-38 [Conf ] 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 ] Yijia Chen , Jörg Flum On Miniaturized Problems in Parameterized Complexity Theory. [Citation Graph (0, 0)][DBLP ] IWPEC, 2004, pp:108-120 [Conf ] Yijia Chen , Jörg Flum The Parameterized Complexity of Maximality and Minimality Problems. [Citation Graph (0, 0)][DBLP ] IWPEC, 2006, pp:25-37 [Conf ] 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 ] Jörg Flum , Martin Grohe Describing Parameterized Complexity Classes. [Citation Graph (0, 0)][DBLP ] STACS, 2002, pp:359-371 [Conf ] Jörg Flum , Martin Grohe Fixed-parameter tractability, definability, and model checking [Citation Graph (0, 0)][DBLP ] CoRR, 1999, v:0, n:, pp:- [Journal ] 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 ] 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 ] 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 ] 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 ] Jörg Flum , Martin Grohe , Mark Weyer Bounded fixed-parameter tractability and log2 n nondeterministic bits. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2006, v:72, n:1, pp:34-71 [Journal ] 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 ] Jörg Flum L(Q)-Preservation Theorems. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1975, v:40, n:3, pp:410-418 [Journal ] 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 ] 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 ] 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 ] 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 ] 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 ] Jörg Flum Games, Kernels, and Antitone Operations. [Citation Graph (0, 0)][DBLP ] Order, 2000, v:17, n:1, pp:61-73 [Journal ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] Jörg Flum Parameterized Complexity and Logic. [Citation Graph (0, 0)][DBLP ] CiE, 2007, pp:278-289 [Conf ] 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 ] 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 ] 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 ] 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 ] A Logic for PTIME and a Parameterized Halting Problem. [Citation Graph (, )][DBLP ] Lower Bounds for Kernelizations and Other Preprocessing Procedures. [Citation Graph (, )][DBLP ] On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT. [Citation Graph (, )][DBLP ] On p -Optimal Proof Systems and Logics for PTIME. [Citation Graph (, )][DBLP ] A Logic for PTIME and a Parameterized Halting Problem. [Citation Graph (, )][DBLP ] The parameterized complexity of maximality and minimality problems. [Citation Graph (, )][DBLP ] A logic for PTIME and a parameterized halting problem. [Citation Graph (, )][DBLP ] Lower Bounds for Kernelizations. [Citation Graph (, )][DBLP ] Search in 0.019secs, Finished in 0.021secs