Karol Suchan

Dr. Karol Suchan

Facultad de Ingeniería y Ciencias, Diego Portales University, Santiago, Región Metropolitana, Chile
+1
orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2010 in Theoretical Computer Science
Verified
Journal Article
Closed access
FFFedor V. Fomin
Fedor V. Fomin
PGPetr A. Golovach
Petr A. Golovach
JKJan Kratochvíl
Jan Kratochvíl
NNNicolas Nisse
Nicolas Nisse
Karol SuchanKarol Suchan
Karol Suchan

31 May 2014 in Algorithmica
Verified
Journal Article
Closed access
PDF file
Gianlorenzo D'AngeloGianlorenzo D'Angelo
Gianlorenzo D'Angelo
GSGabriele Di Stefano
Gabriele Di Stefano
ANAlfredo Navarra
Alfredo Navarra
NNNicolas Nisse
Nicolas Nisse
Karol SuchanKarol Suchan
Karol Suchan

23 January 2014 in Algorithmica
Verified
Journal Article
Closed access
PDF file
AKA. Kosowski
A. Kosowski
BLB. Li
B. Li
NNN. Nisse
N. Nisse
Karol SuchanKarol Suchan
Karol Suchan

1 September 2007 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
Karol SuchanKarol Suchan
Karol Suchan
ITIoan Todinca
Ioan Todinca

1 May 2011
Verified
Conference Paper
Closed access
FBFlorent Becker
Florent Becker
MMMartin Matamala
Martin Matamala
NNNicolas Nisse
Nicolas Nisse
IRIvan Rapaport
Ivan Rapaport
Karol SuchanKarol Suchan
Karol Suchan
ITIoan Todinca
Ioan Todinca
In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we consider is a restriction of the classical CONGEST (distributed) model and it is close to the simultaneous messages (communication complexity) model defined by Babai, Kimmel and Lokam. More precisely, each of these n nodes-which only knows its own ID and the IDs of its neighbors- is allowed to send a message of O(log n) bits to some central entity, called the referee. Is it possible for the referee to decide some basic structural properties of the network topology G? We show that simple questions like, "does G contain a square?", "does G contain a triangle?" or "Is the diameter of G at most 3?" cannot be solved in general. On the other hand, the referee can decode the messages in order to have full knowledge of G when G belongs to many graph classes such as planar graphs, bounded tree width graphs and, more generally, bounded degeneracy graphs. We leave open questions related to the connectivity of arbitrary graphs.

4 June 2014 in Distributed Computing
Verified
Journal Article
Closed access
PDF file
FBFlorent Becker
Florent Becker
AKAdrian Kosowski
Adrian Kosowski
MMMartin Matamala
Martin Matamala
NNNicolas Nisse
Nicolas Nisse
IRIvan Rapaport
Ivan Rapaport
ITIoan Todinca
Ioan Todinca