
Scaling up graph homomorphism for classification via sampling
Feature generation is an open topic of investigation in graph machine le...
read it

The Longest Run Subsequence Problem: Further Complexity Results
Longest Run Subsequence is a problem introduced recently in the context ...
read it

On the complexity of Broadcast Domination and Multipacking in digraphs
We study the complexity of the two dual covering and packing distanceba...
read it

Grundy Coloring friends, HalfGraphs, Bicliques
The firstfit coloring is a heuristic that assigns to each vertex, arriv...
read it

Weighted Upper Edge Cover: Complexity and Approximability
Optimization problems consist of either maximizing or minimizing an obje...
read it

Extension of vertex cover and independent set in some classes of graphs and generalizations
We consider extension variants of the classical graph problems Vertex Co...
read it

On the Complexity of Solution Extension of Optimization Problems
The question if a given partial solution to a problem can be extended re...
read it

Parameterized Orientable Deletion
A graph is dorientable if its edges can be oriented so that the maximum...
read it

Token Sliding on Split Graphs
We show that the independent set reconfiguration problem on split graphs...
read it

Covering with Clubs: Complexity and Approximability
Finding cohesive subgraphs in a network is a wellknown problem in graph...
read it

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs
A (unit) disk graph is the intersection graph of closed (unit) disks in ...
read it

Designing RNA Secondary Structures is Hard
An RNA sequence is a word over an alphabet on four elements {A,C,G,U} ca...
read it

The shortest way to visit all metro lines in Paris
What if {a tourist, a train addict, Dr. Sheldon Cooper, somebody who lik...
read it
Florian Sikora
is this you? claim profile