| The Weifeiler-Leman Algorithm and Recognition of Graph Properties | 0 | 0.34 | 2021 |
| Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm. | 0 | 0.34 | 2020 |
| On the Weisfeiler-Leman Dimension of Fractional Packing. | 0 | 0.34 | 2020 |
| On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties. | 0 | 0.34 | 2018 |
| Circular-arc hypergraphs: Rigidity via Connectedness. | 0 | 0.34 | 2017 |
| Parameterized Complexity of Small Weight Automorphisms. | 0 | 0.34 | 2017 |
| The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. | 0 | 0.34 | 2016 |
| On Tinhofer’s Linear Programming Approach to Isomorphism Testing | 0 | 0.34 | 2015 |
| Lowness results: the next generation. | 0 | 0.34 | 2015 |
| On the Power of Color Refinement. | 7 | 0.47 | 2015 |
| Graph Isomorphism, Color Refinement, and Compactness. | 2 | 0.39 | 2015 |
| Solving Linear Equations Parameterized by Hamming Weight. | 0 | 0.34 | 2014 |
| On the isomorphism problem for Helly circular-arc graphs. | 1 | 0.35 | 2014 |
| The Parallel Complexity of Graph Canonization Under Abelian Group Action. | 0 | 0.34 | 2013 |
| Helly Circular-Arc Graph Isomorphism Is in Logspace. | 6 | 0.49 | 2013 |
| On the isomorphism problem for decision trees and decision lists | 0 | 0.34 | 2013 |
| Approximate graph isomorphism | 5 | 0.43 | 2012 |
| Around and Beyond the Isomorphism Problem for Interval Graphs. | 0 | 0.34 | 2012 |
| Interval Graph Representation with Given Interval and Intersection Lengths. | 2 | 0.38 | 2012 |
| Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace. | 3 | 0.40 | 2012 |
| The isomorphism problem for k-trees is complete for logspace | 5 | 0.42 | 2012 |
| Canonizing hypergraphs under abelian group action | 1 | 0.36 | 2011 |
| Colored Hypergraph Isomorphism is Fixed Parameter Tractable | 3 | 0.41 | 2010 |
| Interval graphs: canonical representation in logspace | 7 | 0.49 | 2010 |
| The Isomorphism Problem for k-Trees Is Complete for Logspace | 5 | 0.42 | 2009 |
| Nondeterministic functions and the existence of optimal proof systems | 9 | 0.56 | 2009 |
| Colored Hypergraph Isomorphism is Fixed Parameter Tractable. | 0 | 0.34 | 2009 |
| Parameterized learnability of juntas | 3 | 0.37 | 2009 |
| Proof systems that take advice | 3 | 0.39 | 2009 |
| Nondeterministic Instance Complexity and Proof Systems with Advice | 5 | 0.48 | 2008 |
| A logspace algorithm for partial 2-tree canonization | 12 | 0.66 | 2008 |
| Parameterized Learnability of k-Juntas and Related Problems | 3 | 0.45 | 2007 |
| The space complexity of k-tree isomorphism | 7 | 0.50 | 2007 |
| A general dimension for query learning | 9 | 0.64 | 2007 |
| Learning Boolean Functions under the Uniform. | 0 | 0.34 | 2006 |
| The complexity of learning concept classes with polynomial general dimension | 2 | 0.41 | 2006 |
| On graph isomorphism for restricted graph classes | 14 | 0.63 | 2006 |
| Corrigendum to “Completeness results for graph isomorphism” [J. Comput. System Sci. 66 (2003) 549–566] | 0 | 0.34 | 2006 |
| On hypergraph and graph isomorphism with bounded color classes | 5 | 0.43 | 2006 |
| Average-case intractability vs. worst-case intractability | 3 | 0.39 | 2004 |
| Optimal proof systems imply complete sets for promise classes | 25 | 0.94 | 2003 |
| Completeness results for graph isomorphism | 27 | 0.98 | 2003 |
| New Lowness Results for ZPPNP and Other Complexity Classes | 2 | 0.37 | 2002 |
| The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3 | 2 | 0.40 | 2002 |
| A General Dimension for Approximately Learning Boolean Functions | 3 | 0.42 | 2002 |
| On pseudorandomness and resource-bounded measure | 25 | 1.03 | 2001 |
| Nondeterministic Instance Complexity and Hard-to-Prove Tautologies | 2 | 0.42 | 2000 |
| Is the Standard Proof System for SAT P-Optimal? | 10 | 0.63 | 2000 |
| On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation | 0 | 0.34 | 2000 |
| Oracles in Sigmap2 are Sufficient for Exact Learning | 3 | 0.48 | 2000 |
