default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIWOCA 2012: Tamil Nadu, India
- S. Arumugam, W. F. Smyth:
Combinatorial Algorithms, 23rd International Workshop, IWOCA 2012, Tamil Nadu, India, July 19-21, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7643, Springer 2012, ISBN 978-3-642-35925-5 - Malay Bhattacharyya
, Sanghamitra Bandyopadhyay:
Bounds on Quasi-Completeness. 1-5 - Anthony Bonato, Jeannette C. M. Janssen:
Infinite Random Geometric Graphs from the Hexagonal Metric. 6-19 - Henning Fernau:
Saving on Phases: Parameterized Approximation for Total Vertex Cover. 20-31 - Florent Foucaud, Matjaz Kovse:
On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths. 32-45 - Wojciech Fraczak, Andrew Miller:
Disjoint Set Forest Digraph Representation for an Efficient Dominator Tree Construction. 46-59 - Muhammad Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman:
On Some Properties of Doughnut Graphs. 60-64 - KM. Kathiresan, S. Arockiaraj, R. Gurusamy, K. Amutha:
On the Steiner Radial Number of Graphs. 65-72 - T. Kavaskar:
Further Results on the Mycielskian of Graphs. 73-75 - Niraj Ramesh Dayama, Ketki Kulkarni:
Approaches and Mathematical Models for Robust Solutions to Optimization Problems with Stochastic Problem Data Instances. 76-80 - Jay Mahadeokar, Sanjeev Saxena:
Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter. 81-85 - Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides:
Acyclic Coloring with Few Division Vertices. 86-99 - S. Monikandan, S. Sundar Raj:
Degree Associated Edge Reconstruction Number. 100-109 - Amirhossein Mozafari, Alireza Zarei:
Touring Polygons: An Approximation Algorithm. 110-121 - S. Francis Raj:
Super Connectivity of the Generalized Mycielskian of Graphs. 122-124 - Laxman Saha, Pratima Panigrahi:
A Graph Radio k-Coloring Algorithm. 125-129 - Sagnik Sen:
Maximum Order of a Planar Oclique Is 15. 130-142 - Shanmugasundaram Jeevadoss, Appu Muthusamy:
Sufficient Condition for {C 4, C 2t } - Decomposition of K 2m, 2n - An Improved Bound. 143-147 - Meenakshi Wasadikar, Pradnya Survase:
Incomparability Graphs of Lattices II. 148-161 - Tao-Ming Wang, Guang-Hui Zhang:
On Antimagic Labeling of Odd Regular Graphs. 162-168 - Pritom Ahmed, A. S. M. Shohidull Islam, M. Sohel Rahman:
A Graph Theoretic Model to Solve the Approximate String Matching Problem Allowing for Translocations. 169-181 - R. Arulprakasam, V. Rajkumar Dare, S. Gnanasekaran:
Deterministic Fuzzy Automata on Fuzzy Regular ω-Languages. 182-188 - Richard Beal, Donald A. Adjeroh:
Border Array for Structural Strings. 189-205 - Francine Blanchet-Sadri, Andrew Lohr, Shane Scott:
Computing the Partial Word Avoidability Indices of Ternary Patterns. 206-218 - Shihabur Rahman Chowdhury, Md. Mahbubul Hasan, Sumaiya Iqbal, M. Sohel Rahman:
Computing a Longest Common Palindromic Subsequence. 219-223 - Michal Kolarz, Wlodzimierz Moczurad:
Multiset, Set and Numerically Decipherable Codes over Directed Figures. 224-235 - Bruce W. Watson, Derrick G. Kourie, Tinus Strauss:
A Sequential Recursive Implementation of Dead-Zone Single Keyword Pattern Matching. 236-248 - Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen:
A Catalogue of Algorithms for Building Weak Heaps. 249-262 - Anil Kishore Kalavagattu, Jatin Agarwal, Ananda Swarup Das, Kishore Kothapalli:
On Counting Range Maxima Points in Plane. 263-273 - Gonzalo Navarro:
Indexing Highly Repetitive Collections. 274-279 - Rajeev Raman:
Range Extremum Queries. 280-287 - Ray Jinzhu Chen, Kevin Scott Reschke, Hailong Hu:
Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations. 288-292 - Sanjib Sadhu, Subhashis Hazarika, Kapil Kumar Jain, Saurav Basu, Tanmay De:
GRP_CH Heuristic for Generating Random Simple Polygon. 293-302
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-29 00:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
