researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
Links
Filter by Year
OR
AND
NOT
1
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
Filter by Tag
[+]
OR
AND
NOT
1
C++
Meta-Environment
analysis
architecture
caching
constraints
data-flow
design
discovery
graph-rewriting
meta-model
meta-objects
mobile
open-source
partitioning
pattern matching
peer-to-peer
planar graph
rewriting
source-to-source
Filter by Author
[+]
OR
AND
NOT
1
Akira Suzuki
Alejandro López-Ortiz
Anil Maheshwari
Debajyoti Mondal
Emilio Di Giacomo
Giuseppe Liotta
M. Sohel Rahman
Masud Hasan
Md. Saidur Rahman
Md. Saidur Rahman 0001
Ryuhei Uehara
Sandip Das
Sang Won Bae
Shin-Ichi Nakano
Shin-ichi Minato
Takashi Horiyama
Takehiro Ito
Toshiki Saitoh
Xiao Zhou
Yota Otachi
Filter by Top terms
[+]
OR
AND
NOT
1
algorithm
algorithms
approximation
complexity
computation
cover
efficient
extended
graph
graphs
k
maximum
minimum
planar
problem
problems
set
tree
trees
vertex
WALCOM (walcom)
Editions
Publications
Viewing Publication 1 - 100 from 526
2024
Canonization of a Random Circulant Graph by Counting Walks
Oleg Verbitsky 0001
,
Maksim Zhukovskii 0001
.
walcom 2024
:
319-334
[doi]
Exact and Approximate Hierarchical Hub Labeling
Ruoying Li 0001
,
Sabine Storandt
.
walcom 2024
:
194-211
[doi]
Improved Approximation Algorithms for Cycle and Path Packings
Jingyang Zhao 0001
,
Mingyu Xiao 0001
.
walcom 2024
:
179-193
[doi]
The Parameterized Complexity of Terminal Monitoring Set
N. R. Aravind
,
Roopam Saxena
.
walcom 2024
:
76-90
[doi]
Black Hole Search in Dynamic Cactus Graph
Adri Bhattacharya
,
Giuseppe F. Italiano
,
Partha Sarathi Mandal 0001
.
walcom 2024
:
288-303
[doi]
Counting Vanishing Matrix-Vector Products
Cornelius Brand
,
Viktoriia Korchemna
,
Kirill Simonov
,
Michael Skotnica
.
walcom 2024
:
335-349
[doi]
Quantum Graph Drawing [Best Student Paper]
Susanna Caroppo
,
Giordano Da Lozzo
,
Giuseppe Di Battista
.
walcom 2024
:
32-46
[doi]
Fully Dynamic Algorithms for Euclidean Steiner Tree
T.-H. Hubert Chan
,
Gramoz Goranci
,
Shaofeng H.-C. Jiang
,
Bo Wang
,
Quan Xue
.
walcom 2024
:
62-75
[doi]
Orientable Burning Number of Graphs
Julien Courtiel
,
Paul Dorbec
,
Tatsuya Gima
,
Romain Lecoq
,
Yota Otachi
.
walcom 2024
:
377-391
[doi]
Short Flip Sequences to Untangle Segments in the Plane
Guilherme Dias da Fonseca
,
Yan Gerard
,
Bastien Rivier
.
walcom 2024
:
163-178
[doi]
Stable and Dynamic Minimum Cuts
Mark de Berg
,
Andrés López-Martínez
,
Frits C. R. Spieksma
.
walcom 2024
:
273-287
[doi]
Minimizing Corners in Colored Rectilinear Grids
Thomas Depian
,
Alexander Dobler
,
Christoph Kern
,
Jules Wulms
.
walcom 2024
:
134-148
[doi]
The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules
Naoki Domon
,
Akira Suzuki
,
Yuma Tamura
,
Xiao Zhou 0001
.
walcom 2024
:
227-241
[doi]
Dichotomies for Tree Minor Containment with Structural Parameters
Tatsuya Gima
,
Soh Kumabe
,
Kazuhiro Kurita
,
Yuto Okada
,
Yota Otachi
.
walcom 2024
:
392-405
[doi]
Structural Parameterizations of Vertex Integrity [Best Paper]
Tatsuya Gima
,
Tesshu Hanaka
,
Yasuaki Kobayashi
,
Ryota Murai
,
Hirotaka Ono 0001
,
Yota Otachi
.
walcom 2024
:
406-420
[doi]
On the Complexity of List H-Packing for Sparse Graph Classes
Tatsuya Gima
,
Tesshu Hanaka
,
Yasuaki Kobayashi
,
Yota Otachi
,
Tomohito Shirai
,
Akira Suzuki
,
Yuma Tamura
,
Xiao Zhou 0001
.
walcom 2024
:
421-435
[doi]
On Layered Area-Proportional Rectangle Contact Representations
Carolina Haase
,
Philipp Kindermann
.
walcom 2024
:
149-162
[doi]
A Bisection Approach to Subcubic Maximum Induced Matching
Gordon Hoi
,
Sanjay Jain 0001
,
Ammar Fathin Sabili
,
Frank Stephan 0001
.
walcom 2024
:
257-272
[doi]
Reconfiguration of Multisets with Applications to Bin Packing
Jeffrey Kam
,
Shahin Kamali
,
Avery Miller
,
Naomi Nishimura
.
walcom 2024
:
212-226
[doi]
Simultaneous Drawing of Layered Trees
Julia Katheder
,
Stephen G. Kobourov
,
Axel Kuckuk
,
Maximilian Pfister 0002
,
Johannes Zink 0001
.
walcom 2024
:
47-61
[doi]
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs
Giordano Da Lozzo
,
Giuseppe Di Battista
,
Fabrizio Frati
,
Fabrizio Grosso
,
Maurizio Patrignani
.
walcom 2024
:
350-364
[doi]
On the Hardness of Gray Code Problems for Combinatorial Objects
Arturo I. Merino
,
Namrata
,
Aaron Williams
.
walcom 2024
:
103-117
[doi]
Recent Research Activities on Algorithmic Foundations for Social Advancement
Shin-ichi Minato
.
walcom 2024
:
1-8
[doi]
(t, s)-Completely Independent Spanning Trees
Shin-Ichi Nakano
.
walcom 2024
:
365-376
[doi]
Reasons to Fall (More) in Love with Combinatorial Reconfiguration
Naomi Nishimura
.
walcom 2024
:
9-14
[doi]
On MAX-SAT with Cardinality Constraint
Fahad Panolan
,
Hannane Yaghoubizade
.
walcom 2024
:
118-133
[doi]
Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle
Csaba D. Tóth
.
walcom 2024
:
15-31
[doi]
WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18-20, 2024, Proceedings
Ryuhei Uehara
,
Katsuhisa Yamanaka
,
Hsu-Chun Yen
, editors,
Volume 14549 of
Lecture Notes in Computer Science
, Springer,
2024.
[doi]
Generating Cyclic 2-Gray Codes for Fibonacci q-Decreasing Words
Dennis Wong
,
Bowie Liu
,
Chan-Tong Lam
,
Marcus Im
.
walcom 2024
:
91-102
[doi]
Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis
Yuya Yamada
,
Mutsunori Banbara
,
Katsumi Inoue
,
Torsten Schaub
,
Ryuhei Uehara
.
walcom 2024
:
242-256
[doi]
Recognition and Isomorphism of Proper $\boldsymbol{H}$-Graphs for Unicyclic $\boldsymbol{H}$ in FPT-Time
Deniz Agaoglu Çagirici
,
Peter Zeman 0001
.
walcom 2024
:
304-318
[doi]
2023
The Family of Fan-Planar Graphs
Michael Kaufmann 0001
.
walcom 2023
:
12-19
[doi]
Certifying Induced Subgraphs in Large Graphs
Ulrich Meyer 0001
,
Hung Tran
,
Konstantinos Tsakalidis
.
walcom 2023
:
229-241
[doi]
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees
A. Karim Abu-Affash
,
Paz Carmi
,
Meytal Maman
.
walcom 2023
:
71-77
[doi]
Flipping Plane Spanning Paths
Oswin Aichholzer
,
Kristin Knorr
,
Wolfgang Mulzer
,
Johannes Obenaus
,
Rosna Paul
,
Birgit Vogtenhuber
.
walcom 2023
:
49-60
[doi]
Away from Each Other
Tetsuya Araki
,
Shin-Ichi Nakano
.
walcom 2023
:
61-70
[doi]
Parameterized Complexity of Path Set Packing
N. R. Aravind
,
Roopam Saxena
.
walcom 2023
:
291-302
[doi]
Groups Burning: Analyzing Spreading Processes in Community-Based Networks
Gennaro Cordasco
,
Luisa Gargano
,
Adele A. Rescigno
.
walcom 2023
:
330-342
[doi]
On the Longest Flip Sequence to Untangle Segments in the Plane
Guilherme Dias da Fonseca
,
Yan Gerard
,
Bastien Rivier
.
walcom 2023
:
102-112
[doi]
Minimum Ply Covering of Points with Unit Squares
Stephane Durocher
,
J. Mark Keil
,
Debajyoti Mondal
.
walcom 2023
:
23-35
[doi]
On the Parameterized Complexity of Compact Set Packing
Ameet Gadekar
.
walcom 2023
:
359-370
[doi]
Improved and Generalized Algorithms for Burning a Planar Point Set
Prashant Gokhale
,
J. Mark Keil
,
Debajyoti Mondal
.
walcom 2023
:
90-101
[doi]
Splitting Plane Graphs to Outerplanarity
Martin Gronemann
,
Martin Nöllenburg
,
Anaïs Villedieu
.
walcom 2023
:
217-228
[doi]
Finding the Cyclic Covers of a String
Roberto Grossi
,
Costas S. Iliopoulos
,
Jesper Jansson 0001
,
Zara Lim
,
Wing-Kin Sung
,
Wiktor Zuba
.
walcom 2023
:
139-150
[doi]
On the Complexity of Distance-d Independent Set Reconfiguration
Duc A. Hoang
.
walcom 2023
:
254-266
[doi]
Structural Parameterization of Cluster Deletion
Giuseppe F. Italiano
,
Athanasios L. Konstantinidis
,
Charis Papadopoulos
.
walcom 2023
:
371-383
[doi]
Energy Efficient Sorting, Selection and Searching
Varunkumar Jayapaul
,
Seungbum Jo
,
Krishna Palem
,
Srinivasa Rao Satti
.
walcom 2023
:
179-190
[doi]
Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs
Jun Kawahara
,
Toshiki Saitoh
,
Hirokazu Takeda
,
Ryo Yoshinaka
,
Yui Yoshioka
.
walcom 2023
:
151-163
[doi]
Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult
Jan Kratochvíl
.
walcom 2023
:
3-11
[doi]
Inferring Strings from Position Heaps in Linear Time
Koshiro Kumagai
,
Diptarama Hendrian
,
Ryo Yoshinaka
,
Ayumi Shinohara
.
walcom 2023
:
115-126
[doi]
WALCOM: Algorithms and Computation - 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023, Proceedings
Chun-Cheng Lin
,
Bertrand M. T. Lin
,
Giuseppe Liotta
, editors,
Volume 13973 of
Lecture Notes in Computer Science
, Springer,
2023.
[doi]
Better Hardness Results for the Minimum Spanning Tree Congestion Problem
Huong Luu
,
Marek Chrobak
.
walcom 2023
:
167-178
[doi]
Parity Permutation Pattern Matching
Virginia Ardévol Martínez
,
Florian Sikora
,
Stéphane Vialette
.
walcom 2023
:
384-395
[doi]
Internal Longest Palindrome Queries in Optimal Time
Kazuki Mitani
,
Takuya Mieno
,
Kazuhisa Seto
,
Takashi Horiyama
.
walcom 2023
:
127-138
[doi]
Roman k-Domination: Hardness, Approximation and Parameterized Results
A. Mohanapriya
,
P. Renjith
,
N. Sadagopan
.
walcom 2023
:
343-355
[doi]
On Star-Multi-interval Pairwise Compatibility Graphs
Angelo Monti
,
Blerina Sinaimeri
.
walcom 2023
:
267-278
[doi]
k-Transmitter Watchman Routes
Bengt J. Nilsson
,
Christiane Schmidt 0001
.
walcom 2023
:
202-213
[doi]
Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs
Kaustav Paul
,
Arti Pandey
.
walcom 2023
:
242-253
[doi]
Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs
Rin Saito
,
Hiroshi Eto
,
Takehiro Ito
,
Ryuhei Uehara
.
walcom 2023
:
191-201
[doi]
Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput
Baruch Schieber
,
Bhargav Samineni
,
Soroush Vahidi
.
walcom 2023
:
305-316
[doi]
Recognizing When a Preference System is Close to Admitting a Master List
Ildikó Schlotter
.
walcom 2023
:
317-329
[doi]
Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms
Takumi Shiota
,
Toshiki Saitoh
.
walcom 2023
:
36-48
[doi]
Reflective Guarding a Gallery
Arash Vaezi
,
Bodhayan Roy
,
Mohammad Ghodsi
.
walcom 2023
:
78-89
[doi]
Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration
Yusuke Yanagisawa
,
Akira Suzuki
,
Yuma Tamura
,
Xiao Zhou 0001
.
walcom 2023
:
279-290
[doi]
2022
Reverse Shortest Path Problem in Weighted Unit-Disk Graphs
Haitao Wang 0001
,
Yiming Zhao
.
walcom 2022
:
135-146
[doi]
Parameterized Complexity of Minimum Membership Dominating Set
Akanksha Agrawal
,
Pratibha Choudhary
,
N. S. Narayanaswamy
,
K. K. Nisha
,
Vijayaragunathan Ramamoorthi
.
walcom 2022
:
288-299
[doi]
Traversability, Reconfiguration, and Reachability in the Gadget Framework
Joshua Ani
,
Erik D. Demaine
,
Yevhenii Diomidov
,
Dylan H. Hendrickson
,
Jayson Lynch
.
walcom 2022
:
47-58
[doi]
Trains, Games, and Complexity: 0/1/2-Player Motion Planning Through Input/Output Gadgets
Joshua Ani
,
Erik D. Demaine
,
Dylan H. Hendrickson
,
Jayson Lynch
.
walcom 2022
:
187-198
[doi]
Approximating the Bundled Crossing Number
Alan Arroyo
,
Stefan Felsner
.
walcom 2022
:
383-395
[doi]
Structural Parameterizations of Budgeted Graph Coloring
Susobhan Bandopadhyay
,
Suman Banerjee
,
Aritra Banik
,
Venkatesh Raman 0001
.
walcom 2022
:
340-351
[doi]
Vertex-Weighted Graphs: Realizable and Unrealizable Domains
Amotz Bar-Noy
,
Toni Böhnlein
,
David Peleg
,
Dror Rawitz
.
walcom 2022
:
315-327
[doi]
The Complexity of L(p, q)-Edge-Labelling
Gaetan Berthe
,
Barnaby Martin
,
Daniël Paulusma
,
Siani Smith
.
walcom 2022
:
175-186
[doi]
Counting and Sampling Orientations on Chordal Graphs
Ivona Bezáková
,
Wenbo Sun
.
walcom 2022
:
352-364
[doi]
Machine Learning Advised Ski Rental Problem with a Discount
Arghya Bhattacharya
,
Rathish Das
.
walcom 2022
:
213-224
[doi]
From the W-hierarchy to XNLP - Classes of Fixed Parameter Intractability
Hans L. Bodlaender
.
walcom 2022
:
15-25
[doi]
On Approximating Shortest Paths in Weighted Triangular Tessellations
Prosenjit Bose
,
Guillermo Esteban
,
David Orden
,
Rodrigo I. Silveira
.
walcom 2022
:
409-421
[doi]
An Optimal Tester for k-Linear
Nader H. Bshouty
.
walcom 2022
:
201-212
[doi]
Some Problems Related to the Space of Optimal Tree Reconciliations - (Invited Talk)
Tiziana Calamoneri
,
Blerina Sinaimeri
.
walcom 2022
:
3-14
[doi]
Finding Geometric Representations of Apex Graphs is NP-Hard
Dibyayan Chakraborty
,
Kshitij Gajjar
.
walcom 2022
:
161-174
[doi]
Parameterized Complexity of Reconfiguration of Atoms
Alexandre Cooper
,
Stephanie Maaz
,
Amer E. Mouawad
,
Naomi Nishimura
.
walcom 2022
:
263-274
[doi]
Parameterized Complexity of Immunization in the Threshold Model
Gennaro Cordasco
,
Luisa Gargano
,
Adele A. Rescigno
.
walcom 2022
:
275-287
[doi]
Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage
Celina M. H. de Figueiredo
,
Raul Lopes
,
Alexsander Andrade de Melo
,
Ana Silva 0001
.
walcom 2022
:
251-262
[doi]
StreamTable: An Area Proportional Visualization for Tables with Flowing Streams
Jared Espenant
,
Debajyoti Mondal
.
walcom 2022
:
97-108
[doi]
Reconfiguration of Regular Induced Subgraphs
Hiroshi Eto
,
Takehiro Ito
,
Yasuaki Kobayashi
,
Yota Otachi
,
Kunihiro Wasa
.
walcom 2022
:
35-46
[doi]
Happy Set Problem on Subclasses of Co-comparability Graphs
Hiroshi Eto
,
Takehiro Ito
,
Eiji Miyano
,
Akira Suzuki
,
Yuma Tamura
.
walcom 2022
:
149-160
[doi]
The Polygon Burning Problem
William Evans
,
Rebecca Lin
.
walcom 2022
:
123-134
[doi]
Aspect Ratio Universal Rectangular Layouts
Stefan Felsner
,
Andrew Nathenson
,
Csaba D. Tóth
.
walcom 2022
:
73-84
[doi]
Hypergraph Representation via Axis-Aligned Point-Subspace Cover
Oksana Firman
,
Joachim Spoerhase
.
walcom 2022
:
328-339
[doi]
On the Harmless Set Problem Parameterized by Treewidth
Ajinkya Gaikwad
,
Soumen Maity
.
walcom 2022
:
227-238
[doi]
Minimum t-Spanners on Subcubic Graphs
Renzo Gómez
,
Flávio Keidi Miyazawa
,
Yoshiko Wakabayashi
.
walcom 2022
:
365-380
[doi]
Morphing Tree Drawings in a Small 3D Grid
Aleksandra Istomina
,
Elena Arseneva
,
Rahul Gangopadhyay
.
walcom 2022
:
85-96
[doi]
Invitation to Combinatorial Reconfiguration
Takehiro Ito
.
walcom 2022
:
26-31
[doi]
Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard
Chuzo Iwamoto
,
Tatsuaki Ibusuki
.
walcom 2022
:
111-122
[doi]
Path Cover Problems with Length Cost
Kenya Kobayashi
,
Guohui Lin
,
Eiji Miyano
,
Toshiki Saitoh
,
Akira Suzuki
,
Tadatoshi Utashima
,
Tsuyoshi Yagita
.
walcom 2022
:
396-408
[doi]
WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24-26, 2022, Proceedings
Petra Mutzel
,
Md. Saidur Rahman
,
Slamin
, editors,
Volume 13174 of
Lecture Notes in Computer Science
, Springer,
2022.
[doi]
Finding Popular Branchings in Vertex-Weighted Digraphs
Kei Natsui
,
Kenjiro Takazawa
.
walcom 2022
:
303-314
[doi]
1-Complex s, t Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
Rahnuma Islam Nishat
,
Venkatesh Srinivasan 0001
,
Sue Whitesides
.
walcom 2022
:
59-70
[doi]
Isomorphism Testing for T-graphs in FPT
Deniz Agaoglu Çagirici
,
Petr Hlinený
.
walcom 2022
:
239-250
[doi]
2021
An Improvement of Reed's Treewidth Approximation
Mahdi Belbasi
,
Martin Fürer
.
walcom 2021
:
166-181
[doi]
Compact Data Structures for Dedekind Groups and Finite Rings
Bireswar Das
,
Shivdutt Sharma
.
walcom 2021
:
90-102
[doi]
Sign in
or
sign up
to see more results.