Citations of WALCOM 2015 LNCS 8973 (extracted from Google scholar)

Paper titleCitations
erratum: competitive analysis for multi-objective online algorithms0
logspace and fpt algorithms for graph isomorphism for subclasses of bounded tree-width graphs4
on triangle cover contact graphs4
superset generation on decision diagrams1
threshold circuits for global patterns in 2-dimensional maps3
common unfolding of regular tetrahedron and johnson-zalgaller solid7
dichotomy theorems for homomorphism polynomials of graph classes4
non-repetitive strings over alphabet lists4
simultaneous time-space upper bounds for red-blue path problem in planar dags2
on bar (1,j)-visibility graphs4
an improved algorithm for parameterized edge dominating set problem10
simultaneous drawing of planar graphs with right-angle crossings and few bends16
competitive analysis for multi-objective online algorithms8
dynamic online multiselection in internal and external memory4
an efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks6
the impact of communication patterns on distributed self-adjusting binary search trees1
enumerating eulerian trails via hamiltonian path enumeration0
fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement29
ptas’s for some metric p-source communication spanning tree problems3
an almost optimal algorithm for voronoi diagrams of non-disjoint line segments1
folding a paper strip to minimize thickness8
straight-path queries in trajectory data6
approximate distance oracle in o(n2) time and o(n) space for chordal graphs4
forming plurality at minimum cost3
a practical succinct data structure for tree-like graphs3
compact encodings and indexes for the nearest larger neighbor problem4
unit covering in color-spanning set model2
edge-colorings of weighted graphs0
the directed ring loading with penalty cost0
fast algorithms for constrained graph density problems0
encoding data structures6