Zum Inhalt springenZur Suche springen

Schriftenverzeichnis

DBLP - Egon Wanke
Google Scholar - Egon Wanke


2021

Y. Schmitz, D. Vietz, and E. Wanke.
A note on the complexity of k-Metric Dimension.
CoRR abs/2101.12018, 2021.

2020

F. Gurski, S. Hoffmann, D. Komander, C. Rehs, J. Rethmann, and E. Wanke.
Computing Directed Steiner Path Covers for Directed Co-Graphs (Extended Abstract).
In Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), LNCS, 12011, 556-565. Springer-Verlag, 2020.

F. Gurski, D. Komander, C. Rehs, J. Rethmann, and E. Wanke
Computing Directed Steiner Path Covers.
CoRR abs/2012.12232, 2020.

2019

F. Gurski, S. Hoffmann, D. Komander, C. Rehs, J. Rethmann, and E. Wanke.
Exact Solutions for the Steiner Path Problem on Special Graph Classes (Abstract).
International Conference on Operations Research (OR), 2019.

D. Vietz and E. Wanke.
The Fault-Tolerant Metric Dimension of Cographs.
In proceedings of the International Symposium on Fundamentals of Computation Theory (FCT 2019), LNCS, 11651:350-364, Springer Verlag, 2019.

D. Vietz, S. Hoffmann, and E. Wanke.
Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components. (Extended Abstract)
In proceedings of the 13th International Conference, Algorithms and Computation (WALCOM 2019), LNCS, 11355:175-187, Springer Verlag, 2019.

F. Gurski, C. Rehs, J. Rethmann, and E. Wanke.
Controlling Distribution Conveyors and Multi-Line Palletizers: Theoretical Foundations and Online Algorithms.
OR Spectrum, 41(2), 581-611, 2019.

2018

T. Narita, E. Wanke, M. Sato, T. Sakanoi, A. Kumada, M. Kamogawa, I. Hirohiko, S. Harada, T. Kameda, F. Tsuchiya, Eiji Kaneko.
A study of lightning location system (Blitz) based on VLF sferics.
In proceedings of the 34th International Conference on Lightning Protection (ICLP 2018), DOI: 10.1109/ICLP.2018.8503311, IEEE, 1-7, 2018.

S. Hoffmann, T. Kampermann, and E. Wanke.
Minimizing the Number of Max-Power Users in Ad-Hoc Wireless Networks with Minimum Node Degree Requirements
Information Processing Letters, 136:25-29, 2018.

F. Gurski, J. Rethmann, and E. Wanke.
On-line Algorithms for Controlling Palletizers. In Proceedings of the International Conference on Operations Research (OR 2016), 119-125, 2018.

2017

F. Gurski, J. Rethmann, and E. Wanke.
On-line Algorithms for Controlling Distribution Conveyors and Multi-line Palletizers (Abstract).
International Conference on Operations Research (OR), 2017.

F. Gurski, J. Rethmann, and E. Wanke.
An Experimental Study of Algorithms for Controlling Palletizers (Abstract).
In proceedings of the International Conference on Operations Research (OR 2016), 27-33, 2017.

S. Hoffmann and E. Wanke.
The Neighborhood Broadcast Problem in Wireless Ad Hoc Sensor Networks.
International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks (GRAPH-HOC) Vol.9, No.1, March 2017.

2016

S. Hoffmann and E. Wanke.
Minimum Power Range Assignment for Symmetric Connectivity in Sensor Networks with two Power Levels.
arXiv: 1605.01752, 2016.

S. Hoffmann, A. Elterman, and E. Wanke.
A linear time algorithm for metric dimension of cactus block graphs.
Theoretical Computer Science, 640:42-62, 2016.

S. Hoffmann and E. Wanke.
Generic Route Repair: Augmenting Wireless Ad Hoc Sensor networks for Local Connectivity.
In proceedings of the 15th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN), 2016.

F. Gurski, E. Wanke, and E. Yilmaz.
Directed NLC-width.
Theoretical Computer Science, 616:1-17,2016.

F. Gurski, J. Rethmann, and E. Wanke.
On the Complexity of the FIFO Stack-Up Problem.
Mathematical Methods of Operations Research (MMOR), 83(1):33-52, 2016.

F. Gurski, J. Rethmann, and E. Wanke.
Algorithms for Controlling Palletizers.
In Proceedings of the International Conference on Operations Research (OR 2014), Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), 197-203, Springer Verlag, 2016.

2015

F. Gurski, J. Rethmann, and E. Wanke.
Integer Programming Models and Parameterized Algorithms for Controlling Palletizers.
Technical Report 1509.07278, ACM Computing Research Repository (CoRR), 27 pages, 2015.

