Author of the publication

Constant-Time Algorithms for Sparsity Matroids.

, , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 498-509. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Editor's Message for Special Issue of Discrete and Computational Geometry, Graphs, and Games.. J. Inf. Process., (2017)Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with Mountain-Valley Assignment., , , , , , and . J. Inf. Process., (2020)Foreword.. IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 86-A (5): 977 (2003)Every Property Is Testable on a Natural Class of Scale-Free Multigraphs.. ESA, volume 57 of LIPIcs, page 51:1-51:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Slot assignment scheme for integrated voice and data traffic in reservation-type packet radio networks., , , and . PIMRC, page 222-226. IEEE, (2000)On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs., , and . Comput. Complex., 29 (1): 1 (2020)Computational Complexity of Flattening Fixed-Angle Orthogonal Chains., , , and . CCCG, page 98-104. (2022)On computational complexity of graph inference from counting., , , , and . Nat. Comput., 12 (4): 589-603 (2013)Winning Ways of Weighted Poset Games., , and . Graphs Comb., 23 (Supplement-1): 291-306 (2007)Testing Outerplanarity of Bounded Degree Graphs., and . APPROX-RANDOM, volume 6302 of Lecture Notes in Computer Science, page 642-655. Springer, (2010)