×

zbMATH — the first resource for mathematics

Speckenmeyer, Ewald

Compute Distance To:
Author ID: speckenmeyer.ewald Recent zbMATH articles by "Speckenmeyer, Ewald"
Published as: Speckenmeyer, Ewald; Speckenmeyer, E.
Documents Indexed: 38 Publications since 1981, including 2 Books

Publications by Year

Citations contained in zbMATH Open

30 Publications have been cited 249 times in 210 Documents Cited by Year
Solving satisfiability in less than \(2^ n\) steps. Zbl 0603.68092
Monien, B.; Speckenmeyer, E.
63
1985
Ramsey numbers and an approximation algorithm for the vertex cover problem. Zbl 0558.05044
Monien, Burkhard; Speckenmeyer, Ewald
33
1985
On feedback vertex sets and nonseparating independent sets in cubic graps. Zbl 0657.05042
Speckenmeyer, Ewald
20
1988
On enumerating all minimal solutions of feedback problems. Zbl 1004.68122
Schwikowski, Benno; Speckenmeyer, Ewald
19
2002
On feedback problems in digraphs. Zbl 0768.68181
Speckenmeyer, Ewald
14
1990
A fast parallel SAT-solver – efficient workload balancing. Zbl 0891.68096
Böhm, Max; Speckenmeyer, Ewald
13
1996
Upper bounds for covering problems. Zbl 0508.90065
Monien, Burkhard; Speckenmeyer, Ewald; Vornberger, Oliver
12
1981
Untersuchungen zum Feedback Vertex Problem in ungerichteten Graphen. Zbl 0534.68046
Speckenmeyer, Ewald
12
1983
XSAT and NAE-SAT of linear CNF classes. Zbl 1284.05106
Porschen, Stefan; Schmidt, Tatjana; Speckenmeyer, Ewald; Wotzlaw, Andreas
7
2014
Linear CNF formulas and satisfiability. Zbl 1186.68223
Porschen, Stefan; Speckenmeyer, Ewald; Zhao, Xishun
6
2009
Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation. Zbl 1252.05152
Wotzlaw, Andreas; Speckenmeyer, Ewald; Porschen, Stefan
5
2012
Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\). Zbl 1099.68042
Porschen, Stefan; Randerath, Bert; Speckenmeyer, Ewald
4
2005
Linear time algorithms for some not-all-equal satisfiability problems. Zbl 1204.68108
Porschen, Stefan; Randerath, Bert; Speckenmeyer, Ewald
4
2004
Satisfiability of mixed Horn formulas. Zbl 1122.68115
Porschen, Stefan; Speckenmeyer, Ewald
4
2007
A satisfiability formulation of problems on level graphs. Zbl 0990.90530
Randerath, Bert; Speckenmeyer, Ewald; Boros, Endre; Hammer, Peter; Kogan, Alex; Makino, Kazuhisa; Simeone, Bruno; Cepek, Ondrej
4
2001
Bounds on feedback vertex sets of undirected cubic graphs. Zbl 0603.05024
Speckenmeyer, E.
4
1986
Some further approximation algorithms for the vertex cover problem. Zbl 0537.05053
Monien, B.; Speckenmeyer, E.
4
1983
An algorithm for the class of pure implicational formulas. Zbl 0941.68154
Franco, John; Goldsmith, Judy; Schlipf, John; Speckenmeyer, Ewald; Swaminathan, R. P.
3
1999
Improving a fixed parameter tractability time bound for the shadow problem. Zbl 1092.68048
Heusch, Peter; Porschen, Stefan; Speckenmeyer, Ewald
2
2003
A CNF class generalizing exact linear formulas. Zbl 1138.68550
Porschen, Stefan; Speckenmeyer, Ewald
2
2008
Algorithms for variable-weighted 2-SAT and dual problems. Zbl 1214.68368
Porschen, Stefan; Speckenmeyer, Ewald
2
2007
Worst case bounds for some NP-complete modified Horn-SAT problems. Zbl 1122.68614
Porschen, Stefan; Speckenmeyer, Ewald
2
2005
On the average time complexity of set partitioning. Zbl 0925.68218
Speckenmeyer, Ewald; Kemp, Rainer
2
1990
Exact satisfiability, a natural extension of set partition, and its average case behavior. Zbl 0865.03030
Rosenthal, John W.; Speckenmeyer, Ewald; Kemp, Rainer
2
1992
Complexity results for linear XSAT-problems. Zbl 1306.68046
Porschen, Stefan; Schmidt, Tatjana; Speckenmeyer, Ewald
1
2010
A satisfiability-based approach for embedding generalized tanglegrams on level graphs. Zbl 1330.68225
Speckenmeyer, Ewald; Wotzlaw, Andreas; Porschen, Stefan
1
2011
On linear CNF formulas. Zbl 1138.68551
Porschen, Stefan; Speckenmeyer, Ewald; Randerath, Bert
1
2006
Classes of CNF-formulas with backtracking trees of exponential or linear average order for exact-satisfiability. Zbl 0649.68102
Speckenmeyer, Ewald
1
1988
On the average case complexity of backtracking for the exact- satisfiability problem. Zbl 0661.68108
Speckenmeyer, Ewald
1
1988
Is average superlinear speedup possible? Zbl 0715.68041
Speckenmeyer, Ewald
1
1989
XSAT and NAE-SAT of linear CNF classes. Zbl 1284.05106
Porschen, Stefan; Schmidt, Tatjana; Speckenmeyer, Ewald; Wotzlaw, Andreas
7
2014
Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation. Zbl 1252.05152
Wotzlaw, Andreas; Speckenmeyer, Ewald; Porschen, Stefan
5
2012
A satisfiability-based approach for embedding generalized tanglegrams on level graphs. Zbl 1330.68225
Speckenmeyer, Ewald; Wotzlaw, Andreas; Porschen, Stefan
1
2011
Complexity results for linear XSAT-problems. Zbl 1306.68046
Porschen, Stefan; Schmidt, Tatjana; Speckenmeyer, Ewald
1
2010
Linear CNF formulas and satisfiability. Zbl 1186.68223
Porschen, Stefan; Speckenmeyer, Ewald; Zhao, Xishun
6
2009
A CNF class generalizing exact linear formulas. Zbl 1138.68550
Porschen, Stefan; Speckenmeyer, Ewald
2
2008
Satisfiability of mixed Horn formulas. Zbl 1122.68115
Porschen, Stefan; Speckenmeyer, Ewald
4
2007
Algorithms for variable-weighted 2-SAT and dual problems. Zbl 1214.68368
Porschen, Stefan; Speckenmeyer, Ewald
2
2007
On linear CNF formulas. Zbl 1138.68551
Porschen, Stefan; Speckenmeyer, Ewald; Randerath, Bert
1
2006
Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\). Zbl 1099.68042
Porschen, Stefan; Randerath, Bert; Speckenmeyer, Ewald
4
2005
Worst case bounds for some NP-complete modified Horn-SAT problems. Zbl 1122.68614
Porschen, Stefan; Speckenmeyer, Ewald
2
2005
Linear time algorithms for some not-all-equal satisfiability problems. Zbl 1204.68108
Porschen, Stefan; Randerath, Bert; Speckenmeyer, Ewald
4
2004
Improving a fixed parameter tractability time bound for the shadow problem. Zbl 1092.68048
Heusch, Peter; Porschen, Stefan; Speckenmeyer, Ewald
2
2003
On enumerating all minimal solutions of feedback problems. Zbl 1004.68122
Schwikowski, Benno; Speckenmeyer, Ewald
19
2002
A satisfiability formulation of problems on level graphs. Zbl 0990.90530
Randerath, Bert; Speckenmeyer, Ewald; Boros, Endre; Hammer, Peter; Kogan, Alex; Makino, Kazuhisa; Simeone, Bruno; Cepek, Ondrej
4
2001
An algorithm for the class of pure implicational formulas. Zbl 0941.68154
Franco, John; Goldsmith, Judy; Schlipf, John; Speckenmeyer, Ewald; Swaminathan, R. P.
3
1999
A fast parallel SAT-solver – efficient workload balancing. Zbl 0891.68096
Böhm, Max; Speckenmeyer, Ewald
13
1996
Exact satisfiability, a natural extension of set partition, and its average case behavior. Zbl 0865.03030
Rosenthal, John W.; Speckenmeyer, Ewald; Kemp, Rainer
2
1992
On feedback problems in digraphs. Zbl 0768.68181
Speckenmeyer, Ewald
14
1990
On the average time complexity of set partitioning. Zbl 0925.68218
Speckenmeyer, Ewald; Kemp, Rainer
2
1990
Is average superlinear speedup possible? Zbl 0715.68041
Speckenmeyer, Ewald
1
1989
On feedback vertex sets and nonseparating independent sets in cubic graps. Zbl 0657.05042
Speckenmeyer, Ewald
20
1988
Classes of CNF-formulas with backtracking trees of exponential or linear average order for exact-satisfiability. Zbl 0649.68102
Speckenmeyer, Ewald
1
1988
On the average case complexity of backtracking for the exact- satisfiability problem. Zbl 0661.68108
Speckenmeyer, Ewald
1
1988
Bounds on feedback vertex sets of undirected cubic graphs. Zbl 0603.05024
Speckenmeyer, E.
4
1986
Solving satisfiability in less than \(2^ n\) steps. Zbl 0603.68092
Monien, B.; Speckenmeyer, E.
63
1985
Ramsey numbers and an approximation algorithm for the vertex cover problem. Zbl 0558.05044
Monien, Burkhard; Speckenmeyer, Ewald
33
1985
Untersuchungen zum Feedback Vertex Problem in ungerichteten Graphen. Zbl 0534.68046
Speckenmeyer, Ewald
12
1983
Some further approximation algorithms for the vertex cover problem. Zbl 0537.05053
Monien, B.; Speckenmeyer, E.
4
1983
Upper bounds for covering problems. Zbl 0508.90065
Monien, Burkhard; Speckenmeyer, Ewald; Vornberger, Oliver
12
1981
all top 5

