Karsten Weihe - RankMe

68 papers A* 5A 7B 5C 2Journal 28Unranked 20

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	Case Study on the Terms Novice Programmers Use to Describe Code Snippets in Java. IEEE Trans. Educ. Svana Esche, Karsten Weihe
2023	—	`conf`	Choosing a Didactic Basis for an Instructional Video: What Are the Implications For Novice Programmers? ITiCSE (1) Svana Esche, Karsten Weihe
2020	J	`jnl`	Efficient monitoring of public transport journeys. Public Transp. Felix Gündling, Florian Hopp, Karsten Weihe
2017	J	`jnl`	Arrive in Time by Train with High Probability. Transp. Sci. Mohammad H. Keyhani, Mathias Schnee, Karsten Weihe
2017	A	`conf`	Distributed Graph-based Topology Adaptation using Motif Signatures. ALENEX Michael Stein, Karsten Weihe, Augustin Wilberg, Roland Kluge, Julian M. Klomp, Mathias Schnee, Lin Wang, Max Mühlhäuser
2017	—	`conf`	Is Interaction More Important than Individual Performance?: A Study of Motifs in Wikia. WWW (Companion Volume) Thomas Arnold, Johannes Daxenberger, Iryna Gurevych, Karsten Weihe
2016	—	`conf`	Evaluation study for clustering in wireless sensor networks. CSNDSP Michael Stein, Dominic Lerbs, Mohamed Hassan, Mathias Schnee, Immanuel Schweizer, Karsten Weihe, Max Mühlhäuser
2016	—	`conf`	Improve Sentiment Analysis of Citations with Author Modelling. WASSA@NAACL-HLT Zheng Ma, Jinseok Nam, Karsten Weihe
2016	—	`conf`	Network Motifs May Improve Quality Assessment of Text Documents. TextGraphs@NAACL-HLT Thomas Arnold, Karsten Weihe
2015	—	`ch.`	Motifs in Networks. Gems of Combinatorial Optimization and Graph Algorithms Karsten Weihe
2014	—	`conf`	Knowledge Discovery in Scientific Literature. KONVENS Jinseok 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
2012	B	`conf`	Quantifying Semantics using Complex Network Analysis. COLING Chris Biemann, Stefanie Roos, Karsten Weihe
2012	C	`conf`	Reliability and Delay Distributions of Train Connections. ATMOS Mohammad H. Keyhani, Mathias Schnee, Karsten Weihe, Hans-Peter Zorn
2010	J	`jnl`	Phase Synchronization in Railway Timetables CoRR Christoph Fretter, Lachezar Krumov, Karsten Weihe, Matthias Müller-Hannemann, Marc-Thorsten Hütt
2009	J	`jnl`	Local search starting from an LP solution: Fast and quite good. ACM J. Exp. Algorithmics Alaubek Avdil, Karsten Weihe
2008	—	`conf`	Weiterbildung an Universitäten: Gegenwartt und Zukunft. Lebenslanges Lernen in der Informatik Karsten Weihe
2007	A*	`conf`	Maximum SODA Jan M. Hochstein, Karsten Weihe
2006	J	`jnl`	Moving policies in cyclic assembly line scheduling. Theor. Comput. Sci. Matthias Müller-Hannemann, Karsten Weihe
2006	J	`jnl`	On the cardinality of the Pareto set in bicriteria shortest path problems. Ann. Oper. Res. Matthias Müller-Hannemann, Karsten Weihe
2006	—	`conf`	Workload Balancing in Multi-stage Production Processes. WEA Siamak Tazari, Matthias Müller-Hannemann, Karsten Weihe
2005	A	`conf`	Weak Symmetries in Problem Formulations. CP Roland Martin, Karsten Weihe
2004	J	`jnl`	Edge-disjoint routing in plane switch graphs in linear time. J. ACM Jan M. Hochstein, Karsten Weihe
2004	—	`conf`	Moving Policies in Cyclic Assembly-Line Scheduling. IWPEC Matthias Müller-Hannemann, Karsten Weihe
2002	C	`conf`	Getting Train Timetables into the Main Storage. ATMOS Matthias Müller-Hannemann, Mathias Schnee, Karsten Weihe
2001	J	`jnl`	A software engineering perspective on algorithmics. ACM Comput. Surv. Karsten Weihe
2001	—	`conf`	Pareto Shortest Paths is Often Feasible in Practice. WAE Matthias Müller-Hannemann, Karsten Weihe
2000	J	`jnl`	Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. ACM J. Exp. Algorithmics Frank Schulz, Dorothea Wagner, Karsten Weihe
2000	J	`jnl`	Editorial: Discrete algorithm engineering. Softw. Pract. Exp. Dorothea Wagner, Karsten Weihe
2000	—	`conf`	On the Differences between "Practical" and "Applied". WAE Karsten Weihe
2000	J	`jnl`	On the Hardness of Recognizing Bundles in Time Table Graphs. Int. J. Found. Comput. Sci. Annegret Liebers, Dorothea Wagner, Karsten Weihe
2000	J	`jnl`	Quadrangular Refinements of Convex Polygons with an Application to Finite-Element Meshes. Int. J. Comput. Geom. Appl. Matthias Müller-Hannemann, Karsten Weihe
2000	—	`conf`	Recognizing Bundles in Time Table Graphs - A Structural Approach. WAE Annegret Liebers, Karsten Weihe
2000	J	`jnl`	Reconstructing the Topology of a CAD Model - a Discrete Approach. Algorithmica Karsten Weihe, Thomas Willhalm
1999	J	`jnl`	A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks. Discret. Appl. Math. Ulrik Brandes, Wolfram Schlickenrieder, Gabriele Neyer, Dorothea Wagner, Karsten Weihe
1999	—	`conf`	Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. WAE Frank Schulz, Dorothea Wagner, Karsten Weihe
1999	A*	`conf`	Edge-Disjoint Routing in Plane Switch Graphs in Linear Time. FOCS Karsten Weihe
1999	—	`conf`	Empirical Design of Geometric Algorithms. SCG Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm
1999	B	`conf`	On the Hardness of Recognizing Bundles in Time Table Graphs. WG Annegret Liebers, Dorothea Wagner, Karsten Weihe
1998	J	`jnl`	Iterators Evaluate Table Queries (C++ Toolbox). ACM SIGPLAN Notices Dieter Gluche, Dietmar Kühl, Karsten Weihe
1998	J	`jnl`	Laufzeitdynamische Evaluierung tabellarischer Daten. Inform. Forsch. Entwickl. Karsten Weihe
1998	—	`conf`	The STL Model in the Geometric Domain. Generic Programming Ullrich Köthe, Karsten Weihe
1998	—	`conf`	Why CAD Data Repair Requires Discrete Algorithmic Techniques. WAE Karsten Weihe, Thomas Willhalm
1997	J	`jnl`	Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time. J. Algorithms Karsten Weihe
1997	—	`conf`	Efficient, Adaptable Implementations of Graph Algorithms. WAE Dietmar Kühl, Marco Nissen, Karsten Weihe
1997	A	`conf`	Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes. ESA Matthias Müller-Hannemann, Karsten Weihe
1997	J	`jnl`	Maximum (s, t)-Flows in Planar Networks in O(\|V\|log\|V\|)-Time. J. Comput. Syst. Sci. Karsten Weihe
1997	J	`jnl`	Mesh refinement via bidirected flows: modeling, complexity, and computational results. J. ACM Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe
1997	—	`conf`	Minimum Strictly Convex Quadrangulations of Convex Polygons. SCG Matthias Müller-Hannemann, Karsten Weihe
1997	J	`jnl`	Multicommodity Flows in Even, Planar Networks. Algorithmica Karsten Weihe
1997	A	`conf`	Reconstructing the Topology of a CAD Model: A Discrete Approach. ESA Karsten Weihe, Thomas Willhalm
1997	A	`conf`	Reuse of Algorithms: Still a Challenge to Object-Oriented Programming. OOPSLA Karsten Weihe
1997	J	`jnl`	The Vertex-Disjoint Menger Problem in Planar Graphs. SIAM J. Comput. Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
1996	J	`jnl`	C++ im Nebenfachstudium: Konzepte und Erfahrungen. Inform. Spektrum Annegret Liebers, Dorothea Wagner, Karsten Weihe
1996	J	`jnl`	Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. Int. J. Found. Comput. Sci. Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
1995	J	`jnl`	A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. Comb. Dorothea Wagner, Karsten Weihe
1995	—	`conf`	An Animated Library of Combinatorial VLSI-Routing Algorithms. SCG Dorothea Wagner, Karsten Weihe
1995	J	`jnl`	Book reviews. Math. Methods Oper. Res. M. Seetharama Gowda, Karsten Weihe
1995	A*	`conf`	Using Network Flows for Surface Modeling. SODA Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe
1994	A	`conf`	Edge-Disjoint (s, t)-Paths on Undirected Planar Graphs in Linear Time. ESA Karsten Weihe
1994	A*	`conf`	Maximum (s, t)-Flows in Planar Networks in O(\|V\| log \|V\|) Time FOCS Karsten Weihe
1994	J	`jnl`	Wiring Knock-Knee Layouts: A Global Approach. IEEE Trans. Computers Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe
1993	A	`conf`	A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs. ESA Dorothea Wagner, Karsten Weihe
1993	J	`jnl`	Book reviews. ZOR Methods Model. Oper. Res. M. Schäffter, Karsten Weihe, Petra Mutzel, Salah E. Elmaghraby
1993	—	`conf`	Efficient algorithms for disjoint paths in planar graphs. Combinatorial Optimization Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
1993	B	`conf`	Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. ISAAC Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
1993	B	`conf`	Multicommodity Flows in Even, Planar Networks. ISAAC Karsten Weihe
1993	A*	`conf`	The Vertex-Disjoint Menger Problem in Planar Graphs. SODA Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe
1992	B	`conf`	Wiring Knock-Knee Layouts: A Global Appoach. ISAAC Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe