( en | de | ru )

 

Disambiguation of "Sebo, András"

Author of the publication

copydeleteadd this publication to your clipboard
Sequential search using question-sets with bounded intersections

. Journal of Statistical Planning and Inference, 7 (2): 139--150 (December 1982)

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.

András Csögör

András Szentkuti

András Forgó

András Fehér

András Frankó

 

Other publications of authors with the same name

A quick proof of Seymour's theorem on t-joins.. Discret. Math., 64 (1): 101-103 (1987)A generalized cut-condition for multiflows in matroids., and . Discret. Math., 113 (1-3): 207-221 (1993)How many matchings cover the nodes of a graph?, , , and . CoRR, (2018)Forcing Colorations and the Strong Perfect Graph Conjecture.. IPCO, page 353-366. Carnegie Mellon University, (1992)An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs., , and . IPCO, volume 1412 of Lecture Notes in Computer Science, page 126-136. Springer, (1998)On Ideal Clutters, Metrics and Multiflows., and . IPCO, volume 1084 of Lecture Notes in Computer Science, page 275-287. Springer, (1996)The Saleman's Improved Tours for Fundamental Classes., and . IPCO, volume 10328 of Lecture Notes in Computer Science, page 111-122. Springer, (2017)Ear-Slicing for Matchings in Hypergraphs.. Graphs Comb., 36 (6): 1947-1951 (2020)On Combinatorial Properties of Binary Spaces., and . IPCO, volume 920 of Lecture Notes in Computer Science, page 212-227. Springer, (1995)An Introduction to Empty Lattice Simplices.. IPCO, volume 1610 of Lecture Notes in Computer Science, page 400-414. Springer, (1999)