Selected seminar talks and workshop/conference presentations

*Recent results and open problems on CIS graphs*, online, Conference 'Games, Graphs, Generation, Duality' in honour of Vladimir Gurvich 70th birthday,
Laboratory of Theoretical Computer Science of the Higher School of Economics, Moscow, Russia (September 2022).

*Shifting paths to avoidable ones*, online, 13th Annual Uri N. Peled Memorial Lecture, University of Haifa, Israel (May 2022).

*Tree decompositions with bounded independence number and their algorithmic applications*,
GRASTA 2022, Porquerolles, France (May 2022).

*Shifting paths to avoidable ones*,
online, University of Maribor, Faculty of Natural Sciences and Mathematics (March 2022).

*Tree decompositions with bounded independence number and their algorithmic applications*,
online, Virginia Commonwealth University, Department of Mathematics, USA (March 2022).

*Tree decompositions with bounded independence number and their algorithmic applications*,
online, Princeton University, Department of Mathematics, USA (January 2022).

*On CIS circulants*,
online, as part of Ramanujan Day-2021, organized by the SRM Institute of Science and Technology,
Ramapuram Campus, Department of Mathematics, Ramapuram, Chennai, India (December 2021).

*Covering and domination at distance*, online, International Workshop on Domination in Graphs (IWGD 2021), Jointly organized by Indian Institute of Technology Ropar and
Academy of Discrete Mathematics and Applications (ADMA), India (November 2021).

*Rise and fall of three conjectures on equistable graphs*,
online, Discrete Mathematics Seminars, Università degli studi di Modena e Reggio Emilia, Italy (November 2021).

*Tree decompositions with bounded independence number*, online,
Virtual Discrete Math Colloquium, IBS Discrete Mathematics Group (DIMAG), Center for Mathematical and Computational Sciences,
Institute for Basic Science, Daejeon, South Korea (November 2021).

*Tree decompositions with bounded independence number*, online,
AlGCo : algorithmes, graphes et combinatoire, Département Informatique - LIRMM, University of Montpellier and CNRS (September 2021).

*Strong cliques and stable sets*, online, as part of Topics in Algorithmic Graph Theory - Book launch workshop,
Caesarea Rothschild Institute, Haifa (July 2021).

*Beyond treewidth: the tree-independence number*, online, 8th European Congress of Mathematics, Algorithmic Graph Theory Minisymposium, Portorož, Slovenia (June 2021).

*Recent results and open problems on CIS graphs*, online, International Conference on Number Theory and Discrete Mathematics (ICNTDM 2020),
Organized by Ramanujan Mathematical Society and hosted by Rajagiri School of Engineering & Technology, Kochi, India (December 2020).

*Treewidth versus clique number in graph classes with a forbidden structure*, online,
Charles University, Faculty of Mathematics and Physics, Prague, Czech Republic (November 2020).

*Treewidth versus clique number in graph classes with a forbidden structure*, online,
LaBRI seminar, GT Graphes et Optimisation, Université de Bordeaux, France
(July 2020).

*Edge elimination schemes of weighted graph classes*, Workshop on Graph Modification: Algorithms, Experiments and New Problems, Bergen, Norway
(January 2020).

*Generalizations of simplicial vertices and a new polynomially solvable case of the maximum weight clique problem*,
National Research University Higher School of Economics, Faculty of Computer Science, Moscow (August 2019).

*Avoidable vertices, avoidable edges, and implications for highly symmetric graphs*,
9th Slovenian International Conference on Graph Theory, Kranjska Gora, Slovenia (June 2019).

*Decomposing 1-Sperner hypergraphs, with applications to graphs*,
Seminarium Matematyka Dyskretna, Faculty of Applied Mathematics, AGH University of Science and Technology, Krakow, Poland
(April 2019).

