Karsten Weihe - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 67 from 67

2023

Choosing a Didactic Basis for an Instructional Video: What Are the Implications For Novice Programmers?Svana Esche, Karsten Weihe. iticse 2023: 450-456 [doi]

Case Study on the Terms Novice Programmers Use to Describe Code Snippets in JavaSvana Esche, Karsten Weihe. te, 66(6):642-653, December 2023. [doi]

2020

Efficient monitoring of public transport journeysFelix Gündling, Florian Hopp, Karsten Weihe. pubtrans, 12(3):631-645, 2020. [doi]

2017

2016

2015

Motifs in NetworksKarsten Weihe. In Andreas S. Schulz, Martin Skutella, Sebastian Stiller, Dorothea Wagner, editors, Gems of Combinatorial Optimization and Graph Algorithms. pages 59-68, Springer, 2015. [doi]

2014

Knowledge Discovery in Scientific LiteratureJinseok Nam, Christian Kirschner, Zheng Ma, Nicolai Erbs, Susanne Neumann, Daniela Oelke, Steffen Remus, Chris Biemann, Judith Eckle-Kohler, Johannes Fürnkranz, Iryna Gurevych, Marc Rittberger, Karsten Weihe. konvens 2014: 66-76

2012

Quantifying Semantics using Complex Network AnalysisChris Biemann, Stefanie Roos, Karsten Weihe. COLING 2012: 263-278 [doi]

Reliability and Delay Distributions of Train ConnectionsMohammad H. Keyhani, Mathias Schnee, Karsten Weihe, Hans-Peter Zorn. atmos 2012: 35-46 [doi]

2009

Local search starting from an LP solution: Fast and quite goodAlaubek Avdil, Karsten Weihe. jea, 14, 2009. [doi]

2008

Weiterbildung an Universitäten: Gegenwartt und ZukunftKarsten Weihe. gi 2008: 23-32 [doi]

2007

Maximum ::::s-t::::-flow with ::::k:::: crossings in ::::O::::(::::k:::::::3:::::::n:::: log ::::n::::) timeJan M. Hochstein, Karsten Weihe. soda 2007: 843-847 [doi]

2006

Moving policies in cyclic assembly line schedulingMatthias Müller-Hannemann, Karsten Weihe. TCS, 351(3):425-436, 2006. [doi]

On the cardinality of the Pareto set in bicriteria shortest path problemsMatthias Müller-Hannemann, Karsten Weihe. anor, 147(1):269-286, 2006. [doi]

Workload Balancing in Multi-stage Production ProcessesSiamak Tazari, Matthias Müller-Hannemann, Karsten Weihe. wea 2006: 49-60 [doi]

2005

Weak Symmetries in Problem FormulationsRoland Martin, Karsten Weihe. cp 2005: 858 [doi]

2004

Edge-disjoint routing in plane switch graphs in linear timeJan M. Hochstein, Karsten Weihe. JACM, 51(4):636-670, 2004. [doi]

Moving Policies in Cyclic Assembly-Line SchedulingMatthias Müller-Hannemann, Karsten Weihe. iwpec 2004: 149-161 [doi]

2002

Getting Train Timetables into the Main StorageMatthias Müller-Hannemann, Mathias Schnee, Karsten Weihe. ENTCS, 66(6):8-17, 2002. [doi]

2001

Pareto Shortest Paths is Often Feasible in PracticeMatthias Müller-Hannemann, Karsten Weihe. wae 2001: 185-198 [doi]

A software engineering perspective on algorithmicsKarsten Weihe. ACM Comput. Surv., 33(1):89-134, 2001. [doi]

2000

Recognizing Bundles in Time Table Graphs - A Structural ApproachAnnegret Liebers, Karsten Weihe. wae 2001: 87-98 [doi]

On the Hardness of Recognizing Bundles in Time Table GraphsAnnegret Liebers, Dorothea Wagner, Karsten Weihe. ijfcs, 11(3):467-484, 2000.

Quadrangular Refinements of Convex Polygons with an Application to Finite-Element MeshesMatthias Müller-Hannemann, Karsten Weihe. ijcga, 10(1):1-40, 2000.

