- Eduardo Rivera-Campo. Graph of uv-paths in 2-connected graphs
|
- Pat Vatiwutipong and Nattapol Chanpaisit. Parallel Curves Detection Method Based on Hough Transform
|
- Ryohei Miyadera and Hikaru Manabe. Previous Player's Positions of Impartial Three-Dimensional Chocolate-Bar Games
|
- Ryohei Miyadera, Hikaru Manabe, Kousei Suzuki, Taishi Aono, Shouei Takahasi and Sohta Kannan. Chocolate Games and Restricted Nim
|
- Saharath Sanguanpong and Nantapath Trakultraipruk. Γ-Induced-Paired Dominating Graphs of Cycles
|
- Ghurumuruhan Ganesan. Redundancy of Linear Codes with Graph Constraints
|
- Ghurumuruhan Ganesan. Fractional Graph Capacity
|
- Tharit Sereekiatdilok and Panupong Vichitkunakorn. Biased Domination Game
|
- Chengyang Qian. Number of Go positions on a connected graph
|
- Korina Ernjulie Manaloto and Rovin Santos. Prime Labeling of Trees Using Eisenstein Integers
|
- Mikio Kano and Masao Tsugaki. Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs
|
- Oswin Aichholzer, Maarten Löffler, Jayson Lynch, Zuzana Masárová, Joachim Orthaber, Irene Parada, Rosna Paul, Daniel Perz, Birgit Vogtenhuber and Alexandra Weinberger. Dominect: A Simple yet Deep 2-Player Board Game
|
- Sethuraman Guruswamy and Murugan Varadhan. Every Tree is a Subtree of a Graceful Unicyclic Graph
|
- Chao Yang. Tiling the Plane Connectively with Wang Tiles
|
- Erik Demaine and Kritkorn Karntikoon. Unfolding Orthotubes with a Dual Hamiltonian Path
|
- Hiro Ito and Sae Neshiba. Flat folding problem with parallel creases with mountain-valley assignment on a convex polygonal piece of paper
|
- Md. Manzurul Hasan, Debajyoti Mondal and Md. Saidur Rahman. Linear-Time Rectilinear Drawings of Triconnected Subcubic Planar Graphs with Orthogonally Convex Faces
|
- Sujoy Bhore, Jean Cardinal, John Iacono and Grigorios Koumoutsos. Dynamic Independent Set of Squares
|
- Josh Brunner, Erik D. Demaine, Dylan Hendrickson, Victor Luo and Andy Tockman. Complexity of Simple Folding Orthogonal Crease Patterns
|
- Joshua Ani, Josh Brunner, Erik D. Demaine, Martin L. Demaine, Dylan Hendrickson, Victor Luo and Rachana Madhukara. Orthogonal Fold & Cut
|
- Kota Chida, Erik Demaine, Martin Demaine, David Eppstein, Adam Hesterberg, Takashi Horiyama, John Iacono, Hiro Ito, Stefan Langerman, Ryuhei Uehara and Yushi Uno. Multifold tiles of polyominoes and convex lattice polygons
|
- Nóra Frankl, Andrei Kupavskii and Arsenii Sagdeev. Max-norm analogs of Euclidean Ramsey theorems
|
- Luis Jr. Silvestre and Job Nable. Generating Frames via Discretized Substitution Tilings
|
- David Caballero, Angel Cantu, Timothy Gomez, Austin Luchsinger, Robert Schweller and Tim Wylie. Unit Tilt Row Relocation in a Square
|
- Jeffrey Bosboom, Josh Brunner, Michael Coulombe, Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch and Lorenzo Najt. The Legend of Zelda: The Complexity of Mechanics
|
- Zijian Xu and Vorapong Suppakitpaisarn. On the Size of Minimal Separators for Treedepth Decomposition
|
- Naoki Matsumoto and Atsuki Nagao. Feedback game on Eulerian graphs
|
- Min Yan, Yohji Akama, Hoi Ping Luk and Erxiao Wang. Tiling of the Sphere by Congruent Polygons
|
- Toshinori Sakai. Unidirectional monotonic paths through specified points in labeled point sets in convex position
|
- Yiyang Jia, Jun Mitani and Ryuhei Uehara. Logical Matrix Representations in Map Folding
|
- Kazuki Matsubara and Chie Nara. The maximum numbers of the rigid faces and edges in continuous flattening processes of a polyhedron
|
- Ilya Bogdanov, Grigory Chelnokov and Margarita Akhmejanova. Moving gold sand game
|
- Jin Akiyama, Ikuro Sato and Toshinori Sakai. Distance to antipode of semi-regular polytope, measured by edges of equal length
|
- Tomoaki Abuku and Masato Tada. Multiple Hook Removing Game
|
- Nattapon Rintaew and Supanut Chaidee. The Conditions for Fitting a Square in a Trapezoid
|
- Sitta Alief Farihati, A. N. M Salman and Pritta Etriana Putri. Rainbow Connection Numbers of s-Overlapping r-Uniform Hypertrees
|
- Kevin Limanta and Norman Wildberger. Super Catalan Numbers, Chromogeometry, and Fourier Summations over Finite Fields
|
- Evangelos Kranakis. Strategies for Surviving Aggressive Multiparty Standoffs
|
- Mark Anthony Tolentino and Gerone Russel Eugenio. The Set Chromatic Number of the Middle Graph of Extended Stars
|
- Aroonwan Suebsriwichai and Thanasak Mouktonglang. Rainbow Connection Number of Dutch Windmill Graph
|
- Chutima Saengchampa and Chariya Uiyyasathian. Hamiltonian decompositions of complete 4-partite 3-uniform hypergraphs
|
- Gerard Francis Ortega. Losing Positions of Splythoff and 2-Splythoff encoded in the Tribonacci word
|
- Francis Delloro and Job Nable. Discrete Quantum Systems via Tight Group Frames and their Geometrization
|
- Giovanni Viglietta, Csaba Tóth and Jorge Urrutia. Minimizing Visible Edges in Polyhedra
|
- Johannes Obenaus and Joachim Orthaber. Complete Geometric Graphs with no Partition into Plane Spanning Trees
|
- Kazushi Ito and Yasuhiko Takenaga. NP-Completeness of Peg Solitaire on Graphs
|
- Chanikan Sawatdithep and Supanut Chaidee. Recognition of Archimedean Spiral Voronoi diagram
|
- Hironori Kiya and Hirotaka Ono. Multi-Player Open-Hand BABANUKI
|
- Koki Suetsugu. Playing impartial games on a simplicial complex as extension of emperor sum
|
- Agnes Garciano, Reginaldo Marcelo, Mari-Jo Ruiz and Mark Anthony Tolentino. On rainbow mean colorings of brooms and double brooms
|
- Kevin Limanta, Hopein Christofen Tang and Yozef Tjandra. Permutation-Generated Maps between Dyck Paths
|
- Jin Akiyama, Kiyoko Matsunaga, Sachiko Nakajima and Natsumi Oyamaguchi. The M¨øbius Love-Fate Fortune Telling Conundrum
|
- Waitin Sinthu-Urai and Piyashat Sripratak. Snakes and Ladders with Large Spinners under an Alternative Winning Rule
|
- Rismawati Ramdani, Irsa Islammeidini Rusvianti and Hasni Rahmani Rohim. On the Edge Irregularity Strength of Some Disjoint Union Graphs
|
- Nattawut Phetmak. Random Derangement with Fixed Number of Cycles
|
- Jack Spalding-Jamieson. Computing the Probability of Striking a Battleship
|
- Reiya Nosaka, Hiroyuki Miyata and Shin-ichi Nakano. A complete combinatorial characterization of greedy-drawable trees
|
- Silvia Fernandez and Rimma Hamalainen. Direction-Critical Configurations in Noncentral-General Position
|
- Xi Shen and Aaron Williams. A k-ary Middle Levels Conjecture
|
- Lily Chung and Erik Demaine. Celeste is PSPACE-hard
|
- Robert Barish and Tetsuo Shibuya. Solving teleportation mazes with limited visibility
|
- Takashi Yoshino. Renzuru Tilings with Asymmetric Quadrilaterals
|
- Penying Rochanakul and Sayan Panma. Prime-Graceful Number
|