F. Gurski, J. Rethmann, and E. Wanke.
Directed Pathwidth and Palletizers.
In proceedings of the International Conference on Combinatorial Optimization and Applications (COCOA), LNCS, 9486:31-44, Springer Verlag, 2015.

F. Gurski, J. Rethmann, and E. Wanke.
A Practical Approach for the FIFO Stack-Up Problem.
In Proceedings of the International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO 2015), volume 360 of Advances in Intelligent Systems and Computing, pages 141-152. Springer Verlag, 2015.

2014

F. Gurski, J. Rethmann, and E. Wanke.
Algorithms for the FIFO Stack-up Problem (Abstract).
20th Conference of the International Federation of Operational Research Societies (IFORS), 2014.

F. Gurski, J. Rethmann, and E. Wanke.
Moving bins from conveyor belts onto pallets using FIFO queues.
In Proceedings of the International Conference on Operations Research (OR 2013), Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), pages 185-191, Springer Verlag, 2014.

A. Kravchenko, A. Weiser, S. Hugger, B. Kordaß, A. Hugger, E. Wanke.
Variability and Reliability of Muscle Activity Measurements During Chewing.
International Journal of Computerized Dentistry, 17(1):21-33, 2014.

2013.

J. Rethmann, F. Gurski, and E. Wanke.
Complexity of the FIFO Stack-Up Problem.
Technical Report 1307.1915, ACM Computing Research Repository (CoRR), 19 pages, 2013.

A. Hugger, S. Weiser, A. Kravchenko, R. Willers, and E. Wanke.
Characterizing chewing patterns by Soerensen distance method.
Society of Oral Physiology: Abstracts of the the 28th Store Kro Club Conference in Amsterdam, The Netherlands, 23th–26th May 2013, Abstracts of Oral Presentations 2013.

2012

D. Gaussmann, S. Hoffmann, and E. Wanke.
Hierarchical Bipartition Routing for Delivery Guarantee in Sparse Wireless Ad Hoc Sensor Networks With Obstacles.
In Proceedings of IWCE '12 at WORLDCOMP'12 - The 2012 World Congress in Computer Science, Computer Engineering, and Applied Computing

S. Hoffmann and E. Wanke.
Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete.
In Proceedings of Algosensors '12, LNCS, 7718:90-92, Springer Verlag, 2012.

2011

A. Hugger, A. Weiser, A. Kravchenko, S. Hugger, and E. Wanke.
Influence of experimental conditions on kinematic and electromyographic parameters in chewing tasks.
Society of Oral Physiology: Abstracts of the the 27th Store Kro Club Conference in Torino, Italy, 26th–29th May 2011, Abstracts of Oral Presentations 2011.

2010

B. van der Zander, E. Wanke, W. Kiess, and B. Scheuermann.
Complexity and Solution of the Send-Receive Correlation Problem.
In Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing, 122-123, ACM 2010.

F. Gurski, I. Rothe, J. Rothe, und E. Wanke.
Exakte Algorithmen für schwere Graphenprobleme.
Springer Verlag, Berlin, Taschenbuch, 1. September 2010.

2009

A. Krumnack, A. T. Reid, E. Wanke, G. Bezgin, and R. Kötter.
Criteria for Optimizing Cortical Hierarchies with Continuous Ranges.
Frontiers in Neuroinformatics, 4:7, doi: 10.3389/fninf.2010.00007.

F. Gurski and E. Wanke
The NLC-width and clique-width for powers of graphs of bounded tree-width.
Discrete Applied Mathematics, 157:583-595, 2009.

F. Gurski and E. Wanke
On Module-Composed Graphs.
In Proceedings of WG '08, LNCS, 5911:166-177, Springer Verlag, 2009.

A. Hugger, A. Kravchenko, A. Weiser, S. Hugger, H. J. Schindler, and E. Wanke.
Muscular work ratios within and between masseter muscles during different chewing tasks.
Society of Oral Physiology: Abstracts of the the 26th Store Kro Club Conference in Dresden, Germany, 7th–10th May 2009, Abstracts of Oral Presentations 2009.

2008

G. Bezgina, E. Wanke, A. Krumnack and R. Kötter
Deducing logical relationships between spatially registered cortical parcellations under conditions of uncertainty.
Neural Networks, 21(8):1132-1145, 2008.

2007

F. Gurski and E. Wanke.
Line graphs of bounded clique-width.
Discrete Mathematics, 307(22):2734-2753, 2007.

F. Gurski and E. Wanke.
A local characterization of bounded clique-width for line graphs.
Discrete Mathematics, 307(6):756-759, 2007.

F. Gurski and E. Wanke.
The Clique-Width of Tree-Power and Leaf-Power Graphs.
In Proceedings of WG '07, LNCS, 4769:76-85, Springer Verlag, 2007.

M. Abraham, R. Kötter, A. Krumnack and E. Wanke.
Shapley Ratings in Brain Networks.
Frontiers in Neuroinformatics, 1:2, doi: 10.3389/neuro.11.002.2007.