Dijkstra s Algorithm On-Line: An Empirical Case Study from Public Railroad TransportFrank Schulz, Dorothea Wagner, Karsten Weihe. jea, 5:12, 2000. [doi]

Editorial: Discrete algorithm engineeringDorothea Wagner, Karsten Weihe. SPE, 30(11):1165, 2000.

On the Differences between Practical and Applied Karsten Weihe. wae 2001: 1-10 [doi]

Reconstructing the Topology of a CAD Model - a Discrete ApproachKarsten Weihe, Thomas Willhalm. algorithmica, 26(1):126-147, 2000. [doi]

1999

1998

Iterators Evaluate Table Queries (C++ Toolbox)Dieter Gluche, Dietmar Kühl, Karsten Weihe. SIGPLAN, 33(1):22-29, 1998.

The STL Model in the Geometric DomainUllrich Köthe, Karsten Weihe. Dagstuhl 2000: 232-248 [doi]

Laufzeitdynamische Evaluierung tabellarischer DatenKarsten Weihe. ife, 13(2):61-71, 1998.

Why CAD Data Repair Requires Discrete Algorithmic TechniquesKarsten Weihe, Thomas Willhalm. wae 1998: 1-12

1997

Efficient, Adaptable Implementations of Graph AlgorithmsDietmar Kühl, Marco Nissen, Karsten Weihe. wae 1997: 32-41

Mesh refinement via bidirected flows: modeling, complexity, and computational resultsRolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe. JACM, 44(3):395-426, 1997. [doi]

Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element MeshesMatthias Müller-Hannemann, Karsten Weihe. esa 1997: 364-377

Minimum Strictly Convex Quadrangulations of Convex PolygonsMatthias Müller-Hannemann, Karsten Weihe. compgeom 1997: 193-202 [doi]

The Vertex-Disjoint Menger Problem in Planar GraphsHeike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe. SICOMP, 26(2):331-349, 1997.

Reuse of Algorithms: Still a Challenge to Object-Oriented ProgrammingKarsten Weihe. OOPSLA 1997: 34-48

Maximum (s, t)-Flows in Planar Networks in O(|V|log|V|)-TimeKarsten Weihe. jcss, 55(3):454-476, 1997.

Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear TimeKarsten Weihe. jal, 23(1):121-138, 1997.

Multicommodity Flows in Even, Planar NetworksKarsten Weihe. algorithmica, 18(3):363-383, 1997.

Reconstructing the Topology of a CAD Model: A Discrete ApproachKarsten Weihe, Thomas Willhalm. esa 1997: 500-513

1996

C++ im Nebenfachstudium: Konzepte und ErfahrungenAnnegret Liebers, Dorothea Wagner, Karsten Weihe. insk, 19(5):262-265, 1996.

Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar GraphsHeike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe. ijfcs, 7(2):95-110, 1996.

1995

Book reviewsS. Gowda, Karsten Weihe. mmor, 41(2):250-254, 1995. [doi]

Using Network Flows for Surface ModelingRolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe. soda 1995: 350-359

An Animated Library of Combinatorial VLSI-Routing AlgorithmsDorothea Wagner, Karsten Weihe. compgeom 1995: [doi]

A Linear-Time Algorithm for Edge-Disjoint Paths in Planar GraphsDorothea Wagner, Karsten Weihe. combinatorica, 15(1):135-150, 1995.

1994

Wiring Knock-Knee Layouts: A Global ApproachMajid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe. TC, 43(5):581-589, 1994.

Edge-Disjoint (s, t)-Paths on Undirected Planar Graphs in Linear TimeKarsten Weihe. esa 1994: 130-140

Maximum (s, t)-Flows in Planar Networks in O(|V| log |V|) TimeKarsten Weihe. focs 1994: 178-189

1993

1992

Wiring Knock-Knee Layouts: A Global AppoachMajid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe. isaac 1992: 388-399

All Publications

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Karsten Weihe'

Viewing Publication 1 - 67 from 67

2023

2020

2017

2016

2015

2014

2012

2009

2008

2007

2006

2005

2004

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

All Publications

Filter by Year [-]OR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Karsten Weihe'

Viewing Publication 1 - 67 from 67

2023

2020

2017

2016

2015

2014

2012

2009

2008

2007

2006

2005

2004

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1