Permanents, Pfaffian orientations, and even directed circuits (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computing the Girth of a Planar Graph
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Finding 3-shredders efficiently
ACM Transactions on Algorithms (TALG)
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
Sign-Solvable Linear Complementarity Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
A combinatorial algorithm for Pfaffians
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Recognizing near-bipartite Pfaffian graphs in polynomial time
Discrete Applied Mathematics
Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
Journal of Combinatorial Theory Series B
A faster algorithm for computing the girth of planar and bounded genus graphs
ACM Transactions on Algorithms (TALG)
On the Polya permanent problem over finite fields
European Journal of Combinatorics
Computing the inertia from sign patterns
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
GD'04 Proceedings of the 12th international conference on Graph Drawing
A generalization of Little's Theorem on Pfaffian orientations
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |