Bears with Hats and Independence Polynomials von Blažej, Václav, Dvořák, Pavel, Opler, Michal

Volltext

On the m-eternal Domination Number of Cactus Graphs von Blažej, Václav, Křišt’an, Jan Matyáš, Valla, Tomáš

Volltext

On the Smallest Synchronizing Terms of Finite Tree Automata von Blažej, Václav, Janoušek, Jan, Plachý, Štěpán

Volltext

On the Edge-Length Ratio of 2-Trees von Blažej, Václav, Fiala, Jiří, Liotta, Giuseppe

Volltext

Polynomial kernels for tracking shortest paths von Blažej, Václav, Choudhary, Pratibha, Knop, Dušan, Křišťan, Jan Matyáš, Suchý, Ondřej, Valla, Tomáš

Volltext

Constant factor approximation for tracking paths and fault tolerant feedback vertex set von Blažej, Václav, Choudhary, Pratibha, Knop, Dušan, Křišťan, Jan Matyáš, Suchý, Ondřej, Valla, Tomáš

Volltext

On the Intersections of Non-homotopic Loops von Blažej, Václav, Opler, Michal, Šileikis, Matas, Valtr, Pavel

Volltext

Non-homotopic Loops with a Bounded Number of Pairwise Intersections von Blažej, Václav, Opler, Michal, Šileikis, Matas, Valtr, Pavel

Volltext

Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set von Blažej, Václav, Choudhary, Pratibha, Knop, Dušan, Křišt’an, Jan Matyáš, Suchý, Ondřej, Valla, Tomáš

Volltext

Bears with Hats and Independence Polynomials von Blažej, Václav, Dvořák, Pavel, Opler, Michal

Volltext

Bears with Hats and Independence Polynomials von Blažej, Václav, Dvořák, Pavel, Opler, Michal

Volltext

Online Ramsey numbers: Long versus short cycles von Adamski, Grzegorz, Bednarska-Bzdȩga, Małgorzata, Blažej, Václav

Volltext bestellen

Computing m-Eternal Domination Number of Cactus Graphs in Linear Time von Blažej, Václav, Křišťan, Jan Matyáš, Valla, Tomáš

Volltext bestellen

A Simple Streaming Bit-Parallel Algorithm for Swap Pattern Matching von Blažej, Václav, Suchý, Ondřej, Valla, Tomáš

Volltext

On Controlling Knockout Tournaments Without Perfect Information von Blažej, Václav, Gupta, Sushmita, Ramanujan, M. S, Strulo, Peter

Volltext bestellen

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion von Blažej, Václav, Jana, Satyabrata, Ramanujan, M. S, Strulo, Peter

Volltext bestellen

Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra von Blažej, Václav, Knop, Dušan, Pokorný, Jan, Schierreich, Šimon

Volltext bestellen

Efficient attack sequences in m-eternal domination von Blažej, Václav, Křišťan, Jan Matyáš, Valla, Tomáš

Volltext bestellen

Constrained and Ordered Level Planarity Parameterized by the Number of Levels von Blažej, Václav, Klemz, Boris, Klesen, Felix, Sieper, Marie Diana, Wolff, Alexander, Zink, Johannes

Volltext bestellen

Non-homotopic Loops with a Bounded Number of Pairwise Intersections von Blažej, Václav, Opler, Michal, Šileikis, Matas, Valtr, Pavel

Volltext bestellen