Citations of WALCOM 2018 LNCS 10755 (extracted from Google scholar)

Paper titleCitations
on the parallel parameterized complexity of the graph isomorphism problem1
complexity of the maximum k-path vertex cover problem1
on structural parameterizations of happy coloring, empire coloring and boxicity6
fpt algorithms exploiting carving decomposition for eulerian orientations and ice-type models1
on multiple longest common subsequence and common motifs with gaps (extended abstract)3
boosting over non-deterministic zdds1
a simple, fast, filter-based algorithm for circular sequence comparison3
fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement6
online facility assignment4
a note on online colouring problems in overlap graphs and their complements1
computing periods ……0
scheduling batch processing in flexible flowshop with job dependent buffer requirements: lagrangian relaxation approach2
random popular matchings with incomplete preference lists1
an improvement of the algorithm of hertli for the unique 3sat problem1
faster network algorithms based on graph decomposition0
two new schemes in the bitprobe model7
minimum-width square annulus intersecting polygons0
minimum-width annulus with outliers: circular, square, and rectangular cases0
approximating partially bounded degree deletion on directed graphs0
secret key amplification from uniformly leaked key exchange complete graph0
enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs1
a simple algorithm for r-gatherings on the line7