PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Suchan, Karol"

Author of the publication

copydeleteadd this publication to your clipboard
Adding a referee to an interconnection network: What can(not) be computed in one round

, , , , , and . CoRR, (2010)

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.

No persons found for author name Suchan, Karol
add a person with the name Suchan, Karol
 

Other publications of authors with the same name

Pursuing a fast robber on a graph., , , , and . Theor. Comput. Sci., 411 (7-9): 1167-1181 (2010)Adding a referee to an interconnection network: What can(not) be computed in one round, , , , , and . CoRR, (2010)k-Gap Interval Graphs, , , , , , , and . CoRR, (2011)Towards optimal kernel for connected vertex cover in planar graphs, , and . CoRR, (2011)Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power, , , , and . CoRR, (2011)Complexity of Splits Reconstruction for Low-Degree Trees, , , and . CoRR, (2010)Towards optimal kernel for connected vertex cover in planar graphs., , and . Discrete Applied Mathematics, 161 (7-8): 1154-1161 (2013)Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round., , , , , and . IPDPS, page 508-514. IEEE, (2011)Minimal Proper Interval Completions., , and . WG, volume 4271 of Lecture Notes in Computer Science, page 217-228. Springer, (2006)Complexity of Splits Reconstruction for Low-Degree Trees., , , and . WG, volume 6986 of Lecture Notes in Computer Science, page 167-178. Springer, (2011)