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

Paper titleCitations
A Simple Algorithm for r-gatherings on the Line6
Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs5
Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph0
Approximating Partially Bounded Degree Deletion on Directed Graphs0
Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases2
Minimum-Width Square Annulus Intersecting Polygons0
Two New Schemes in the Bitprobe Model6
Faster Network Algorithms Based on Graph Decomposition0
An Improvement of the Algorithm of Hertli for the Unique 3SAT Problem1
Random Popular Matchings with Incomplete Preference Lists1
Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach2
Computing Periods ……0
A Note on Online Colouring Problems in Overlap Graphs and Their Complements0
Online Facility Assignment1
Fault-Tolerant Complete Visibility for Asynchronous Robots with Lights Under One-Axis Agreement5
A Simple, Fast, Filter-Based Algorithm for Circular Sequence Comparison2
Boosting over Non-deterministic ZDDs0
On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract)1
FPT Algorithms Exploiting Carving Decomposition for Eulerian Orientations and Ice-Type Models1
On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity5
Complexity of the Maximum k-Path Vertex Cover Problem1
On the Parallel Parameterized Complexity of the Graph Isomorphism Problem1
proceeding 20180