Egon Wanke

According to our database1, Egon Wanke
  • authored at least 79 papers between 1988 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2016
A linear time algorithm for metric dimension of cactus block graphs.
Theor. Comput. Sci., 2016

Directed NLC-width.
Theor. Comput. Sci., 2016

On the complexity of the FIFO stack-up problem.
Math. Meth. of OR, 2016

Minimum Power Range Assignment for Symmetric Connectivity in Sensor Networks with two Power Levels.
CoRR, 2016

On-Line Algorithms for Controlling Palletizers.
Proceedings of the Operations Research Proceedings 2016, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Helmut Schmidt University Hamburg, Germany, August 30, 2016

Generic Route Repair: Augmenting Wireless Ad Hoc Sensor Networks for Local Connectivity.
Proceedings of the 15th ACM/IEEE International Conference on Information Processing in Sensor Networks, 2016

2015
Integer Programming Models and Parameterized Algorithms for Controlling Palletizers.
CoRR, 2015

An Experimental Study of Algorithms for Controlling Palletizers.
Proceedings of the Operations Research Proceedings 2015, 2015

A Practical Approach for the FIFO Stack-Up Problem.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015

Directed Pathwidth and Palletizers.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
Algorithms for Controlling Palletizers.
Proceedings of the Operations Research Proceedings 2014, 2014

2013
Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete.
CoRR, 2013

Complexity of the FIFO Stack-Up Problem.
CoRR, 2013

Hierarchical Bipartition Routing for delivery guarantee in sparse wireless ad hoc sensor networks with obstacles.
CoRR, 2013

Moving Bins from Conveyor Belts onto Pallets Using FIFO Queues.
Proceedings of the Operations Research Proceedings 2013, 2013

2012
Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete.
Proceedings of the Algorithms for Sensor Systems, 2012

2010
Criteria for optimizing cortical hierarchies with continuous ranges.
Front. Neuroinform., 2010

Brief announcement: complexity and solution of the send-receive correlation problem.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Exakte Algorithmen für schwere Graphenprobleme.
eXamen.press, Springer, ISBN: 978-3-642-04499-1, 2010

2009
Optimization of cortical hierarchies with continuous scales and ranges.
NeuroImage, 2009

The NLC-width and clique-width for powers of graphs of bounded tree-width.
Discrete Applied Mathematics, 2009

On Module-Composed Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

2008
Deducing logical relationships between spatially registered cortical parcellations under conditions of uncertainty.
Neural Networks, 2008

2007
Shapley ratings in brain networks.
Front. Neuroinform., 2007

Line graphs of bounded clique-width.
Discrete Mathematics, 2007

A local characterization of bounded clique-width for line graphs.
Discrete Mathematics, 2007

The Clique-Width of Tree-Power and Leaf-Power Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

2006
Vertex disjoint paths on clique-width bounded graphs.
Theor. Comput. Sci., 2006

A Connectivity Rating for Vertices in Networks.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

2005
On the relationship between NLC-width and linear NLC-width.
Theor. Comput. Sci., 2005

A linear time approximation algorithm for movement minimization in conveyor flow shop processing.
European Journal of Operational Research, 2005

Minimizing NLC-Width is NP-Complete.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

2004
Vertex Disjoint Paths on Clique-Width Bounded Graphs.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Oriented Paths in Mixed Graphs.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003
Movement minimization for unit distances in conveyor flow shop processing.
Math. Meth. of OR, 2003

Deciding Clique-Width for Graphs of Bounded Tree-Width.
J. Graph Algorithms Appl., 2003

2002
Node Replacements in Embedding Normal Form.
J. Comput. Syst. Sci., 2002

2001
Stack-up algorithms for palletizing at delivery industry.
European Journal of Operational Research, 2001

How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Deciding Clique-Width for Graphs of Bounded Tree-Width.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000
An approximation algorithm for the stack-up problem.
Math. Meth. of OR, 2000

The combinatorial complexity of masterkeying.
Math. Meth. of OR, 2000

Movement optimization in flow shop processing with buffers.
Math. Meth. of OR, 2000

Polynomial-Time Analysis of Toroidal Periodic Graphs.
J. Algorithms, 2000

The Tree-Width of Clique-Width Bounded Graphs Without Kn, n.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Movement minimization in conveyor flow shop processing.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1998
Neighborhood-Preserving Node Replacements.
Proceedings of the Theory and Application of Graph Transformations, 1998

An Optimal Algorithm for On-Line Palletizing at Delivery Industry.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997
The Bounded Degree Problem for eNCE Graph Grammars.
Inf. Comput., 1997

An Approximation Algorithm for Stacking up Bins from a Conveyor onto Pallets.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Competivive Analysis of on-line Stack-Up Algorithms.
Proceedings of the Algorithms, 1997

1996
An Algorithm for Finding Maximal Common Subtopologies in a Set of Protein Structures.
Journal of Computational Biology, 1996

Undecidability of Restricted Uniform Recurrence Equations.
Acta Inf., 1996

1995
Minimum Cost Paths in Periodic Graphs.
SIAM J. Comput., 1995

Emptiness Problems of eNCE Graph Languages.
J. Comput. Syst. Sci., 1995

1994
On the Decidability of Certain Integer Subgraph Problems on Context-Free Graph Languages
Inf. Comput., August, 1994

The Complexity of Connectivity Problems on Context-Free Graph Languages.
J. Comput. Syst. Sci., 1994

Bounded Tree-Width and LOGCFL.
J. Algorithms, 1994

k-NLC Graphs and Polynomial Algorithms.
Discrete Applied Mathematics, 1994

Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars.
Proceedings of the Graph Gramars and Their Application to Computer Science, 1994

Polynomial Time Analysis of Torodial Periodic Graphs.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
Efficient Decision Procedures for Graph Properties on Centext-Free Graph Languages.
J. ACM, 1993

Bounded Tree-Width and LOGCFL.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1st Grade - A System for Implementation, Testing and Animation of Graph Algorithms.
Proceedings of the STACS 93, 1993

Polynomial Algorithms for Minimum Cost Paths in Periodic Graphs.
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Paths and Cycles in Finite Periodic Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
Processing of Hierarchically Defined Graphs and Graph Families.
Proceedings of the Data Structures and Efficient Algorithms, 1992

1991
Algorithms for Graph Problems on BNLC Structured Graphs
Inf. Comput., September, 1991

On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990
PLEXUS: Tools for Analyzing Graph Grammars.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1990

1989
Algorithmen und Komplexitätsanalyse für die Verarbeitung hierarchisch definierter Graphen und hierarchisch definierter Graphfamilien.
PhD thesis, 1989

Undecidability of the Bandwidth Problem on Linear Graph Languages.
Inf. Process. Lett., 1989

The Complexity of Connectivity Problems on Context-Free Graph Languages (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 1989

1988
Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs.
SIAM J. Comput., 1988

Efficient processing of hierarchical graphs for engineering design.
Bulletin of the EATCS, 1988

PLEXUS: A System for Implementing Hierarchical Graph Algorithms.
Proceedings of the STACS 88, 1988

Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988


  Loading...