Search results for "WALCOM"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Saladi Rahul, Prosenjit Gupta, Ravi Janardan, Krishnan Sundara Rajan	Efficient Top-k Queries for Orthogonal Ranges.	WALCOM	2011	DBLP DOI BibTeX RDF
1	Naoki Katoh, Amit Kumar 0001 (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	Ken-ichi Kawarabayashi	The Disjoint Paths Problem: Algorithm and Structure.	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	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	Sourabh Aryabhatta, Tonmoy Guha Roy, Md. Mohsin Uddin, Md. Saidur Rahman 0001	On Graceful Labelings of Trees - (Extended Abstract).	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	Saladi Rahul, Ananda Swarup Das, Krishnan Sundara Rajan, Kannan Srinathan	Range-Aggregate Queries Involving Geometric Aggregation Operations.	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	Martin Fink 0001, Joachim Spoerhase	Maximum Betweenness Centrality: Approximability and Tractable Cases.	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	Joe Sawada, Brett Stevens, Aaron Williams	De Bruijn Sequences for the Binary Strings with Maximum Density.	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	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	Debajyoti Mondal, Muhammad Jawaherul Alam, Md. Saidur Rahman 0001	Minimum-Layer Drawings of Trees - (Extended Abstract).	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	Mrinal Kumar 0001, Sounaka Mishra, N. Safina Devi, Saket Saurabh 0001	Approximation Algorithms for Minimum Chain Vertex Deletion.	WALCOM	2011	DBLP DOI BibTeX RDF
1	Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das 0001	Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point.	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	David Duris, Yann Strozecki	The Complexity of Acyclic Subhypergraph Problems.	WALCOM	2011	DBLP DOI BibTeX RDF
1	Neelima Gupta, Aditya Pancholi, Yogish Sabharwal	Clustering with Internal Connectedness.	WALCOM	2011	DBLP DOI BibTeX RDF
1	Kurt Mehlhorn	The Physarum Computer.	WALCOM	2011	DBLP DOI BibTeX RDF
1	Tamal Krishna Dey	Geometry and Topology from Point Cloud Data.	WALCOM	2011	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	Sandeep Sen, V. N. Muralidhara	The Covert Set-Cover Problem with Application to Network Discovery.	WALCOM	2010	DBLP DOI BibTeX RDF
1	Xiao Zhou 0001, Takashi Hikino, Takao Nishizeki	Small Grid Drawings of Planar Graphs with Balanced Bipartition.	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	Saverio Caminiti, Rossella Petreschi	Parallel Algorithms for Encoding and Decoding Blob Code.	WALCOM	2010	DBLP DOI BibTeX RDF
1	Patrizio Angelini, Fabrizio Frati	Acyclically 3-Colorable Planar Graphs.	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	Naoki Katoh, Shin-ichi Tanigawa	A Rooted-Forest Partition with Uniform Vertex Demand.	WALCOM	2010	DBLP DOI BibTeX RDF
1	Arijit Bishnu, Sandip Das 0001, 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	Carla Binucci, Emilio Di Giacomo, Walter Didimo, Aimal Rextin	Switch-Regular Upward Planar Embeddings of Trees.	WALCOM	2010	DBLP DOI BibTeX RDF
1	Ming Xu 0010, Liangyu Chen 0001, Zhenbing Zeng, Zhi-bin Li 0005	Real Root Isolation of Multi-Exponential Polynomials with Application.	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	Neeldhara Misra, Geevarghese Philip, Venkatesh Raman 0001, Saket Saurabh 0001, 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	T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan	Variants of Spreading Messages.	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	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	Ling-Ju Hung, Ton Kloks	On Some Simple Widths.	WALCOM	2010	DBLP DOI BibTeX RDF
1	Binay K. Bhattacharya, Arijit Bishnu, Otfried Cheong, Sandip Das 0001, Arindam Karmakar, Jack Snoeyink	Computation of Non-dominated Points Using Compact Voronoi Diagrams.	WALCOM	2010	DBLP DOI BibTeX RDF
1	Mingyu Xiao 0001	A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs.	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	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	Takeya Shigezumi, Yushi Uno, Osamu Watanabe 0001	A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques.	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	Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi	Crossings between Curves with Many Tangencies.	WALCOM	2010	DBLP DOI BibTeX RDF
1	Md. Saidur Rahman 0001, 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	Sang Won Bae, Matias Korman, Takeshi Tokuyama	All Farthest Neighbors in the Presence of Highways and Obstacles.	WALCOM	2009	DBLP DOI BibTeX RDF
1	Muhammad Rezaul Karim 0001, Md. Jawaherul Alam, Md. Saidur Rahman 0001	Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(nlogn) Area (Extended Abstract).	WALCOM	2009	DBLP DOI BibTeX RDF	Label-Constrained Outerplanar Graph, Grid Drawing, Planar Graph, Outerplanar Graph, Dual Graph, Straight-Line Drawing
1	Helmut Alt, Ludmila Scharf	Shape Matching by Random Sampling.	WALCOM	2009	DBLP DOI BibTeX RDF
1	Takuro Fukunaga, Hiroshi Nagamochi	Network Design with Weighted Degree Constraints.	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	Louis Ibarra	A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs.	WALCOM	2009	DBLP DOI BibTeX RDF
1	Michael Dom, Michael R. Fellows, Frances A. Rosamond	Parameterized Complexity of Stabbing Rectangles and Squares in the Plane.	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	Sang Won Bae, Chunseok Lee, Sunghee Choi	On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem.	WALCOM	2009	DBLP DOI BibTeX RDF
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	Mustaq Ahmed, Anna Lubiw, Anil Maheshwari	Shortest Gently Descending Paths.	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	Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay	Spherical-Rectangular Drawings.	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	Jacob Fox, János Pach	A Separator Theorem for String Graphs and Its Applications.	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	Brian C. Dean, Namrata Swar	The Generalized Stable Allocation Problem.	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	Xavier Muñoz, Sebastian Seibert, Walter Unger	The Minimal Manhattan Network Problem in Three Dimensions.	WALCOM	2009	DBLP DOI BibTeX RDF
1	Sandip Das 0001, Ryuhei Uehara (eds.)	WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings	WALCOM	2009	DBLP DOI BibTeX RDF
1	Philip Little, Amitabh Chaudhary	Object Caching for Queries and Updates.	WALCOM	2009	DBLP DOI BibTeX RDF
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	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	Sandeep Sen	Approximating Shortest Paths in Graphs.	WALCOM	2009	DBLP DOI BibTeX RDF
1	Chee-Keng Yap, Jihun Yu	Foundations of Exact Rounding.	WALCOM	2009	DBLP DOI BibTeX RDF
1	Otfried Cheong	Line Transversals and Pinning Numbers.	WALCOM	2009	DBLP DOI BibTeX RDF
1	Mohammad Tanvir Parvez, Md. Saidur Rahman 0001, 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	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	Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara	Random Generation and Enumeration of Proper Interval Graphs.	WALCOM	2009	DBLP DOI BibTeX RDF	proper interval graphs, unit interval graphs, enumeration, Counting, random generation
1	Luca Grilli 0001, Seok-Hee Hong 0001, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath	Matched Drawability of Graph Pairs and of Graph Triples.	WALCOM	2009	DBLP DOI BibTeX RDF
1	Md. Muhibur Rasheed, Masud Hasan, M. Sohel Rahman	Maximum Neighbour Voronoi Games.	WALCOM	2009	DBLP DOI BibTeX RDF	Competitive facility location, Voronoi games, Voronoi diagram, Delaunay triangulation
1	Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan	The Planar k-Means Problem is NP-Hard.	WALCOM	2009	DBLP DOI BibTeX RDF
1	Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano	Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract).	WALCOM	2009	DBLP DOI BibTeX RDF	family tree, algorithm, graph, enumeration, ordered tree
1	Miki Hermann, Florian Richoux	On the Computational Complexity of Monotone Constraint Satisfaction Problems.	WALCOM	2009	DBLP DOI BibTeX RDF
1	Costas S. Iliopoulos, M. Sohel Rahman	Indexing Circular Patterns.	WALCOM	2008	DBLP DOI BibTeX RDF
1	Md. Abul Hassan Samee, Mohammad Tanvir Irfan, Md. Saidur Rahman 0001	Computing beta -Drawings of 2-Outerplane Graphs in Linear Time.	WALCOM	2008	DBLP DOI BibTeX RDF	Proximity Drawing, ?-Drawing, Proximity Graph, 2-Outerplane graph, Slicing Path, Good Slicing Path, Graph Drawing
1	Sébastien Angibaud, Guillaume Fertin, Irena Rusu	On the Approximability of Comparing Genomes with Duplicates.	WALCOM	2008	DBLP DOI BibTeX RDF	conserved intervals, genome rearrangement, duplicates, breakpoints, adjacencies, common intervals, APX-Hardness
1	Henning Fernau, Daniel Raible 0001	Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs.	WALCOM	2008	DBLP DOI BibTeX RDF
1	Yerim Chung, Jean-François Culus, Marc Demange	Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs.	WALCOM	2008	DBLP DOI BibTeX RDF	Inverse combinatorial optimization, Inverse chromatic number problem, Machine(s)-scheduling with earliness and or tardiness costs, Approximation, NP-hardness, Interval graphs
1	Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski	Linear-Time 3-Approximation Algorithm for the r -Star Covering Problem.	WALCOM	2008	DBLP DOI BibTeX RDF
1	Ryuhei Uehara	Simple Geometrical Intersection Graphs.	WALCOM	2008	DBLP DOI BibTeX RDF	grid intersection graphs, graph isomorphism, interval graphs, Hamiltonian path problem
1	Muhammad Rezaul Karim 0001, Md. Saidur Rahman 0001	Four-Connected Spanning Subgraphs of Doughnut Graphs.	WALCOM	2008	DBLP DOI BibTeX RDF	Doughnut Graph, Grid Drawing, Linear Area Drawing, Planar Graph, Straight-Line Drawing
1	Riadh Khennoufa, Olivier Togni	Multilevel Bandwidth and Radio Labelings of Graphs.	WALCOM	2008	DBLP DOI BibTeX RDF	generalized graph bandwidth, radio labeling, frequency assignment
1	Muhammad Ashraful Alam, Masud Hasan	Computing Nice Projections of Convex Polyhedra.	WALCOM	2008	DBLP DOI BibTeX RDF	nice orthogonal projections, Voronoi diagram, views, Convex polyhedra
1	Satoshi Fujita	Vertex Domination in Dynamic Networks.	WALCOM	2008	DBLP DOI BibTeX RDF	defection, Dominating set, dynamic network, regular graphs
1	Md. Jawaherul Alam, Md. Abul Hassan Samee, Mashfiqui Rabbi, Md. Saidur Rahman 0001	Upward Drawings of Trees on the Minimum Number of Layers.	WALCOM	2008	DBLP DOI BibTeX RDF	Planar Drawing, k-layer Planar Drawing, Upward Drawing, Minimum Layer Upward Drawing, Algorithm, Trees, Line-labeling, Straight-line Drawing
1	Md. Abdur Razzaque, Choong Seon Hong, Mohammad Abdullah-Al-Wadud, Oksam Chae	A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs.	WALCOM	2008	DBLP DOI BibTeX RDF	Boolean Matrix, Graph Diameter, Computational Complexity, Random Graphs, Adjacency Matrix

Publications at "WALCOM"( http://dblp.L3S.de/Venues/WALCOM )