Organizatorzy

dr hab. Michał Pilipczuk, prof. ucz.

Informacje

piątki, 14:15 , sala: 5060

Strona domowa

https://students.mimuw.edu.pl/~kd417818/algorithms-seminar/

Dziedziny badań

Algorytmika

Lista referatów

8 marca 2018 12:15
Magnus Wahlström (University of London)
Fine-grained structure of NP-hard SAT problems
Say that a problem SAT(\Gamma), for a constraint language \Gamma, admits an improved algorithm if it can be solved in O(c^n) time on n variables for some c<2, and that it is hard otherwise. Many …
1 marca 2018 12:15
Marc Heinrich (LIRIS )
Online graph coloring with bichromatic exchanges
Greedy algorithms for the graph coloring problem require a large number of colors, even for very simple classes of graphs. For example, any greedy algorithm coloring trees requires $\Omega(\log n)$ colors in the worst case. …
8 lutego 2018 12:15
Lucas Pastor
Disproving the normal graph conjecture
A graph G is said to be normal if there exists two coverings, C and S of its vertex set such that, every member of C induces a clique, every member of S induces a …
7 grudnia 2017 12:15
Marcin Pilipczuk (Uniwrsytet Warszawski)
The Erdős-Hajnal conjecture for caterpillars and their complements
The celebrated Erdos-Hajnal conjecture states that for every proper hereditary graph class GG there exists a constant eps>0 such that every graph G in GG contains a clique or an independent set of size |V(G)|^eps. …
23 listopada 2017 12:15
Irene Muz
Half-integral linkages in highly connected directed graphs
We study the half-integral k-Directed Disjoint Paths Problem (1/2 kDDPP) in highly strongly connected digraphs. The integral kDDPP is NP-complete even when restricted to instances where k=2, and the input graph is L-strongly connected, for …
9 listopada 2017 12:15
Bart M. P. Jansen (Eindhoven University of Technology)
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations
We investigate polynomial-time preprocessing for the problem of hitting forbidden minors in a graph, using the framework of kernelization. For a fixed finite set of connected graphs F, the F-Deletion problem is the following: given …
6 lipca 2017 12:15
Brynmor Chapman (Massachusetts Institute of Technology)
A Refutation of the Gotsman-Linial Conjecture
A degree-$d$ polynomial threshold function is a function that can be written as the sign of a degree-$d$ polynomial on the Boolean hypercube. Bounds on the sensitivity of polynomial threshold functions to small changes in …
8 czerwca 2017 12:15
Marek Adamczyk (University of Warsaw)
When the Optimum is also Blind: a New Perspective on Universal Optimization
Consider the following variant of the set cover problem. We are given a universe $U={1,2,...,n}$ and a collection of subsets C={S_1,...,S_m} where each S_i is a subset of U. For every element u of U …
11 maja 2017 12:15
Till Miltzow (Universit ́e libre de Bruxelles)
The Art Gallery Problem is $\exists \mathbb{R}$-complete
The \emph{art gallery problem} is a classical problem in computational geometry, introduced in 1973 by Viktor Klee. Given a simple polygon \poly and an integer $k$, the goal is to decide if there exists a …
20 kwietnia 2017 12:15
Marcin Wrochna (University of Warsaw)
A topological approach related to Hedetniemi's conjecture
Hedetniemi's 50 years old conjecture states that the chromatic number of the tensor product of graphs G,H is the minimum of the chromatic numbers of G and H. The conjecture has many interesting connections with …
23 marca 2017 12:15
Paweł Rzążewski (Politechnika Warszawska)
Fine-grained complexity of coloring disks, balls, and segments.
On planar graphs, many classic algorithmic problems enjoy a certain ``square root phenomenon'' and can be solved significantly faster than what is known to be possible on general graphs: for example, Independent Set, 3-Coloring, Hamiltonian …
16 marca 2017 12:15
Andreas Emil Feldmann (Charles University)
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems
Given a directed graph G and a list (s1 , t1 ), . . . , (sk , tk ) of terminal pairs, the Directed Steiner Network problem asks for a minimum-cost subgraph of G …
9 marca 2017 12:15
Konstanty Junosza-Szaniawski (Politechnika Warszawska)
Online coloring and L (2,1)-labeling of unit disk intersection graphs)
We give a family of online algorithms for the classical coloring and the L(2,1)-labeling problems of unit disk intersection graphs. In the L(2,1)-labeling we ask for an assignment of non-negative integers to the vertices of …
9 lutego 2017 12:15
Marthe Bonamy (Université de Bordeaux)
Using region decomposition techniques for coloring problems
We consider the problem of coloring the square of a planar graph that has no small cycle. We prove a conjecture of Dvorak, Kral, Nejedly, and Skrekovski that planar graphs of girth at least five …
12 stycznia 2017 12:15
O-joung Kwon (Technische Universitat Berlin)
Parameterized complexity of Distance-Hereditary Vertex Deletion
A graph is distance-hereditary if for any pair of vertices, their distance in every connected induced subgraph containing both vertices is the same as their distance in the original graph. Distance-hereditary graphs are exactly the …