| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Md. Saidur Rahman, Shin-Ichi Nakano (eds.) |
WALCOM: Algorithms and Computation - 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings  |
WALCOM  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sammi Abida Salma, Md. Saidur Rahman |
Triangle-Free Outerplanar 3-Graphs Are Pairwise Compatibility Graphs. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Amr Elmasry, Jyrki Katajainen |
Fat Heaps without Regular Counters. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Krithika, N. S. Narayanaswamy |
Generalized Above Guarantee Vertex Cover and r-Partization. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma |
Approximating the Multi-level Bottleneck Assignment Problem. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos |
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephane Durocher, Debajyoti Mondal |
On the Hardness of Point-Set Embeddability - (Extended Abstract). |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sue Whitesides |
On Three-Dimensional Graph Drawing and Embedding. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Fink, Jan-Henrik Haunert, Tamara Mchedlidze, Joachim Spoerhase, Alexander Wolff |
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta, Salvatore Agostino Romeo |
Heuristics for the Maximum 2-layer RAC Subgraph Problem. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Bachmaier, Marco Matzeder |
Drawing Unordered Trees on k-Grids. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuo Iwama |
Approximability of Stable Matching Problems. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tiziana Calamoneri, Rossella Petreschi, Blerina Sinaimeri |
On Relaxing the Constraints in Pairwise Compatibility Graphs. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Md. Iqbal Hossain, Debajyoti Mondal, Md. Saidur Rahman, Sammi Abida Salma |
Universal Line-Sets for Drawing Planar 3-Trees. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sang Won Bae |
Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz |
Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet - (Extended Abstract). |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Widmayer |
Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff? |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Biing-Feng Wang, Jhih-Hong Ye, Pei-Jung Chen |
On the Round-Trip 1-Center and 1-Median Problems. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yasushi Kawase, Kazuhisa Makino |
Nash Equilibria with Minimum Potential in Undirected Broadcast Games. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sang Won Bae, Kyung-Yong Chwa |
Farthest Voronoi Diagrams under Travel Time Metrics - (Extended Abstract). |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Franz-Josef Brandenburg, Andreas Gleißner, Andreas Hofmeier |
Comparing and Aggregating Partial Orders with Kendall Tau Distances. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeaki Uno, Ryuhei Uehara, Shin-Ichi Nakano |
Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vorapong Suppakitpaisarn, Masato Edahiro, Hiroshi Imai |
Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ananda Swarup Das, Prosenjit Gupta, Anil Kishore Kalavagattu, Jatin Agarwal, Kannan Srinathan, Kishore Kothapalli |
Range Aggregate Maximal Points in the Plane. |
WALCOM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Debajyoti Mondal, Muhammad Jawaherul Alam, Md. Saidur Rahman |
Minimum-Layer Drawings of Trees - (Extended Abstract). |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Neelima Gupta, Aditya Pancholi, Yogish Sabharwal |
Clustering with Internal Connectedness. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Joe Sawada, Brett Stevens, Aaron Williams |
De Bruijn Sequences for the Binary Strings with Maximum Density. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar |
Oblivious Buy-at-Bulk in Planar Graphs. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh |
Approximation Algorithms for Minimum Chain Vertex Deletion. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourabh Aryabhatta, Tonmoy Guha Roy, Md. Mohsin Uddin, Md. Saidur Rahman |
On Graceful Labelings of Trees - (Extended Abstract). |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos |
Counting Spanning Trees in Graphs Using Modular Decomposition. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Annabell Berger, Matthias Müller-Hannemann, Steffen Rechner, Alexander Zock |
Efficient Computation of Time-Dependent Centralities in Air Transportation Networks. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamal Krishna Dey |
Geometry and Topology from Point Cloud Data. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Kniesburges, Christian Scheideler |
Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kurt Mehlhorn |
The Physarum Computer. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Schneider 0002 |
Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoki Katoh, Amit Kumar (eds.) |
WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Harrigan, Patrick Healy |
k-Level Crossing Minimization Is NP-Hard for Trees. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mourad El Ouali, Antje Fretwurst, Anand Srivastav |
Inapproximability of b-Matching in k-Uniform Hypergraphs. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Saladi Rahul, Prosenjit Gupta, Ravi Janardan, K. S. Rajan |
Efficient Top-k Queries for Orthogonal Ranges. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | David Duris, Yann Strozecki |
The Complexity of Acyclic Subhypergraph Problems. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Fink, Joachim Spoerhase |
Maximum Betweenness Centrality: Approximability and Tractable Cases. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gautam K. Das, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson |
On the Discrete Unit Disk Cover Problem. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Esha Ghosh, N. S. Narayanaswamy, C. Pandu Rangan |
A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi |
The Disjoint Paths Problem: Algorithm and Structure. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das |
Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Saladi Rahul, Ananda Swarup Das, K. S. Rajan, Kannan Srinathan |
Range-Aggregate Queries Involving Geometric Aggregation Operations. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern |
Multi Cover of a Polygon Minimizing the Sum of Areas. |
WALCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh, Somnath Sikdar |
FPT Algorithms for Connected Feedback Vertex Set. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara |
Reconstruction Algorithm for Permutation Graphs. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shashank, C. Pandu Rangan |
Pathwidth and Searching in Parameterized Threshold Graphs. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Emilio Di Giacomo, Giuseppe Liotta |
The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Md. Saidur Rahman, Satoshi Fujita (eds.) |
WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman |
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Subir Kumar Ghosh |
Approximation Algorithms for Art Gallery Problems in Polygons and Terrains. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki |
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrizio Angelini, Fabrizio Frati |
Acyclically 3-Colorable Planar Graphs. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ming Xu, Liangyu Chen, Zhenbing Zeng, Zhi-bin Li |
Real Root Isolation of Multi-Exponential Polynomials with Application. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Blin, Sylvie Hamel, Stéphane Vialette |
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen, V. N. Muralidhara |
The Covert Set-Cover Problem with Application to Network Discovery. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das, Arindam Karmakar, Jack Snoeyink |
Computation of Non-dominated Points Using Compact Voronoi Diagrams. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin |
Switch-Regular Upward Planar Embeddings of Trees. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyu Xiao |
A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan |
Variants of Spreading Messages. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Ferdinand Hübner |
A Global k-Level Crossing Reduction Algorithm. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Syed Ishtiaque Ahmed, Masud Hasan, Md. Ariful Islam |
Cutting a Convex Polyhedron Out of a Sphere. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tetsuo Asano, Wolfgang Mulzer, Yajun Wang |
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Takeya Shigezumi, Yushi Uno, Osamu Watanabe |
A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoki Katoh, Shin-ichi Tanigawa |
A Rooted-Forest Partition with Uniform Vertex Demand. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyriaki Ioannidou, Stavros D. Nikolopoulos |
Harmonious Coloring on Subclasses of Colinear Graphs. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ling-Ju Hung, Ton Kloks |
On Some Simple Widths. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya |
A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi |
Crossings between Curves with Many Tangencies. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Syed Ishtiaque Ahmed, Md. Mansurul Alam Bhuiyan, Masud Hasan, Ishita Kamal Khan |
On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiao Zhou, Takashi Hikino, Takao Nishizeki |
Small Grid Drawings of Planar Graphs with Balanced Bipartition. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Saverio Caminiti, Rossella Petreschi |
Parallel Algorithms for Encoding and Decoding Blob Code. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Helmut Alt, Ludmila Scharf |
Shape Matching by Random Sampling. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan |
The Planar k-Means Problem is NP-Hard. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-Ichi Nakano |
Generating All Triangulations of Plane Graphs (Extended Abstract). |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
Genealogical Tree, Graph, Triangulation, Polygon, Plane Graph |
| 1 | Kyriaki Ioannidou, Stavros D. Nikolopoulos |
Colinear Coloring on Graphs. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
Colinear coloring, threshold graphs, quasi-threshold graphs, algorithms, complexity, chordal graphs, chromatic number |
| 1 | Takuro Fukunaga, Hiroshi Nagamochi |
Network Design with Weighted Degree Constraints. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarmad Abbasi, Patrick Healy, Aimal Rextin |
An Improved Upward Planarity Testing Algorithm and Related Applications. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi |
Minmax Tree Cover in the Euclidean Space. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
Minmax Tree Cover, Balanced Partition, Tree Cover, Approximation Algorithms, Graph Algorithms |
| 1 | Jacob Fox, János Pach |
A Separator Theorem for String Graphs and Its Applications. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Little, Amitabh Chaudhary |
Object Caching for Queries and Updates. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves |
Recursive Generation of 5-Regular Planar Graphs. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
pentangulation, quintic, 5-regular, 5-valent, graph, map, planar |
| 1 | Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay |
Spherical-Rectangular Drawings. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Otfried Cheong |
Line Transversals and Pinning Numbers. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Brinkmeier |
Minimum Cuts of Simple Graphs in Almost Always Linear Time. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette |
The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen |
Approximating Shortest Paths in Graphs. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda |
Algorithms for Computing Diffuse Reflection Paths in Polygons. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi |
Recognition of Unigraphs through Superposition of Graphs (Extended Abstract). |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy |
Improved Algorithm for a Widest 1-Corner Corridor. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis Ibarra |
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandip Das, Ryuhei Uehara (eds.) |
WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings |
WALCOM |
2009 |
DBLP BibTeX RDF |
|
| 1 | Sang Won Bae, Matias Korman, Takeshi Tokuyama |
All Farthest Neighbors in the Presence of Highways and Obstacles. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Balasubramanian Sivan, S. Harini, C. Pandu Rangan |
Core and Conditional Core Path of Specified Length in Special Classes of Graphs. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
Core path, Conditional core path, Bipartite permutation graphs, Threshold graphs, Proper Interval graphs |
| 1 | Tamara Mchedlidze, Antonios Symvonis |
Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mustaq Ahmed, Anna Lubiw, Anil Maheshwari |
Shortest Gently Descending Paths. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")