• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 16 matches

• 2013
• 
  Jin Akiyama, Mikio Kano, Toshinori Sakai:
  Computational Geometry and Graphs - Thailand-Japan Joint Conference, TJJCCGG 2012, Bangkok, Thailand, December 6-8, 2012, Revised Selected Papers. Lecture Notes in Computer Science 8296, Springer 2013, ISBN 978-3-642-45280-2 [contents]
• 2012
• 
  Jin Akiyama, Hyunwoo Seong:
  Operators which Preserve Reversibility. TJJCCGG 2012: 1-19
• 
  Victor Alvarez, Atsuhiro Nakamoto:
  Colored Quadrangulations with Steiner Points. TJJCCGG 2012: 20-29
• 
  Jean Cardinal, Michael Hoffmann, Vincent Kusters:
  On Universal Point Sets for Planar Graphs. TJJCCGG 2012: 30-41
• 
  Wongsakorn Charoenpanitseri, Narong Punnim, Chariya Uiyyasathian:
  On Non 3-Choosable Bipartite Graphs. TJJCCGG 2012: 42-56
• 
  Jung Rae Cho, Jeongmi Park, Yoshio Sano:
  Edge-disjoint Decompositions of Complete Multipartite Graphs into Gregarious Long Cycles. TJJCCGG 2012: 57-63
• 
  Nikolai P. Dolbilin, Jin-ichi Itoh, Chie Nara:
  Affine Classes of 3-Dimensional Parallelohedra - Their Parametrization -. TJJCCGG 2012: 64-72
• 
  Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
  On Complexity of Flooding Games on Graphs with Interval Representations. TJJCCGG 2012: 73-84
• 
  Hiro Ito:
  How to Generalize Janken - Rock-Paper-Scissors-King-Flea. TJJCCGG 2012: 85-94
• 
  Mikio Kano, Tomoki Yamashita, Zheng Yan:
  Spanning Caterpillars Having at Most k Leaves. TJJCCGG 2012: 95-100
• 
  Wannee Lapchinda, Narong Punnim, Nittiya Pabhapote:
  GDDs with Two Associate Classes and with Three Groups of Sizes 1, n, n and λ 1 < λ 2. TJJCCGG 2012: 101-109
• 
  Naoki Matsumoto, Atsuhiro Nakamoto:
  The Number of Diagonal Transformations in Quadrangulations on the Sphere. TJJCCGG 2012: 110-119
• 
  Filip Moric, János Pach:
  Remarks on Schur's Conjecture. TJJCCGG 2012: 120-131
• 
  Yusuke Nojima, Yasuhito Asano, Masatoshi Yoshikawa:
  Greedy Approximation Algorithms for Generalized Maximum Flow Problem towards Relation Extraction in Information Networks. TJJCCGG 2012: 132-142
• 
  Masahide Takasuga, Tomio Hirata:
  A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian. TJJCCGG 2012: 143-149
• 
  Ke Yan, Ho-Lun Cheng:
  On Simplifying Deformation of Smooth Manifolds Defined by Large Weighted Point Sets. TJJCCGG 2012: 150-161