×

zbMATH — the first resource for mathematics

Wagner, Klaus W.

Compute Distance To:
Author ID: wagner.klaus-w Recent zbMATH articles by "Wagner, Klaus W."
Published as: Wagner, Klaus W.; Wagner, Klaus; Wagner, K.; Wagner, K. W.
External Links: MGP
Documents Indexed: 102 Publications since 1972, including 13 Books

Publications by Year

Citations contained in zbMATH Open

68 Publications have been cited 705 times in 488 Documents Cited by Year
The complexity of combinatorial problems with succinct input representation. Zbl 0621.68032
Wagner, Klaus W.
85
1986
Bounded query classes. Zbl 0711.68047
Wagner, Klaus W.
68
1990
On \(\omega\)-regular sets. Zbl 0434.68061
Wagner, Klaus
61
1979
The Boolean hierarchy. I: Structural properties. Zbl 0676.68011
Cai, Jin-yi; Gundermann, Thomas; Hartmanis, Juris; Hemachandra, Lane A.; Sewelson, Vivian; Wagner, Klaus; Wechsung, Gerd
53
1988
Computational complexity. Zbl 0584.68061
Wagner, K.; Wechsung, G.
47
1986
The difference and truth-table hierarchies for NP. Zbl 0642.03024
Köbler, Johannes; Schöning, Uwe; Wagner, Klaus W.
36
1987
More complicated questions about maxima and minima, and some closures of NP. Zbl 0653.03027
Wagner, Klaus W.
35
1987
The Boolean hierarchy. II: Applications. Zbl 0676.68012
Cai, Jin-Yi; Gundermann, Thomas; Hartmanis, Juris; Hemachandra, Lane A.; Sewelson, Vivian; Wagner, Klaus; Wechsung, Gerd
27
1989
Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen. Zbl 0301.94069
Staiger, Ludwig; Wagner, Klaus
27
1974
The complexity of membership problems for circuits over sets of natural numbers. Zbl 1133.68028
McKenzie, Pierre; Wagner, Klaus W.
21
2007
The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems. Zbl 0743.68078
Lengauer, T.; Wagner, K. W.
17
1992
The Boolean hierarchy of NP-partitions (extended abstract). Zbl 0959.68521
Kosub, Sven; Wagner, Klaus W.
16
2000
Monotonic coverings of finite sets. Zbl 0566.68041
Wagner, Klaus
13
1984
Computational complexity. Zbl 0584.68062
Wagner, K.; Wechsung, G.
13
1986
Some observations on the connection between counting and recursion. Zbl 0637.03034
Wagner, Klaus W.
12
1986
An observation on probability versus randomness with applications to complexity classes. Zbl 0819.68056
Book, Ronald V.; Lutz, Jack H.; Wagner, Klaus W.
10
1994
On balanced versus unbalanced computation trees. Zbl 0853.68097
Hertrampf, U.; Vollmer, H.; Wagner, K. W.
10
1996
Collapsing oracle hierarchies, census functions and logarithmically many queries. Zbl 0648.68065
Schöning, Uwe; Wagner, Klaus W.
9
1988
Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen. Zbl 0379.94070
Wagner, Klaus
9
1977
Rekursive Folgenmengen. I. Zbl 0421.03035
Staiger, Ludwig; Wagner, Klaus
9
1978
Complexity classes of optimization functions. Zbl 0835.68048
Vollmer, Heribert; Wagner, Klaus W.
7
1995
The complexity of computing the size of an interval. Zbl 1123.68041
Hemaspaandra, Lane A.; Homan, Christopher M.; Kosub, Sven; Wagner, Klaus W.
7
2006
On the power of one-way synchronized alternating machines with small space. Zbl 0769.68030
Hromkovič, Juraj; Inoue, Katsushi; Rovan, Branislav; Slobodová, Anna; Takanami, Itsuo; Wagner, Klaus W.
6
1992
Recursive \(\omega\)-languages. Zbl 0367.02017
Wagner, K.; Staiger, L.
6
1977
The complexity of finding middle elements. Zbl 0804.68052
Vollmer, Heribert; Wagner, Klaus W.
6
1993
Counting hierarchies: Polynomial time and constant depth circuits. Zbl 0744.68052
Allender, Eric W.; Wagner, Klaus W.
5
1990
Eine Axiomatisierung der Theorie der regulären Folgenmengen. Zbl 0335.94028
Wagner, Klaus
5
1976
A reducibility for the dot-depth hierarchy. Zbl 1079.03028
Selivanov, Victor L.; Wagner, Klaus W.
5
2005
A note on parallel queries and the symmetric-difference hierarchy. Zbl 1078.68636
Wagner, Klaus W.
5
1998
The computational complexity of graph problems with succinct multigraph representation. Zbl 0655.05063
Karpinski, M.; Wagner, K. W.
4
1988
Leaf language classes. A survey. Zbl 1119.68091
Wagner, Klaus W.
4
2005
The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems. Zbl 0622.68056
Lengauer, T.; Wagner, K. W.
3
1987
The complexity of problems concerning graphs with regularities. Zbl 0548.68040
Wagner, Klaus
3
1984
On boolean lowness and boolean highness. Zbl 0974.68064
Reith, S.; Wagner, K. W.
3
2001
Universelle Turingmaschinen mit \(n\)-dimensionalem Band. Zbl 0318.02038
Wagner, Klaus
3
1973
Arithmetische Operatoren. Zbl 0352.02031
Wagner, Klaus
3
1976
Zur Theorie der abstrakten Familien von \(\omega\)-Sprachen (\(\omega\)-AFL). Zbl 0447.68088
Staiger, Ludwig; Wagner, Klaus
3
1976
The complexity of membership problems for circuits over sets of natural numbers. Zbl 1035.68054
McKenzie, Pierre; Wagner, Klaus W.
3
2003
On the power of DNA-computing. Zbl 1077.68647
Rooß, Diana; Wagner, Klaus W.
3
1996
On type-2 probabilistic quantifiers. Zbl 1046.68537
Book, Ronald V.; Vollmer, Heribert; Wagner, Klaus W.
3
1996
Weighted Boolean formula games. Zbl 1331.68112
Mavronicolas, Marios; Monien, Burkhard; Wagner, Klaus W.
3
2015
More complicated questions about maxima and minima, and some closures of NP. Zbl 0629.68049
Wagner, Klaus W.
2
1986
On the intersection of the class of linear context-free languages and the class of single-reset languages. Zbl 0631.68067
Wagner, Klaus W.
2
1986
Recursion theoretic characterizations of complexity classes of counting functions. Zbl 0877.68059
Vollmer, Heribert; Wagner, Klaus W.
2
1996
The chain method to separate counting classes. Zbl 0893.68070
Cronauer, K.; Hertrampf, U.; Vollmer, H.; Wagner, K. W.
2
1998
The binary network flow problem is logspace complete for P. Zbl 0701.68048
Lengauer, Thomas; Wagner, Klaus W.
2
1990
Arithmetic circuits and polynomial replacement systems. Zbl 1101.68567
McKenzie, Pierre; Vollmer, Heribert; Wagner, Klaus W.
2
2004
The complexity of computing the size of an interval. Zbl 0986.68043
Hemaspaandra, Lane A.; Kosub, Sven; Wagner, Klaus W.
2
2001
A reducibility for the dot-depth hierarchy. Zbl 1097.03035
Selivanov, Victor L.; Wagner, Klaus W.
2
2004
Arithmetic circuits and polynomial replacement systems. Zbl 1044.68061
McKenzie, Pierre; Vollmer, Heribert; Wagner, Klaus W.
2
2000
The complexity of unions of disjoint sets. Zbl 1152.68019
Glaßer, Christian; Selman, Alan L.; Travers, Stephen; Wagner, Klaus W.
2
2008
Two-way automata with more than one storage medium. Zbl 0604.68055
Vogel, Jörg; Wagner, Klaus
1
1985
Deterministic automata on infinite trees and the Borel hierarchy. Zbl 0614.03037
Mostowski, A. W.; Skurczyński, J.; Wagner, K.
1
1986
Uniform simulations of nondeterministic real time multitape Turing machines. Zbl 0633.68036
Brandenburg, Franz-J.; Brandstädt, Andreas; Wagner, Klaus W.
1
1987
On restricting the access to an NP-oracle. Zbl 0649.68052
Wagner, Klaus W.
1
1988
The complexity of problems concerning graphs with regularities. Zbl 0548.68039
Wagner, K.
1
1984
Compact descriptions and the counting polynomial-time hierarchy. Zbl 0554.68032
Wagner, Klaus
1
1984
Eine Bemerkung zu einer Arbeit von Monien über Kopfzahl-Hierarchien für Zweiweg-Automaten. Zbl 0493.68047
Meinhardt, Dietrich; Wagner, Klaus
1
1982
Measure one results in computational complexity theory. Zbl 0867.68054
Vollmer, Heribert; Wagner, Klaus W.
1
1997
Arithmetische und Bairesche Operatoren. Zbl 0359.02038
Wagner, Klaus
1
1977
Complexity hierarchies of oracles. Zbl 0361.68073
Wagner, Klaus; Wechsung, Gerd
1
1977
The alternation hierarchy for sublogarithmic space: An exciting race to STACS’93. Zbl 0797.68062
Wagner, Klaus W.
1
1993
Generation problems. Zbl 1096.68067
Böhler, Elmar; Glaßer, Christian; Schwarz, Bernhard; Wagner, Klaus
1
2004
Vector language: Simple description of hard instances. Zbl 0733.68051
Kowaluk, Miroslaw; Wagner, Klaus W.
1
1990
The Boolean hierarchy of NP-partitions. Zbl 1146.68375
Kosub, Sven; Wagner, Klaus W.
1
2008
Complexity of aperiodicity for topological properties of regular \(\omega \)-languages. Zbl 1143.68039
Selivanov, Victor L.; Wagner, Klaus W.
1
2008
The analytic polynomial-time hierarchy. Zbl 0920.03051
Baier, Herbert; Wagner, Klaus W.
1
1998
On Boolean lowness and Boolean highness. Zbl 0912.68049
Reith, Steffen; Wagner, Klaus W.
1
1998
Weighted Boolean formula games. Zbl 1331.68112
Mavronicolas, Marios; Monien, Burkhard; Wagner, Klaus W.
3
2015
The complexity of unions of disjoint sets. Zbl 1152.68019
Glaßer, Christian; Selman, Alan L.; Travers, Stephen; Wagner, Klaus W.
2
2008
The Boolean hierarchy of NP-partitions. Zbl 1146.68375
Kosub, Sven; Wagner, Klaus W.
1
2008
Complexity of aperiodicity for topological properties of regular \(\omega \)-languages. Zbl 1143.68039
Selivanov, Victor L.; Wagner, Klaus W.
1
2008
The complexity of membership problems for circuits over sets of natural numbers. Zbl 1133.68028
McKenzie, Pierre; Wagner, Klaus W.
21
2007
The complexity of computing the size of an interval. Zbl 1123.68041
Hemaspaandra, Lane A.; Homan, Christopher M.; Kosub, Sven; Wagner, Klaus W.
7
2006
A reducibility for the dot-depth hierarchy. Zbl 1079.03028
Selivanov, Victor L.; Wagner, Klaus W.
5
2005
Leaf language classes. A survey. Zbl 1119.68091
Wagner, Klaus W.
4
2005
Arithmetic circuits and polynomial replacement systems. Zbl 1101.68567
McKenzie, Pierre; Vollmer, Heribert; Wagner, Klaus W.
2
2004
A reducibility for the dot-depth hierarchy. Zbl 1097.03035
Selivanov, Victor L.; Wagner, Klaus W.
2
2004
Generation problems. Zbl 1096.68067
Böhler, Elmar; Glaßer, Christian; Schwarz, Bernhard; Wagner, Klaus
1
2004
The complexity of membership problems for circuits over sets of natural numbers. Zbl 1035.68054
McKenzie, Pierre; Wagner, Klaus W.
3
2003
On boolean lowness and boolean highness. Zbl 0974.68064
Reith, S.; Wagner, K. W.
3
2001
The complexity of computing the size of an interval. Zbl 0986.68043
Hemaspaandra, Lane A.; Kosub, Sven; Wagner, Klaus W.
2
2001
The Boolean hierarchy of NP-partitions (extended abstract). Zbl 0959.68521
Kosub, Sven; Wagner, Klaus W.
16
2000
Arithmetic circuits and polynomial replacement systems. Zbl 1044.68061
McKenzie, Pierre; Vollmer, Heribert; Wagner, Klaus W.
2
2000
A note on parallel queries and the symmetric-difference hierarchy. Zbl 1078.68636
Wagner, Klaus W.
5
1998
The chain method to separate counting classes. Zbl 0893.68070
Cronauer, K.; Hertrampf, U.; Vollmer, H.; Wagner, K. W.
2
1998
The analytic polynomial-time hierarchy. Zbl 0920.03051
Baier, Herbert; Wagner, Klaus W.
1
1998
On Boolean lowness and Boolean highness. Zbl 0912.68049
Reith, Steffen; Wagner, Klaus W.
1
1998
Measure one results in computational complexity theory. Zbl 0867.68054
Vollmer, Heribert; Wagner, Klaus W.
1
1997
On balanced versus unbalanced computation trees. Zbl 0853.68097
Hertrampf, U.; Vollmer, H.; Wagner, K. W.
10
1996
On the power of DNA-computing. Zbl 1077.68647
Rooß, Diana; Wagner, Klaus W.
3
1996
On type-2 probabilistic quantifiers. Zbl 1046.68537
Book, Ronald V.; Vollmer, Heribert; Wagner, Klaus W.
3
1996
Recursion theoretic characterizations of complexity classes of counting functions. Zbl 0877.68059
Vollmer, Heribert; Wagner, Klaus W.
2
1996
Complexity classes of optimization functions. Zbl 0835.68048
Vollmer, Heribert; Wagner, Klaus W.
7
1995
An observation on probability versus randomness with applications to complexity classes. Zbl 0819.68056
Book, Ronald V.; Lutz, Jack H.; Wagner, Klaus W.
10
1994
The complexity of finding middle elements. Zbl 0804.68052
Vollmer, Heribert; Wagner, Klaus W.
6
1993
The alternation hierarchy for sublogarithmic space: An exciting race to STACS’93. Zbl 0797.68062
Wagner, Klaus W.
1
1993
The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems. Zbl 0743.68078
Lengauer, T.; Wagner, K. W.
17
1992
On the power of one-way synchronized alternating machines with small space. Zbl 0769.68030
Hromkovič, Juraj; Inoue, Katsushi; Rovan, Branislav; Slobodová, Anna; Takanami, Itsuo; Wagner, Klaus W.
6
1992
Bounded query classes. Zbl 0711.68047
Wagner, Klaus W.
68
1990
Counting hierarchies: Polynomial time and constant depth circuits. Zbl 0744.68052
Allender, Eric W.; Wagner, Klaus W.
5
1990
The binary network flow problem is logspace complete for P. Zbl 0701.68048
Lengauer, Thomas; Wagner, Klaus W.
2
1990
Vector language: Simple description of hard instances. Zbl 0733.68051
Kowaluk, Miroslaw; Wagner, Klaus W.
1
1990
The Boolean hierarchy. II: Applications. Zbl 0676.68012
Cai, Jin-Yi; Gundermann, Thomas; Hartmanis, Juris; Hemachandra, Lane A.; Sewelson, Vivian; Wagner, Klaus; Wechsung, Gerd
27
1989
The Boolean hierarchy. I: Structural properties. Zbl 0676.68011
Cai, Jin-yi; Gundermann, Thomas; Hartmanis, Juris; Hemachandra, Lane A.; Sewelson, Vivian; Wagner, Klaus; Wechsung, Gerd
53
1988
Collapsing oracle hierarchies, census functions and logarithmically many queries. Zbl 0648.68065
Schöning, Uwe; Wagner, Klaus W.
9
1988
The computational complexity of graph problems with succinct multigraph representation. Zbl 0655.05063
Karpinski, M.; Wagner, K. W.
4
1988
On restricting the access to an NP-oracle. Zbl 0649.68052
Wagner, Klaus W.
1
1988
The difference and truth-table hierarchies for NP. Zbl 0642.03024
Köbler, Johannes; Schöning, Uwe; Wagner, Klaus W.
36
1987
More complicated questions about maxima and minima, and some closures of NP. Zbl 0653.03027
Wagner, Klaus W.
35
1987
The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems. Zbl 0622.68056
Lengauer, T.; Wagner, K. W.
3
1987
Uniform simulations of nondeterministic real time multitape Turing machines. Zbl 0633.68036
Brandenburg, Franz-J.; Brandstädt, Andreas; Wagner, Klaus W.
1
1987
The complexity of combinatorial problems with succinct input representation. Zbl 0621.68032
Wagner, Klaus W.
85
1986
Computational complexity. Zbl 0584.68061
Wagner, K.; Wechsung, G.
47
1986
Computational complexity. Zbl 0584.68062
Wagner, K.; Wechsung, G.
13
1986
Some observations on the connection between counting and recursion. Zbl 0637.03034
Wagner, Klaus W.
12
1986
More complicated questions about maxima and minima, and some closures of NP. Zbl 0629.68049
Wagner, Klaus W.
2
1986
On the intersection of the class of linear context-free languages and the class of single-reset languages. Zbl 0631.68067
Wagner, Klaus W.
2
1986
Deterministic automata on infinite trees and the Borel hierarchy. Zbl 0614.03037
Mostowski, A. W.; Skurczyński, J.; Wagner, K.
1
1986
Two-way automata with more than one storage medium. Zbl 0604.68055
Vogel, Jörg; Wagner, Klaus
1
1985
Monotonic coverings of finite sets. Zbl 0566.68041
Wagner, Klaus
13
1984
The complexity of problems concerning graphs with regularities. Zbl 0548.68040
Wagner, Klaus
3
1984
The complexity of problems concerning graphs with regularities. Zbl 0548.68039
Wagner, K.
1
1984
Compact descriptions and the counting polynomial-time hierarchy. Zbl 0554.68032
Wagner, Klaus
1
1984
Eine Bemerkung zu einer Arbeit von Monien über Kopfzahl-Hierarchien für Zweiweg-Automaten. Zbl 0493.68047
Meinhardt, Dietrich; Wagner, Klaus
1
1982
On \(\omega\)-regular sets. Zbl 0434.68061
Wagner, Klaus
61
1979
Rekursive Folgenmengen. I. Zbl 0421.03035
Staiger, Ludwig; Wagner, Klaus
9
1978
Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen. Zbl 0379.94070
Wagner, Klaus
9
1977
Recursive \(\omega\)-languages. Zbl 0367.02017
Wagner, K.; Staiger, L.
6
1977
Arithmetische und Bairesche Operatoren. Zbl 0359.02038
Wagner, Klaus
1
1977
Complexity hierarchies of oracles. Zbl 0361.68073
Wagner, Klaus; Wechsung, Gerd
1
1977
Eine Axiomatisierung der Theorie der regulären Folgenmengen. Zbl 0335.94028
Wagner, Klaus
5
1976
Arithmetische Operatoren. Zbl 0352.02031
Wagner, Klaus
3
1976
Zur Theorie der abstrakten Familien von \(\omega\)-Sprachen (\(\omega\)-AFL). Zbl 0447.68088
Staiger, Ludwig; Wagner, Klaus
3
1976
Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen. Zbl 0301.94069
Staiger, Ludwig; Wagner, Klaus
27
1974
Universelle Turingmaschinen mit \(n\)-dimensionalem Band. Zbl 0318.02038
Wagner, Klaus
3
1973
all top 5

