Search Results - "Gaspers, Serge"

Fair assignment of indivisible objects under ordinal preferences by Aziz, Haris, Gaspers, Serge, Mackenzie, Simon, Walsh, Toby

“…We consider the discrete assignment problem in which agents express ordinal preferences over objects and these objects are allocated to the agents in a fair…”
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

Stable Matching with Uncertain Linear Preferences by Aziz, Haris, Biró, Péter, Gaspers, Serge, de Haan, Ronald, Mattei, Nicholas, Rastegari, Baharak

“…We consider the two-sided stable matching setting in which there may be uncertainty about the agents’ preferences due to limited information or communication…”
Get full text

On the Complexity of the Smallest Grammar Problem over Fixed Alphabets by Casel, Katrin, Fernau, Henning, Gaspers, Serge, Gras, Benjamin, Schmid, Markus L.

“…In the smallest grammar problem, we are given a word w and we want to compute a preferably small context-free grammar G for the singleton language { w } (where…”
Get full text

On the number of minimal separators in graphs by Gaspers, Serge, Mackenzie, Simon

“…Weconsider the largest number of minimal separators a graph on n vertices can have. –We give a new proof that this number is in O1+52n·n. –We prove that this…”
Get full text

Exact and Parameterized Algorithms for Max Internal Spanning Tree by Binkele-Raible, Daniel, Fernau, Henning, Gaspers, Serge, Liedloff, Mathieu

“…We consider the -hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian…”
Get full text

On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms by Fomin, Fedor V., Gaspers, Serge, Pyatkin, Artem V., Razgon, Igor

“…We present a time algorithm finding a minimum feedback vertex set in an undirected graph on n vertices. We also prove that a graph on n vertices can contain at…”
Get full text

On Two Techniques of Combining Branching and Treewidth by Fomin, Fedor V., Gaspers, Serge, Saurabh, Saket, Stepanov, Alexey A.

“…Branch & Reduce and dynamic programming on graphs of bounded treewidth are among the most common and powerful techniques used in the design of moderately…”
Get full text

A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between by Gaspers, Serge, Sorkin, Gregory B.

“…In this paper we introduce “hybrid” Max 2-CSP formulas consisting of “simple clauses”, namely conjunctions and disjunctions of pairs of variables, and general…”
Get full text

A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set by Gaspers, Serge, Liedloff, Mathieu

“…Graphs and Algorithms An independent dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex in V \ D has at least one neighbor in…”
Get full text

Linearly χ‐bounding (P6, C4)‐free graphs by Gaspers, Serge, Huang, Shenwei

“…Given two graphs H 1 and H 2, a graph G is ( H 1 , H 2 )‐free if it contains no induced subgraph isomorphic to H 1 or H 2. Let P t and C s be the path on t…”
Get full text

Guarantees and limits of preprocessing in constraint satisfaction and reasoning by Gaspers, Serge, Szeider, Stefan

“…We present a first theoretical analysis of the power of polynomial-time preprocessing for important combinatorial problems from various areas in AI. We…”
Get full text

Stable matching with uncertain pairwise preferences by Aziz, Haris, Biró, Péter, Fleiner, Tamás, Gaspers, Serge, de Haan, Ronald, Mattei, Nicholas, Rastegari, Baharak

“…We study a two-sided matching problem under preferences, where the agents have independent pairwise comparisons on their possible partners and these…”
Get full text

Feedback Vertex Sets in Tournaments by Gaspers, Serge, Mnich, Matthias

“…We study combinatorial and algorithmic questions around minimal feedback vertex sets (FVS) in tournament graphs. On the combinatorial side, we derive upper and…”
Get full text

Augmenting Graphs to Minimize the Diameter by Frati, Fabrizio, Gaspers, Serge, Gudmundsson, Joachim, Mathieson, Luke

“…We study the problem of augmenting a weighted graph by inserting edges of bounded total cost while minimizing the diameter of the augmented graph. Our main…”
Get full text

Backdoors into heterogeneous classes of SAT and CSP by Gaspers, Serge, Misra, Neeldhara, Ordyniak, Sebastian, Szeider, Stefan, Živný, Stanislav

“…In this paper we extend the classical notion of strong and weak backdoor sets for SAT and CSP by allowing that different instantiations of the backdoor…”
Get full text

Turbocharging Treewidth Heuristics by Gaspers, Serge, Gudmundsson, Joachim, Jones, Mitchell, Mestre, Julián, Rümmele, Stefan

“…A widely used class of algorithms for computing tree decompositions of graphs are heuristics that compute an elimination order, i.e., a permutation of the…”
Get full text

Blockchain-Enabled Private and Secure Task Allocation Framework by Orang, Ayda Valinezhad, Dorri, Ali, Gaspers, Serge, Ruj, Sushmita

“…In the realm of wireless communications and task allocations, where agents need to travel to perform tasks, a new challenge has emerged. This challenge…”
Get full text

On Independent Sets and Bicliques in Graphs by Gaspers, Serge, Kratsch, Dieter, Liedloff, Mathieu

“…Bicliques of graphs have been studied extensively, partially motivated by the large number of applications. In this paper we improve Prisner’s upper bound on…”
Get full text

An exponential time 2-approximation algorithm for bandwidth by Fürer, Martin, Gaspers, Serge, Kasiviswanathan, Shiva Prasad

“…The bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent…”
Get full text