2006

F. Gurski and E. Wanke.
Vertex Disjoint Paths on Clique-width bounded Graphs.
Theoretical Computer Science, 359(1-3):188-199, 2006.

M. Abraham, R. Kötter, A. Krumnack and E. Wanke.
A connectivity rating for vertices in networks.
In Proceedings of the 4th IFIP International Conference on Theoretical Computer Science-TCS, 283-298, 2006, Springer Verlag, 2006.

2005

F. Gurski and E. Wanke.
On the relation between NLC-width and linear NLC-width.
Theoretical Computer Science, 347:76-89, 2005.

R. Kötter and E. Wanke.
Mapping brains without coordinates.
Philosophical Transactions of The Royal Society: Biological Sciences, 360(1456):751-766, 2005.

W. Espelage and E. Wanke.
A linear time approximation algorithm for movement minimization in conveyor flow shop processing.
European Journal of Operational Research, 160(2):485-500, 2005.

F. Gurski and E. Wanke.
Minimizing NLC-Width is NP-Complete.
In Proceedings of WG '05, LNCS, 3787:69-80, Springer Verlag, 2005.

2004

E. Wanke and R. Kötter.
Oriented paths in mixed graphs.
In Proceedings of ISAAC '04, LNCS, 3341:629-643, Springer Verlag, 2004.

F. Gurski and E. Wanke.
Vertex disjoint paths on Clique-width bounded graphs (extended abstract).
In Proceedings of LATIN '04, LNCS, 2978:119-128, Springer Verlag, 2004.

2003

W. Espelage, F. Gurski and E. Wanke.
Deciding clique-width for graphs of bounded tree-width.
Journal of Graph Algorithms and Applications - Special Issue of JGAA on WADS 2001, 7(2):141-180, 2003.

W. Espelage and E. Wanke.
Movement minimization for unit distances in conveyor flow shop processing.
Mathematical Methods of Operations Research, 57(2):172-206, 2003.

2002

K. Skodinis and E. Wanke.
Node replacements in embedding normal form.
Journal of Computer and System Sciences, 65(2):351-376, 2002.

2001

J. Rethmann and E. Wanke.
Stack-up algorithms for palletizing at delivery industry.
European Journal of Operational Research, 128(1):74-97, 2001.

W. Espelage and E. Wanke.
A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing.
In Proceedings of MFCS '01, LNCS, 2136:363-374, Springer Verlag, 2001.

W. Espelage, F. Gurski and E. Wanke.
How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time.
In Proceedings of WG '01, LNCS, 2204:117-128, Springer Verlag, 2001.

W. Espelage, F. Gurski and E. Wanke.
Deciding clique-width for graphs of bounded tree-width.
In Proceedings of WADS '01, LNCS, 2125:87-98, Springer Verlag, 2001.

2000

W. Espelage and E. Wanke.
The combinatorial complexity of masterkeying.
Mathematical Methods of Operations Research, 52(2):325-348, 2000.

W. Espelage and E. Wanke.
Movement optimization in flow shop processing with buffers.
Mathematical Methods of Operations Research, 51(3):495-513, 2000.

J. Rethmann and E. Wanke.
An approximation algorithm for the stack-up problem.
Mathematical Methods of Operations Research, 51(2):203-233, 2000.

F. Höfting and E. Wanke.
Polynomial time analysis of toroidal periodic graphs.
Journal of Algorithms, 34:14-39, 2000.

F. Gurski and E. Wanke.
The tree-width of clique-width bounded graphs without Kn,n.
In Proceedings of WG '00, LNCS, 1928:196-205, Springer Verlag, 2000.

W. Espelage and E. Wanke.
Movement minimization in conveyor flow shop processing.
In Proceedings of SODA '00, 233:234, SIAM, Philadelphia, 2000.

K. Skodinis and E. Wanke.
Neighbourhood-preserving node replacement.
In Proceedings of TAGT '98, LNCS, 1764:45-58, Springer Verlag, 2000.

1998

J. Rethmann and E. Wanke.
An optimal algorithm for on-line palletizing at delivery industry.
In Proceedings of ISAAC '98, LNCS, 1533:109-118, Springer Verlag, 1998.

W. Espelage and E. Wanke.
0/1 Permutation flow shop scheduling.
Technical Report, Universität Düsseldorf, 1998.

1997

J. Rethmann and E. Wanke.
Storage controlled pile-up systems, theoretical foundations.
European Journal of Operational Research, 103(3):515-530, 1997.

K. Skodinis and E. Wanke.
Degree problems for eNCE graph grammars.
Information and Computation, 135(1):15-35, 1997.

J. Rethmann and E. Wanke.
Competitive analysis of on-line stack-up algorithms.
In Proceedings of ESA '97, LNCS, 1284:402-415, Springer Verlag, 1997.