Cited by 589 Authors

28 Hemaspaandra, Lane A.
21 Selivanov, Viktor L’vovich
18 Wagner, Klaus W.
13 Glaßer, Christian
12 Finkel, Olivier
12 Hemaspaandra, Edith
12 Rothe, Jörg-Matthias
11 Okhotin, Alexander
10 Staiger, Ludwig
9 Eiter, Thomas
9 Lohrey, Markus
8 Beigel, Richard
8 Gottlob, Georg
8 Jeż, Artur
8 Vollmer, Heribert
7 Carton, Olivier
7 Duparc, Jacques
7 Köbler, Johannes
6 Jenner, Birgit
6 Lukasiewicz, Thomas
6 Ogihara, Mitsunori
6 Toda, Seinosuke
5 Allender, Eric W.
5 Borchert, Bernd
5 Brandenburg, Franz-Josef
5 Cai, Jin-Yi
5 Chang, Richard
5 Holzer, Markus
5 Kutrib, Martin
5 Mauá, Denis Deratani
5 Ogiwara, Mitsunori
5 Spakowski, Holger
5 Watanabe, Osamu
5 Wechsung, Gerd
5 Yamasaki, Hideki
4 Dose, Titus
4 Durand, Arnaud
4 Gagliardi Cozman, Fabio
4 Gasarch, William Ian
4 Hempel, Harald
4 Hromkovič, Juraj
4 Kosub, Sven
4 Kratsch, Dieter
4 Lange, Klaus-Jörn
4 Lehtonen, Erkko
4 Pavan, Aduri
4 Schöning, Uwe
4 Silvestri, Riccardo
4 Takahashi, Masako
4 Torán, Jacobo
4 Travers, Stephen D.
4 Veith, Helmut
3 Arvind, Vikraman
3 Balcázar, José Luis
3 Cabessa, Jérémie
3 Geffert, Viliam
3 Hartmanis, Juris
3 Hunt, Harry Bowen III
3 Jonsson, Peter A.
3 Lang, Jérôme
3 Litovsky, Igor
3 Lutz, Jack H.
3 Mahajan, Meena
3 Malod, Guillaume
3 Marathe, Madhav V.
3 Mundhenk, Martin
3 Niwiński, Damian
3 Pagourtzis, Aris T.
3 Perrin, Dominique
3 Pighizzini, Giovanni
3 Prigioniero, Luca
3 Reitwießner, Christian
3 Selman, Alan L.
3 Struth, Georg
3 Szepietowski, Andrzej
3 Thakur, Mayur
3 Thierauf, Thomas
3 Tripathi, Rahul
3 Walukiewicz, Igor
2 Àlvarez, Carme
2 Arnold, André
2 Baier, Herbert
2 Bakali, Eleni
2 Barth, Dominik
2 Baumeister, Dorothea
2 Beck, Moritz
2 Böhler, Elmar
2 Book, Ronald Vernon
2 Bordihn, Henning
2 Brandt, Felix
2 Buss, Samuel R.
2 Calude, Cristian S.
2 Datta, Samir
2 de Werra, Dominique
2 Demange, Marc
2 Ekim, Tınaz
2 Engelfriet, Joost
2 Faliszewski, Piotr
2 Fischer, Felix
2 Fortnow, Lance J.
...and 489 more Authors
all top 5

