Search Results - "Lecture Notes in Computer Science"

Graph Structures for Knowledge Representation and Reasoning by Cochez, Michael, Croitoru, Madalina, Marquis, Pierre, Rudolph, Sebastian

“…This open access book constitutes the thoroughly refereed post-conference proceedings of the 6th International Workshop on Graph Structures for Knowledge…”
Get full text

Simple odd β-cycle inequalities for binary polynomial optimization by Del Pia, Alberto, Walter, Matthias

“…We consider the multilinear polytope which arises naturally in binary polynomial optimization. Del Pia and Di Gregorio introduced the class of odd β -cycle…”
Get full text

Popular branchings and their dual certificates by Kavitha, Telikepalli, Király, Tamás, Matuschke, Jannik, Schlotter, Ildikó, Schmidt-Kraepelin, Ulrike

“…Let G be a digraph where every node has preferences over its incoming edges. The preferences of a node extend naturally to preferences over branchings , i.e.,…”
Get full text

Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters by Kučera, Martin, Suchý, Ondřej

“…The Minimum Eccentricity Shortest Path Problem consists in finding a shortest path with minimum eccentricity in a given undirected graph. The problem is known…”
Get full text

Theoretical Analysis of Git Bisect by Courtiel, Julien, Dorbec, Paul, Lecoq, Romain

“…In this paper, we consider the problem of finding a regression in a version control system (VCS), such as git. The set of versions is modelled by a directed…”
Get full text

Improving the integrality gap for multiway cut by Bérczi, Kristóf, Chandrasekaran, Karthekeyan, Király, Tamás, Madan, Vivek

“…In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of k terminal nodes, and the goal is to partition…”
Get full text

Idealness of k-wise intersecting families by Abdi, Ahmad, Cornuéjols, Gérard, Huynh, Tony, Lee, Dabeen

“…A clutter is k - wise intersecting if every k members have a common element, yet no element belongs to all members. We conjecture that, for some integer k ≥ 4…”
Get full text

The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths by Ganian, Robert, Ordyniak, Sebastian

“…This paper revisits the classical edge-disjoint paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G…”
Get full text

Dynamic Graph Coloring by Barba, Luis, Cardinal, Jean, Korman, Matias, Langerman, Stefan, van Renssen, André, Roeloffzen, Marcel, Verdonschot, Sander

“…In this paper we study the number of vertex recolorings that an algorithm needs to perform in order to maintain a proper coloring of a graph under insertion…”
Get full text

Liveness in broadcast networks by Chini, Peter, Meyer, Roland, Saivasan, Prakash

“…We study liveness and model checking problems for broadcast networks, a system model of identical clients communicating via message passing. The first problem…”
Get full text

Connected Vertex Cover for (sP1+P5)-Free Graphs by Johnson, Matthew, Paesani, Giacomo, Paulusma, Daniël

“…The Connected Vertex Cover problem is to decide if a graph  G has a vertex cover of size at most  k that induces a connected subgraph of  G . This is a…”
Get full text

Connected Subgraph Defense Games by Akrida, Eleni C., Deligkas, Argyrios, Melissourgos, Themistoklis, Spirakis, Paul G.

“…We study a security game over a network played between a defender and k attackers . Every attacker chooses, probabilistically, a node of the network to damage…”
Get full text

Quasiplanar graphs, string graphs, and the Erdős–Gallai problem by Fox, Jacob, Pach, János, Suk, Andrew

“…An r-quasiplanar graph is a graph drawn in the plane with no r pairwise crossing edges. Let s≥3 be an integer and r=2s. We prove that there is a constant C…”
Get full text

Edge‐minimum saturated k‐planar drawings by Chaplick, Steven, Klute, Fabian, Parada, Irene, Rollin, Jonathan, Ueckerdt, Torsten

“…For a class D of drawings of loopless (multi‐)graphs in the plane, a drawing D ∈ D is saturated when the addition of any edge to D results in D ′ ∉ D—this is…”
Get full text

A width parameter useful for chordal and co-comparability graphs by Kang, Dong Yeap, Kwon, O-joung, Strømme, Torstein J.F., Telle, Jan Arne

“…Belmonte and Vatshelle (TCS 2013) used mim-width, a graph width parameter bounded on interval graphs and permutation graphs, to explain existing algorithms for…”
Get full text

Programming discrete distributions with chemical reaction networks by Cardelli, Luca, Kwiatkowska, Marta, Laurenti, Luca

“…We explore the range of probabilistic behaviours that can be engineered with Chemical Reaction Networks (CRNs). We give methods to “program” CRNs so that their…”
Get full text

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility by Lin, Anthony W., Majumdar, Rupak

“…Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables…”
Get full text

Faster Graph Coloring in Polynomial Space by Gaspers, Serge, Lee, Edward J.

“…We present a polynomial-space algorithm that computes the number of independent sets of any input graph in time O ( 1 . 1389 n ) for graphs with maximum degree…”
Get full text

Approximation Results for Makespan Minimization with Budgeted Uncertainty by Bougeret, Marin, Jansen, Klaus, Poss, Michael, Rohwedder, Lars

“…We study approximation algorithms for the problem of minimizing the makespan on a set of machines with uncertainty on the processing times of jobs. In the…”
Get full text

New inapproximability bounds for TSP by Karpinski, Marek, Lampis, Michael, Schmied, Richard

“…In this paper, we study the approximability of the metric Traveling Salesman Problem (TSP) and prove new explicit inapproximability bounds for that problem…”
Get full text