Cited by 365 Authors

12 Speckenmeyer, Ewald
11 Porschen, Stefan
6 Kullmann, Oliver
6 Saurabh, Saket
5 Fujito, Toshihiro
5 Hirsch, Edward A.
4 Boros, Endre
4 Chen, Jian-er
4 Fomin, Fedor V.
4 Guo, Jiong
4 Gutin, Gregory Z.
4 Heggernes, Pinar
4 Impagliazzo, Russell
4 Iwama, Kazuo
4 Kratsch, Dieter
4 Makino, Kazuhisa
4 Marino, Andrea
4 Paturi, Ramamohan
4 Raman, Venkatesh
4 Subramani, Krishnan
4 Szeider, Stefan
4 Tamaki, Suguru
4 Yeo, Anders
3 Angelini, Patrizio
3 Conte, Alessio
3 Da Lozzo, Giordano
3 Di Battista, Giuseppe
3 Döcker, Janosch
3 Fernau, Henning
3 Frati, Fabrizio
3 Gaspers, Serge
3 Golovach, Petr A.
3 Grossi, Roberto
3 Gurvich, Vladimir A.
3 Halldórsson, Magnús Mar
3 Hüffner, Falk
3 Li, Jianzhong
3 Marques-Silva, João P.
3 Miao, Dongjing
3 Mnich, Matthias
3 Niedermeier, Rolf
3 Paulusma, Daniël
3 Rautenbach, Dieter
3 Schmidt, Tatjana
3 van Maaren, Hans
3 Villanger, Yngve
3 Wotzlaw, Andreas
3 Yamamoto, Masaki
2 Bang-Jensen, Jørgen
2 Bar-Yehuda, Reuven
2 Bessy, Stéphane
2 Biere, Armin
2 Bodlaender, Hans L.
2 Borys, Konrad
2 Brun, Yuriy
2 Bruni, Renato
2 Crowston, Robert
2 Dantsin, Evgeny
2 Darmann, Andreas
2 Elbassioni, Khaled M.
2 Giunchiglia, Enrico
2 Gramm, Jens
2 Heule, Marijn J. H.
2 Johnson, Matthew
2 Kanj, Iyad A.
2 Kiesl, Benjamin
2 Liu, Xianmin
2 Liu, Yanpei
2 Madsen, Bolette Ammitzbøll
2 Mencía, Carlos
2 Miyazaki, Shuichi
2 Munaro, Andrea
2 Paschos, Vangelis Th.
2 Patrignani, Maurizio
2 Protti, Fábio
2 Ren, Han
2 Rizzi, Romeo
2 Rossmanith, Peter
2 Rutter, Ignaz
2 Rzążewski, Paweł
2 Scheder, Dominik
2 Trevisan, Luca
2 Van Leeuwen, Erik Jan
2 Versari, Luca
2 Wang, Jianxin
2 Welzl, Emo
2 Wu, Weili
2 Xu, Chao
2 Zhang, Zhao
1 Acuña, Vicente
1 Arkin, Esther M.
1 Armando, Alessandro
1 Aspuru-Guzik, Alán
1 Bai, Guoqiang
1 Banbara, Mutsunori
1 Beigel, Richard
1 Belmonte, Rémy
1 Bermudo, Sergio
1 Bern, Marshall W.
1 Billionnet, Alain
...and 265 more Authors
all top 5