*Decomposing 1-Sperner hypergraphs, with applications to graphs*,
Journée-séminaire de combinatoire (équipe CALIN du LIPN, Université Paris-Nord, Villetaneuse), France
(September 2018).

*Decomposing 1-Sperner hypergraphs, with applications to graphs*,
Séminaires du Pôle 2 : Optimisation combinatoire, algorithmique, LAMSADE, Université Paris-Dauphine, France
(September 2018).

*Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth's theorem*,
Mathematical Sciences Colloquium, Worcester Polytechnic Institute, Worcester, MA, USA (September 2017).

*Cliques and graph classes*,
Universidad Nacional de Rosario, Facultad de Ciencias Exactas, Ingeniería y Agrimensura, Argentina
(November 2016).

*Equistarable graphs and counterexamples to three conjectures on equistable graph*,
Hebrew University, Dept. of Computer Science, Tel Aviv, Israel
(July 2016).

*On the structure of 1-perfectly orientable graphs*,
School of Engineering and Computing Sciences, Durham University, UK
(January 2015).

*Graphs of power-bounded clique-width*,
Colloquium at University of Oregon, Department of Computer and Information Science, USA
(August 2014).

*Dually Sperner hypergraphs and linear separation of variants of dominating sets in graphs*,
Séminaire Graphes et structures discrètes, ENS de Lyon, France
(January 2014).

*Linear separation of connected dominating sets in graphs*,
Worcester Polytechnic Institute, Mathematical Sciences Department, USA
(January 2014).

*Graph classes: interrelations, structure, and algorithmic issues*,
Lectio Magistralis, Department of Computer Science, Università degli Studi di Verona
(March 2013).

*On the identifiable subgraph problem*,
RUTCOR Colloquium, Rutgers University, USA
(January 2013).

*A hereditary view on efficient domination*,
Quinto Seminario de la Red Latinoamericana Optimización Discreta y Grafos: Teoría, Algoritmos y Aplicaciones Universidad Nacional de General Sarmiento, Los Polvorines, Argentina,
(November 2012).

*Hereditary efficiently dominatable graphs*,
Department of Mathematics, University of the Basque Country, Bilbao, Spain
(June 2012).

*Graphs of small separability*,
Department of Statistical Sciences, Sapienza University of Rome, Italy
(June 2012).

*Hereditary efficiently dominatable graphs*,
RUTCOR Brown Bag Seminar, Rutgers University, NJ, USA
(April 2012).

*On the (in-)approximability and exact algorithms for vector domination and related problems in graphs*,
Algorithms Research Seminar, Department of Informatics, University of Bergen, Norway
(February 2012).

*On equistable graphs, general partition graphs and triangle graphs*,
Graz University of Technology, Institut für Mathematische Strukturtheorie, Graz, Austria
(May 2011).

*Combinatorial methods for the independent set problem*,
Università degli studi di Udine, Dipartimento di Matematica e Informatica, Udine, Italy
(December 2010).

*Graphs of small separability*,
Università degli studi di Udine, Dipartimento di Matematica e Informatica, Udine, Italy
(December 2010).

*Matching, augmenting and decomposing: an overview of combinatorial methods for the independent set problem*,
Colloquium of the Mathematical Institute of the National University of Mexico (UNAM), Morelia, Mexico,
(September 2010).

*Evaluating monotone Boolean functions and game trees in the priced information model*,
Computer science seminars, Université Libre de Bruxelles, Bruxelles, Belgium
(October 2008).

*Evaluating monotone Boolean functions and game trees in the priced information model*,
Mathematical colloqiua, Faculty of Mathematics and Natural Sciences, Ilmenau, Germany
(April 2008).

*Algorithms for haplotyping problems*,
Bielefeld University, Genome informatics, Bielefeld, Germany
(November 2007).

*On the boolean function evaluation problem*,
Bielefeld University, Genome informatics, Bielefeld, Germany
(November 2007).

*Back to my homepage.*

Last modified: September 2022