J. Rethmann and E. Wanke.
An approximation algorithm for stacking-up bins from a conveyor onto pallets.
In Proceedings of WADS '97, LNCS, 1272:440-449, Springer Verlag, 1997.

J. Rethmann and E. Wanke.
Storage controlled pile-up systems, theoretical foundations.
In Proceedings of SOR '96, Springer Verlag, 111-116, 1997.

1996

T. Lengauer, I. Koch and E. Wanke.
An algorithm for finding maximal common subtopologies in a set of protein structures.
Journal of Computational Biology, 3(2):289-306, 1996.

E. Wanke.
Undecidability of restricted uniform recurrence equations.
Acta Informatica, 33,463-475, 1996.

1995

K. Skodinis and E. Wanke.
The complexity of emptiness problems of eNCE graph grammars.
Journal of Computer and System Sciences, 51(3):472-485, 1995.

F. Höfting and E. Wanke.
Minimum cost paths in periodic graphs.
SIAM Journal on Computing, 24(5):1051-1067, 1995.

K. Skodinis and E. Wanke.
The bounded degree problem for non-obstructing eNCE Graph grammars.
In Proceedings of GraGra '94, LNCS, 1073:211-224, 1995.

K. Skodinis and E. Wanke.
Exponential time analysis of confluent and boundary eNCE graph grammars.
In Proceedings of WG '94, LNCS, 903:180-192, 1995.

1994

E. Wanke.
k-NLC graphs and polynomial algorithms.
Discrete Applied Mathematics, 54:251-266, 1994.

E. Wanke.
Bounded tree-width and LOGCFL.
Journal of Algorithms, 16:470-491, 1994.

E. Wanke.
On the decidability of certain integer subgraph problems on context-free graph languages.
Information and Computation, 113(1):26-49, 1994.

E. Wanke.
The complexity of connectivity problems on context-free graph languages.
Journal of Computer and System Sciences, 49(1):57-82, 1994.

F. Höfting and E. Wanke.
Polynomial time analysis of toroidal periodic graphs.
In Proceedings of ICALP '94, LNCS, 820:544-555, 1994.

E. Wanke.
Bounded tree-width and LOGCFL.
In Proceedings of WG '93, LNCS, 790:33-44, 1994.

Analysis of Graphs Defined by Succinct Specifications. Habilitationsschrift, Gesellschaft für Mathematik und Datenverarbeitung (GMD), Juli 1994.

1993

T. Lengauer and E. Wanke.
Efficient analysis of graph properties on context-free graph languages.
Journal of the ACM, 40(2):368-393, 1993.

E. Wanke.
Paths and cycles in finite periodic graphs.
In Proceedings of MFCS '93, LNCS, 711:751-759, 1993.

F. Höfting and E. Wanke.
Polynomial algorithms for minimum cost paths in periodic graphs.
In Proceedings of SODA '93, 493-499, SIAM, Philadelphia, 1993.

1992

F. Höfting, T. Lengauer and E. Wanke.
Processing of hierarchically defined graphs and graph families.
In B. Monien and T. Ottmann, Hrsg., Data Structures and Efficient Algorithms, LNCS, 594:44-69, 1992.

E. Wanke.
Paths and cycles in finite periodic graphs.
Technischer Bericht, 1/92, Universität-Gesamthochschule-Paderborn, 1992.

1991

E. Wanke.
Algorithms for graph problems on BNLC structured graphs.
Information and Computation, 94(1):93-122, 1991.

E. Wanke.
On the decidability of integer subgraph problems on context-free graph languages.
In Proceedings of FCT '91, LNCS, 529:415-426, 1991.

1989

E. Wanke and M. Wiegers.
Undecidability of the bandwidth problem on certain linear graph languages.
Information Processing Letters, 4(33):193-197, 1989.

E. Wanke.
The complexity of connectivity problems on context-free graph languages.
In Proceedings of FCT '89, LNCS, 380:470-479, 1989.

E. Wanke.
Algorithmen und Komplexitätsanalyse für die Verarbeitung hierarchisch definierter Graphen und hierarchisch definierter Graphfamilien. Dissertation, Universität-Gesamthochschule-Paderborn, November 1989.

1988

T. Lengauer and E. Wanke.
Efficient solution of connectivity problems on hierarchically defined graphs.
SIAM Journal on Computing, 6(17): 1063-1080, 1988.

T. Lengauer and E. Wanke.
Efficient analysis of graph properties on context-free graph languages.
In Proceedings of ICALP '88, LNCS, 317:379-393, 1988.

T. Lengauer and E. Wanke.
Efficient processing of hierarchical graphs for engineering design.
Bulletin of the European Association for Theoretical Computer Science (EATCS), 25:143-157, 1988.

Verantwortlichkeit: