Jörg Flum - RankMe

96 papers A* 8A 5B 12C 4Journal 52Unranked 7

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	On algorithms based on finitely many homomorphism counts. Inf. Comput. Yijia Chen, Jörg Flum, Mingjun Liu, Zhiyang Xun
2025	J	`jnl`	Some remarks on the uncolored versions of the original CFI-graphs. CoRR Yijia Chen, Jörg Flum, Mingjun Liu
2024	J	`jnl`	Forbidden induced subgraphs and the łOś-Tarski Theorem. J. Symb. Log. Yijia Chen, Jörg Flum
2022	J	`jnl`	A Surprising Relationship Between Descriptive Complexity and Proof Complexity. Bull. EATCS Yijia Chen, Jörg Flum, Moritz Müller
2022	B	`conf`	On Algorithms Based on Finitely Many Homomorphism Counts. MFCS Yijia Chen, Jörg Flum, Mingjun Liu, Zhiyang Xun
2021	A*	`conf`	Forbidden Induced Subgraphs and the Łoś-Tarski Theorem. LICS Yijia Chen, Jörg Flum
2021	J	`jnl`	On Queries Determined by a Constant Number of Homomorphism Counts. CoRR Yijia Chen, Jörg Flum, Mingjun Liu, Zhiyang Xun
2020	B	`conf`	FO-Definability of Shrub-Depth. CSL Yijia Chen, Jörg Flum
2020	J	`jnl`	Forbidden Induced Subgraphs and the Łoś-Tarski Theorem. CoRR Yijia Chen, Jörg Flum
2020	—	`conf`	Parameterized Parallel Computing and First-Order Logic. Fields of Logic and Computation III Yijia Chen, Jörg Flum
2019	J	`jnl`	Some lower bounds in parameterized AC Inf. Comput. Yijia Chen, Jörg Flum
2018	A*	`conf`	Tree-depth, quantifier elimination, and quantifier rank. LICS Yijia Chen, Jörg Flum
2017	J	`jnl`	Logic and Computational Complexity (NII Shonan Meeting 2017-13). NII Shonan Meet. Rep. Yijia Chen, Rodney G. Downey, Jörg Flum
2017	B	`conf`	Slicewise Definability in First-Order Logic with Bounded Quantifier Rank. CSL Yijia Chen, Jörg Flum, Xuangui Huang
2017	J	`jnl`	Slicewise definability in first-order logic with bounded quantifier rank. CoRR Yijia Chen, Jörg Flum, Xuangui Huang
2016	B	`conf`	Some Lower Bounds in Parameterized AC^0. MFCS Yijia Chen, Jörg Flum
2016	J	`jnl`	Some lower bounds in parameterized AC CoRR Yijia Chen, Jörg Flum
2015	—	`conf`	The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture. Fields of Logic and Computation II Yijia Chen, Jörg Flum
2014	J	`jnl`	Hard Instances of Algorithms and Proof Systems. ACM Trans. Comput. Theory Yijia Chen, Jörg Flum, Moritz Müller
2014	J	`jnl`	On Optimal Inverters. Bull. Symb. Log. Yijia Chen, Jörg Flum
2013	J	`jnl`	Consistency, optimality, and incompleteness. Ann. Pure Appl. Log. Yijia Chen, Jörg Flum, Moritz Müller
2013	J	`jnl`	On Limitations of the Ehrenfeucht-Fraisse-method in Descriptive Complexity. Electron. Colloquium Comput. Complex. Yijia Chen, Jörg Flum
2012	—	`conf`	A Parameterized Halting Problem. The Multivariate Algorithmic Revolution and Beyond Yijia Chen, Jörg Flum
2012	J	`jnl`	From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem. J. ACM Yijia Chen, Jörg Flum
2012	C	`conf`	Hard Instances of Algorithms and Proof Systems. CiE Yijia Chen, Jörg Flum, Moritz Müller
2012	A*	`conf`	On the Ordered Conjecture. LICS Yijia Chen, Jörg Flum
2012	B	`conf`	Some Definitorial Suggestions for Parameterized Proof Complexity. IPEC Jörg Flum, Moritz Müller
2012	J	`jnl`	Some definitorial suggestions for parameterized proof complexity. Electron. Colloquium Comput. Complex. Jörg Flum, Moritz Müller
2012	B	`conf`	The Exponential Time Hypothesis and the Parameterized Clique Problem. IPEC Yijia Chen, Kord Eickmeyer, Jörg Flum
2011	C	`conf`	Consistency and Optimality. CiE Yijia Chen, Jörg Flum, Moritz Müller
2011	J	`jnl`	Hard instances of algorithms and proof systems. Electron. Colloquium Comput. Complex. Yijia Chen, Jörg Flum, Moritz Müller
2011	B	`conf`	Invariantization of Listings. MFCS Jörg Flum
2011	A*	`conf`	Listings and Logics. LICS Yijia Chen, Jörg Flum
2011	J	`jnl`	Listings and logics. Electron. Colloquium Comput. Complex. Yijia Chen, Jörg Flum
2011	J	`jnl`	Lower Bounds for Kernelizations and Other Preprocessing Procedures. Theory Comput. Syst. Yijia Chen, Jörg Flum, Moritz Müller
2011	J	`jnl`	Strong isomorphism reductions in complexity theory. J. Symb. Log. Sam Buss, Yijia Chen, Jörg Flum, Sy-David Friedman, Moritz Müller
2010	—	`conf`	A Logic for PTIME and a Parameterized Halting Problem. Fields of Logic and Computation Yijia Chen, Jörg Flum
2010	—	`conf`	On ICALP (2) Yijia Chen, Jörg Flum
2010	B	`conf`	On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT. CSL Yijia Chen, Jörg Flum
2010	J	`jnl`	On optimal proof systems and logics for PTIME. Electron. Colloquium Comput. Complex. Yijia Chen, Jörg Flum
2010	J	`jnl`	On the complexity of Gödel's proof predicate. J. Symb. Log. Yijia Chen, Jörg Flum
2010	J	`jnl`	W-Hierarchies Defined by Symmetric Gates. Theory Comput. Syst. Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond
2009	A*	`conf`	A Logic for PTIME and a Parameterized Halting Problem. LICS Yijia Chen, Jörg Flum
2009	C	`conf`	Lower Bounds for Kernelizations and Other Preprocessing Procedures. CiE Yijia Chen, Jörg Flum, Moritz Müller
2009	J	`jnl`	Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping. J. Log. Comput. Yijia Chen, Jörg Flum
2008	J	`jnl`	A logic for PTIME and a parameterized halting problem. Electron. Colloquium Comput. Complex. Yijia Chen, Jörg Flum
2008	—	`ed.`	Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. Logic and Automata Jörg Flum, Erich Grädel, Thomas Wilke
2008	J	`jnl`	The parameterized complexity of maximality and minimality problems. Ann. Pure Appl. Log. Yijia Chen, Jörg Flum
2007	J	`jnl`	An analysis of the W J. Symb. Log. Yijia Chen, Jörg Flum, Martin Grohe
2007	J	`jnl`	Bounded fixed-parameter tractability and reducibility. Ann. Pure Appl. Log. Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer
2007	—	`book`	Einführung in die mathematische Logik (5. Aufl.). Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas
2007	J	`jnl`	Lower Bounds for Kernelizations. Electron. Colloquium Comput. Complex. Yijia Chen, Jörg Flum, Moritz Müller
2007	A	`conf`	On Parameterized Path and Chordless Path Problems. CCC Yijia Chen, Jörg Flum
2007	C	`conf`	Parameterized Complexity and Logic. CiE Jörg Flum
2007	B	`conf`	Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping. CSL Yijia Chen, Jörg Flum
2006	J	`jnl`	Bounded fixed-parameter tractability and log J. Comput. Syst. Sci. Jörg Flum, Martin Grohe, Mark Weyer
2006	J	`jnl`	On miniaturized problems in parameterized complexity theory. Theor. Comput. Sci. Yijia Chen, Jörg Flum
2006	—	`book`	Parameterized Complexity Theory Jörg Flum, Martin Grohe
2006	—	`conf`	The Parameterized Complexity of Maximality and Minimality Problems. IWPEC Yijia Chen, Jörg Flum
2005	J	`jnl`	Machine-based methods in parameterized complexity theory. Theor. Comput. Sci. Yijia Chen, Jörg Flum, Martin Grohe
2005	J	`jnl`	Model-Checking Problems as a Basis for Parameterized Intractability CoRR Jörg Flum, Martin Grohe
2005	J	`jnl`	Model-checking problems as a basis for parameterized intractability. Log. Methods Comput. Sci. Jörg Flum, Martin Grohe
2004	A*	`conf`	Bounded Fixed-Parameter Tractability and log ICALP Jörg Flum, Martin Grohe, Mark Weyer
2004	A*	`conf`	Model-Checking Problems as a Basis for Parameterized Intractability. LICS Jörg Flum, Martin Grohe
2004	—	`conf`	On Miniaturized Problems in Parameterized Complexity Theory. IWPEC Yijia Chen, Jörg Flum
2004	J	`jnl`	Parametrized Complexity and Subexponential Time (Column: Computational Complexity). Bull. EATCS Jörg Flum, Martin Grohe
2004	J	`jnl`	The Parameterized Complexity of Counting Problems. SIAM J. Comput. Jörg Flum, Martin Grohe
2003	A	`conf`	Bounded Nondeterminism and Alternation in Parameterized Complexity Theory. CCC Yijia Chen, Jörg Flum, Martin Grohe
2003	J	`jnl`	Describing parameterized complexity classes. Inf. Comput. Jörg Flum, Martin Grohe
2003	B	`conf`	Machine Characterization of the Classes of the W-Hierarchy. CSL Yijia Chen, Jörg Flum
2002	A	`conf`	Describing Parameterized Complexity Classes. STACS Jörg Flum, Martin Grohe
2002	J	`jnl`	Query evaluation via tree-decompositions. J. ACM Jörg Flum, Markus Frick, Martin Grohe
2002	A*	`conf`	The Parameterized Complexity of Counting Problems. FOCS Jörg Flum, Martin Grohe
2001	J	`jnl`	Fixed-Parameter Tractability, Definability, and Model-Checking. SIAM J. Comput. Jörg Flum, Martin Grohe
2001	A	`conf`	Query Evaluation via Tree-Decompositions. ICDT Jörg Flum, Markus Frick, Martin Grohe
2001	J	`jnl`	Tree-Decompositions and the Model-Checking Problem. Bull. EATCS Jörg Flum
2000	J	`jnl`	Games and total Datalog¬ queries. Theor. Comput. Sci. Jörg Flum, Max Kubierschky, Bertram Ludäscher
2000	J	`jnl`	Games, Kernels, and Antitone Operations. Order Jörg Flum
2000	J	`jnl`	On Fixed-Point Logic With Counting. J. Symb. Log. Jörg Flum, Martin Grohe
1999	B	`ed.`	Computer Science Logic, 13th International Workshop, CSL '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings CSL Jörg Flum, Mario Rodríguez-Artalejo
1999	J	`jnl`	Fixed-parameter tractability, definability, and model checking CoRR Jörg Flum, Martin Grohe
1999	J	`jnl`	Pseudo-Finite Homogeneity and Saturation. J. Symb. Log. Jörg Flum, Martin Ziegler
1999	J	`jnl`	Quantifiers and Congruence Closure. Stud Logica Jörg Flum, Matthias Schiehlen, Jouko A. Väänänen
1998	J	`jnl`	An Extension of the Lemma of Rasiowa and Sikorski. Math. Log. Q. Jörg Flum
1997	A	`conf`	Total and Partial Well-Founded Datalog Coincide. ICDT Jörg Flum, Max Kubierschky, Bertram Ludäscher
1996	—	`book`	Einführung in die mathematische Logik (4. Aufl.). Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas
1995	—	`book`	Finite model theory. Heinz-Dieter Ebbinghaus, Jörg Flum
1994	—	`book`	Mathematical logic (2. ed.). Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas
1992	—	`book`	Einführung in die mathematische Logik (3. Aufl.). Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas
1991	B	`conf`	On Bounded Theories. CSL Jörg Flum
1988	J	`jnl`	On Topological Spaces Equivalent to Ordinals. J. Symb. Log. Jörg Flum, Juan Carlos Martínez
1985	J	`jnl`	Maximale monadische Logiken. Arch. Math. Log. Jörg Flum
1985	J	`jnl`	χ-Local Operations for Topological Structures. Math. Log. Q. Jörg Flum, Juan Carlos Martínez
1984	—	`book`	Mathematical logic. Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas
1975	J	`jnl`	L(Q)-Preservation Theorems. J. Symb. Log. Jörg Flum
1971	J	`jnl`	A Remark on Infinitary Languages. J. Symb. Log. Jörg Flum