Search Results - "Rabinovich, Roman"

E2F in vivo binding specificity: comparison of consensus versus nonconsensus binding sites by Rabinovich, Alina, Jin, Victor X, Rabinovich, Roman, Xu, Xiaoqin, Farnham, Peggy J

“…We have previously shown that most sites bound by E2F family members in vivo do not contain E2F consensus motifs. However, differences between in vivo target…”
Get full text

Entanglement and the complexity of directed graphs by Berwanger, Dietmar, Grädel, Erich, Kaiser, Łukasz, Rabinovich, Roman

“…Entanglement is a parameter for the complexity of finite directed graphs that measures to what extent the cycles of the graph are intertwined. It is defined by…”
Get full text

Down the Borel Hierarchy: Solving Muller Games via Safety Games by Neider, Daniel, Rabinovich, Roman, Zimmermann, Martin

“…We transform a Muller game with n vertices into a safety game with (n!)^3 vertices whose solution allows to determine the winning regions of the Muller game…”
Get full text

The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs by Canavoi, Felix, Grädel, Erich, Rabinovich, Roman

“…For some time the discrete strategy improvement algorithm due to Jurdzinski and Voge had been considered as a candidate for solving parity games in polynomial…”
Get full text

Jumping robbers in digraphs by Puchala, Bernd, Rabinovich, Roman

“…In cops and robber games, a team of cops tries to capture a robber on a given graph. The cops occupy some vertices of the graph and the robber occupies one…”
Get full text

DAG-width is PSPACE-complete by Amiri, Saeed Akhoondian, Kreutzer, Stephan, Rabinovich, Roman

“…Berwanger et al. show in [2] that for every graph G of size n and DAG-width k there is a DAG decomposition of width k and size nO(k). They also establish a…”
Get full text

On the generalised colouring numbers of graphs that exclude a fixed minor by van den Heuvel, Jan, de Mendez, Patrice Ossona, Quiroz, Daniel, Rabinovich, Roman, Siebertz, Sebastian

“…The generalised colouring numbers colr(G) and wcolr(G) were introduced by Kierstead and Yang as a generalisation of the usual colouring number, and have since…”
Get full text

Classes of graphs with low complexity: The case of classes with bounded linear rankwidth by Nešetřil, Jaroslav, Ossona de Mendez, Patrice, Rabinovich, Roman, Siebertz, Sebastian

“…Classes with bounded rankwidth are MSO-transductions of trees and classes with bounded linear rankwidth are MSO-transductions of paths – a result that shows a…”
Get full text

Down the Borel hierarchy: Solving Muller games via safety games by Neider, Daniel, Rabinovich, Roman, Zimmermann, Martin

“…We transform a Muller game with n vertices into a safety game with (n!)3 vertices whose solution allows us to determine the winning regions of the Muller game…”
Get full text

Preface to the special issue on Graph Searching: Theory and Applications by Angelopoulos, Spyros, Clarke, Nancy E., Fomin, Fedor V., Giannopoulou, Archontia C., Rabinovich, Roman

Get full text

Routing with congestion in acyclic digraphs by Akhoondian Amiri, Saeed, Kreutzer, Stephan, Marx, Dániel, Rabinovich, Roman

“…We study the version of the k-disjoint paths problem where k demand pairs (s1,t1), …, (sk,tk) are specified in the input and the paths in the solution are…”
Get full text

The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs by Canavoi, Felix, Grädel, Erich, Rabinovich, Roman

“…The problem whether winning regions and wining strategies for parity games can be computed in polynomial time is a major open problem in the field of infinite…”
Get full text

Genome-wide Analysis of Transcription Factor E2F1 Mutant Proteins Reveals That N- and C-terminal Protein Interaction Domains Do Not Participate in Targeting E2F1 to the Human Genome by Cao, Alina R., Rabinovich, Roman, Xu, Maoxiong, Xu, Xiaoqin, Jin, Victor X., Farnham, Peggy J.

“…Previous studies of E2F family members have suggested that protein-protein interactions may be the mechanism by which E2F proteins are recruited to specific…”
Get full text

Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion by van den Heuvel, Jan, Kreutzer, Stephan, Pilipczuk, Michal, Quiroz, Daniel A., Rabinovich, Roman, Siebertz, Sebastian

“…A successor-invariant first-order formula is a formula that has access to an auxiliary successor relation on a structure's universe, but the model relation is…”
Get full text

On the generalised colouring numbers of graphs that exclude a fixed minor by van den Heuvel, Jan, Ossona de Mendez, Patrice, Rabinovich, Roman, Siebertz, Sebastian

“…The colouring number col(G) of a graph G is the minimum integer k such that there exists a linear ordering of the vertices of G in which each vertex v has…”
Get full text

Parity Games, Imperfect Information and Structural Complexity by Puchala, Bernd, Rabinovich, Roman

“…We address the problem of solving parity games with imperfect information on finite graphs of bounded structural complexity. It is a major open problem whether…”
Get full text

CoBe - Coded Beacons for Localization, Object Tracking, and SLAM Augmentation by Rabinovich, Roman, Jubran, Ibrahim, Wetzler, Aaron, Kimmel, Ron

“…This paper presents a novel beacon light coding protocol, which enables fast and accurate identification of the beacons in an image. The protocol is provably…”
Get full text

The treewidth and pathwidth of graph unions by Alecu, Bogdan, Lozin, Vadim, Quiroz, Daniel A, Rabinovich, Roman, Razgon, Igor, Zamaraev, Viktor

“…Given two $n$-vertex graphs $G_1$ and $G_2$ of bounded treewidth, is there an $n$-vertex graph $G$ of bounded treewidth having subgraphs isomorphic to $G_1$…”
Get full text

Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs by Hatzel, Meike, Rabinovich, Roman, Wiederrecht, Sebastian

“…A connected graph G is called matching covered if every edge of G is contained in a perfect matching. Perfect matching width is a width parameter for matching…”
Get full text

Linear rankwidth meets stability by Nesetril, Jaroslav, de Mendez, Patrice Ossona, Rabinovich, Roman, Siebertz, Sebastian

“…Classes with bounded rankwidth are MSO-transductions of trees and classes with bounded linear rankwidth are MSO-transductions of paths. These results show a…”
Get full text