Cited in 48 Serials

32 Discrete Applied Mathematics
28 Theoretical Computer Science
20 Algorithmica
15 Information Processing Letters
11 Discrete Mathematics
8 Journal of Computer and System Sciences
7 Annals of Mathematics and Artificial Intelligence
3 Journal of Graph Theory
3 Journal of Automated Reasoning
3 Theory of Computing Systems
3 Journal of Combinatorial Optimization
2 Artificial Intelligence
2 Operations Research Letters
2 Annals of Pure and Applied Logic
2 Information and Computation
2 Japan Journal of Industrial and Applied Mathematics
2 European Journal of Operational Research
2 Computational Complexity
2 Journal of Mathematical Sciences (New York)
2 Discussiones Mathematicae. Graph Theory
2 Journal of Discrete Algorithms
2 Discrete Optimization
1 Acta Informatica
1 Applied Mathematics and Computation
1 BIT
1 Information Sciences
1 Mathematical Systems Theory
1 SIAM Journal on Computing
1 Journal of Computer Science and Technology
1 International Journal of Intelligent Systems
1 Asia-Pacific Journal of Operational Research
1 SIAM Journal on Discrete Mathematics
1 Computational Geometry
1 MSCS. Mathematical Structures in Computer Science
1 International Journal of Foundations of Computer Science
1 Journal of Global Optimization
1 International Journal of Computer Mathematics
1 Mathematical Programming. Series A. Series B
1 Vestnik St. Petersburg University. Mathematics
1 Applied Mathematics. Series B (English Edition)
1 Combinatorics, Probability and Computing
1 The Bulletin of Symbolic Logic
1 Constraints
1 Journal of Applied Mathematics and Decision Sciences
1 New Journal of Physics
1 Natural Computing
1 Mathematics in Computer Science
1 Matematicheskie Voprosy Kriptografii

Citations by Year