
A Constantfactor Approximation for Weighted Bond Cover
The Weighted ℱVertex Deletion for a class F of graphs asks, weighted gr...
read it

Continual Learning Approach for Improving the Data and Computation Mapping in NearMemory Processing System
The resurgence of nearmemory processing (NMP) with the advent of big da...
read it

Towards constantfactor approximation for chordal / distancehereditary vertex deletion
For a family of graphs ℱ, Weighted ℱDeletion is the problem for which t...
read it

Grundy Distinguishes Treewidth from Pathwidth
Structural graph parameters, such as treewidth, pathwidth, and cliquewi...
read it

On the treewidth of evenholefree graphs
The class of all evenholefree graphs has unbounded treewidth, as it c...
read it

Twinwidth III: Max Independent Set and Coloring
We recently introduced the graph invariant twinwidth, and showed that f...
read it

Solving hard cut problems via flowaugmentation
We present a new technique for designing FPT algorithms for graph cut pr...
read it

Twinwidth II: small classes
The twinwidth of a graph G is the minimum integer d such that G has a d...
read it

Twinwidth I: tractable FO model checking
Inspired by a width invariant defined on permutations by Guillemot and M...
read it

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

Remote Control: A Simple Deadlock Avoidance Scheme for Modular System on Chip
The increase in design cost and complexity have motivated designers to a...
read it

New Results on Directed Edge Dominating Set
We study a family of generalizations of Edge Dominating Set on directed ...
read it

Spatial analysis between particulate matter and emergency room visits for conjunctivitis and keratitis
Background: The concentration of particulate matter in the air varies de...
read it

Datacompression for Parametrized Counting Problems on Sparse graphs
We study the concept of compactor, which may be seen as a countinganalo...
read it

Token Sliding on Split Graphs
We show that the independent set reconfiguration problem on split graphs...
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

Finding branchdecompositions of matroids, hypergraphs, and more
Given n subspaces of a finitedimensional vector space over a fixed fini...
read it

ErdősPósa property of chordless cycles and its applications
A chordless cycle in a graph G is an induced subgraph of G which is a cy...
read it

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation
We study the computational complexity of problems that arise in abstract...
read it

Algorithms and Complexity Results for Persuasive Argumentation
The study of arguments as abstract entities and their interaction as int...
read it
Eun Jung Kim
is this you? claim profile