Your search returned the following 15 documents:
-
Online Graph Exploration: New Results on Old and New Algorithms
Nicole Megow, Kurt Mehlhorn, and Pascal Schweitzer
Theoretical Computer Science 463: 62-72, 2012
-
Certifying algorithms
Kurt Mehlhorn, Stefan Näher, and Pascal Schweitzer
Computer Science Review 5 (2): 119-161, 2011
-
Online Graph Exploration: New Results on Old and New Algorithms
Nicole Megow, Kurt Mehlhorn, and Pascal Schweitzer
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, 2011, 478-489
-
Weisfeiler-Lehman graph kernels
Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt Mehlhorn, and Karsten M. Borgwardt
Journal of Machine Learning Research 12: 2539-2561, 2011
-
Certifying algorithms
Ross M. McConnella, Kurt Mehlhorn, Stefan Näher, and Pascal Schweitzer
Computer Science Review Article in Press: 1-43, 2010
-
Connecting face hitting sets in planar graphs
Pascal Schweitzer and Patrick Schweitzer
Information Processing Letters 111 (1): 11-15, 2010
-
Homomorphism -- homogeneous graphs
Momchil Rusinov and Pascal Schweitzer
Journal of Graph Theory 65 (3): 253-262, 2010
-
Isomorphism for Graphs of Bounded Feedback Vertex Set Number
Stefan Kratsch and Pascal Schweitzer
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, 2010, 81-92
-
Progress on Certifying Algorithms
Kurt Mehlhorn and Pascal Schweitzer
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, Wuhan, China, 2010, 1-5
-
Paging and List Update under Bijective Analysis
Spyros Angelopoulos and Pascal Schweitzer
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, NY, 2009, 1136-1145
-
Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Pascal Schweitzer
Doctoral dissertation, Universität des Saarlandes, 2009
-
Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
Pascal Schweitzer
Information Processing Letters 109 (4): 229-232, 2009
-
Counting Defective Parking Functions
Peter Cameron, Daniel Johannsen, Thomas Prellberg, and Pascal Schweitzer
Electronic Journal of Combinatorics 15 (1): R92 p., 2008
[PDF: Download: CameronJohannsenPrellbergSchweitzer_2008_CountingDefectiveParkingFunctions.pdf]
-
The Co-Word Problem for the Higman-Thompson Group is context-free
Jörg Lehnert and Pascal Schweitzer
Bulletin of the London Mathematical Society 39 (2): 235-241, 2007
-
ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
Martin Kutz and Pascal Schweitzer
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), New Orleans, USA, 2007, 150-157