Cited in 62 Serials

138 Theoretical Computer Science
36 Information Processing Letters
36 Journal of Computer and System Sciences
36 Information and Computation
18 Artificial Intelligence
18 International Journal of Foundations of Computer Science
18 Theory of Computing Systems
15 Mathematical Systems Theory
14 RAIRO. Informatique Théorique et Applications
13 RAIRO. Theoretical Informatics and Applications
11 Computational Complexity
7 International Journal of Approximate Reasoning
6 Annals of Pure and Applied Logic
5 Annals of Mathematics and Artificial Intelligence
4 Acta Informatica
4 Discrete Applied Mathematics
4 Mathematical Logic Quarterly (MLQ)
4 Logical Methods in Computer Science
3 Algorithmica
3 International Journal of Algebra and Computation
2 The Journal of Symbolic Logic
2 European Journal of Combinatorics
2 Mathematical Social Sciences
2 Order
2 Journal of Computer Science and Technology
2 Random Structures & Algorithms
2 International Journal of Computer Mathematics
2 Archive for Mathematical Logic
2 Formal Methods in System Design
2 The Journal of Logic and Algebraic Programming
2 Journal of Discrete Algorithms
1 International Journal of General Systems
1 Algebra and Logic
1 BIT
1 Journal of Combinatorial Theory. Series A
1 Journal of Philosophical Logic
1 Journal of Soviet Mathematics
1 Synthese
1 Journal of Complexity
1 Japan Journal of Industrial and Applied Mathematics
1 MSCS. Mathematical Structures in Computer Science
1 European Journal of Operational Research
1 Acta Mathematica Sinica. New Series
1 ZOR. Zeitschrift für Operations Research
1 Journal of Logic, Language and Information
1 The Electronic Journal of Combinatorics
1 The Journal of Artificial Intelligence Research (JAIR)
1 Complexity
1 Journal of Heuristics
1 Constraints
1 Chicago Journal of Theoretical Computer Science
1 LMS Journal of Computation and Mathematics
1 Theory and Practice of Logic Programming
1 Journal of Applied Logic
1 Oberwolfach Reports
1 Discrete Optimization
1 Sibirskie Èlektronnye Matematicheskie Izvestiya
1 Discrete Mathematics, Algorithms and Applications
1 RAIRO. Theoretical Informatics and Applications
1 Computer Science Review
1 ACM Transactions on Computation Theory
1 Journal of Logical and Algebraic Methods in Programming

Citations by Year