Citations of WALCOM 2020 LNCS 12049 (extracted from Google scholar)

Paper titleCitations
train scheduling: hardness and algorithms2
trichotomy for the reconfiguration problem of integer linear systems0
an experimental study of a 1-planarity testing and embedding algorithm1
parameterized algorithms for the happy set problem2
faster privacy-preserving computation of edit distance with moves0
efficient enumeration of non-isomorphic ptolemaic graphs0
approximability of the independent feedback vertex set problem for bipartite graphs1
designing survivable networks with zero-suppressed binary decision diagrams0
matching random colored points with rectangles2
packing arc-disjoint cycles in bipartite tournaments2
on the maximum edge-pair embedding bipartite matching0
partitioning a graph into complementary subgraphs0
implicit enumeration of topological-minor-embeddings and its application to planar subgraph enumeration0
packing and covering with segments0
dispersion of mobile robots on grids6
the stub resolution of 1-planar graphs0
maximum bipartite subgraph of geometric intersection graphs0
computational complexity of the chromatic art gallery problem for orthogonal polygons1
reconfiguring k-path vertex covers0
generalized dictionary matching under substring consistent equivalence relations0
fast multiple pattern cartesian tree matching2
angle covers: algorithms and complexity0
packing trees into 1-planar graphs0
shortest covers of all cyclic shifts of a string1
a waste-efficient algorithm for single-droplet sample preparation on microfluidic chips1
routing in histograms0
optimum algorithm for the mutual visibility problem0
recent progresses in the combinatorial and algorithmic study of rooted phylogenetic networks0
space efficient separator algorithms for planar graphs0
drawing planar graphs0