Karol Suchan

Karol Suchan
Karol Suchan
Profesor Asociado
Área(s): TECNOLOGÍAS DE INFORMACIÓN
FACULTAD DE INGENIERÍA Y CIENCIAS
PH.D. IN COMPUTER SCIENCE, UNIVERSITÉ D´ORLÉANS, FRANCE, 2006
E-mail: karol.suchan@uai.cl
Sede: SANTIAGO - PEÑALOLÉN
Edificio: D
Número de oficina: 317

RESUMEN

2008 – abierto: profesor asistente en la Facultad de Ingeniería y Ciencias, Universidad Adolfo Ibáñez, Santiago, Chile.
2008 – abierto: investigador asociado del Centro de Modelamiento Matemático, Universidad de Chile, Santiago, Chile.
2006 – 2008: postdoc en el Departamento de Ingeniería Matemática, Universidad de Chile, Santiago, Chile.
2006: doctor en informática, Université d’Orléans, Orléans, Francia.
2003: master en informática, Université d’Orléans, Orléans, Francia.
2003: master en matemáticas aplicadas, University of Science and Technology, Cracovia, Polonia.

Principales Programas y Cursos donde participa/participó

Ingeniería Industrial, Ingeniería Comercial, Master en Gestión y Emprendimiento Tecnológico, Diploma en Business Analytics.

 Principales Publicaciones
-On Dissemination Thresholds in Regular and irregular graph classes, I. Rapaport, K. Suchan, I. Todinca, J. Verstraete, Algorithmica, 59:16-34, 2011.
-Pursuing Fast Robber in a Graph, F. V. Fomin, P. Golovach, J. Kratochvíl, N. Nisse, K. Suchan, Theoretical Computer Science 411(7-9):1167-1181, 2010.
-Minimal Interval Completion Through Graph Exploration, K. Suchan, I. Todinca, Theoretical Computer Science 410(1):35-43, 2009.
-Minimal Proper Interval Completions, I. Rapaport, K. Suchan, I. Todinca, Information Processing Letters 106(5):195-202, 2008.
-On Powers of Graphs of Bounded NLC-width (clique-width), K. Suchan, I. Todinca, Discrete Applied Mathematics 155(14):1885-1893, 2007.

Principales Proyectos
-Mathematical Modeling for Industrial and Management Science Applications: An Interdisciplinary Approach, associated investigator, ANILLO ACT-88, 2010 - open.
-Epidemic-Like Processes in Social and Communication Networks: Structures, Algorithms and Probabilistic Analysis, principal investigator, Fondecyt 11090390, 2009 - open.
-Proyecto Basal: Centro de Modelamiento Matematico de la Universidad de Chile, associated investigator, 2008 - open.
-Networks in mathematics and engineering sciences, associated investigator, post-doc, ANILLO ACT-08, 2006 - 2008.


Artículos
2015 Complexity of Splits Reconstruction for Low-Degree Trees, Discrete Applied Mathematics, 89-100, 180
2014 Computing on rings by oblivious robots: A unified approach for different tasks, Algorithmica, 1055-1096, 72
2014 Allowing each node to communicate only once in a distributed system: Shared whiteboard models, Distributed Computing, 189-200, 28
2014 k-Chordal graphs: From cops and robber to compact routing via treewidth, Algorithmica, 758-777, 72
2013 Discrete Applied Mathematics, 1154-1161, 161, Towards optimal kernel for connected vertex cover in planar graphs
2013 Proceedings de la 27th IEEE International Parallel and Distributed Processing Symposium Workshops and PhD Forum (IPDPSW 2013), 667-676, , A unified approach for different tasks on rings in robot-based computing systems
2012 Distributed computing of efficient routing schemes in generalized chordal graphs, Theoretical Computer Science, 444, 17-27
2012 Allowing each node to communicate only once in a distributed system: Shared whiteboard models, Proceedings del 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'12, Pittsburgh, , 25-27
2012 k-Chordal graphs: From cops and robber to compact routing via treewidth, Lecture Notes in Computer Science, 7392, 610-622
2009 Algorithmica, 16-34, 59, On dissemination thresholds in regular and irregular graph classes.
2009 Theoretical Computer Science, 1167-1181, 411, Pursuing a fast robber on a graph.
Proceedings paper WoS (EX ISI)
2011 Complexity of splits reconstruction for low-degree trees, en actas del 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011), Lecture Notes in Computer Science, 6986,,
2010 Distributed computing of efficient routing schemes in generalized chordal groups., Lecture Notes in Computer Science, ,
2009 Computing pathwidth faster than 2n., Lecture Notes in Computer Science, 5917,