default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18. COCOON 2012: Sydney, Australia
- Joachim Gudmundsson, Julián Mestre, Taso Viglas:
Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings. Lecture Notes in Computer Science 7434, Springer 2012, ISBN 978-3-642-32240-2 - Binay K. Bhattacharya, Tsunehiko Kameda:
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. 1-12 - Ragesh Jaiswal
, Amit Kumar, Sandeep Sen:
A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems. 13-24 - Evripidis Bampis, Dimitrios Letsios, Ioannis Milis, Georgios Zois:
Speed Scaling for Maximum Lateness. 25-36 - Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell:
Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? 37-48 - Ivona Bezáková, Zachary Langley:
Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs. 49-60 - Xin Han, Yasushi Kawase, Kazuhisa Makino:
Online Knapsack Problem with Removal Cost. 61-73 - Mingyu Xiao, Hiroshi Nagamochi:
An Improved Exact Algorithm for TSP in Degree-4 Graphs. 74-85 - Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Dynamic Programming for H-minor-free Graphs. 86-97 - Monaldo Mastrolilli, Georgios Stamoulis:
Restricted Max-Min Fair Allocations with Inclusion-Free Intervals. 98-108 - Maxim A. Babenko, Kamil Salikhov, Stepan Artamonov:
An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks. 109-120 - René van Bevern:
Towards Optimal and Expressive Kernelization for d-Hitting Set. 121-132 - Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Yngve Villanger:
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs. 133-144 - Pan Peng:
A Local Algorithm for Finding Dense Bipartite-Like Subgraphs. 145-156 - Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung, Yue-Li Wang:
Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs. 157-168 - Biing-Feng Wang, Chih-Hsuan Li:
On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property. 169-180 - L. Sunil Chandran, Deepak Rajendraprasad:
Rainbow Colouring of Split and Threshold Graphs. 181-192 - Alexandru Popa:
Approximating the Rainbow - Better Lower and Upper Bounds. 193-203 - Rémy Belmonte, Pinar Heggernes, Pim van 't Hof, Reza Saei:
Ramsey Numbers for Line Graphs and Perfect Graphs. 204-215 - Oswin Aichholzer, Matias Korman, Alexander Pilz, Birgit Vogtenhuber:
Geodesic Order Types. 216-227 - Stephane Durocher, Saeed Mehrabi:
Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number. 228-239 - Adrian Dumitrescu, Günter Rote, Csaba D. Tóth:
Monotone Paths in Planar Convex Subdivisions. 240-251 - Hyo-Sil Kim, Otfried Cheong:
The Cost of Bounded Curvature. 252-263 - Darius Geiß, Rolf Klein, Rainer Penninger:
Optimally Solving a Transportation Problem Using Voronoi Diagrams. 264-274 - Paz Carmi, Lilach Chaitman-Yerushalmi:
Unexplored Steiner Ratios in Geometric Networks. 275-286 - Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
Geometric RAC Simultaneous Drawings of Graphs. 287-298 - Taylor Gordon:
Simultaneous Embeddings with Vertices Mapping to Pre-specified Points. 299-310 - Fabrizio Frati:
Multilevel Drawings of Clustered Graphs. 311-322 - Kolja B. Knauer, Piotr Micek, Bartosz Walczak:
Outerplanar Graph Drawings with Few Slopes. 323-334 - Seok-Hee Hong, Peter Eades, Giuseppe Liotta, Sheung-Hung Poon:
Fáry's Theorem for 1-Planar Graphs. 335-346 - Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura:
Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application. 347-359 - Alka Bhushan, Sajith Gopalan:
External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue. 360-371 - Tomas Hruz, Marcel Schöngens:
Partially Specified Nearest Neighbor Search. 372-383 - Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki:
Multi-pattern Matching with Bidirectional Indexes. 384-395 - Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti:
Succinct Representations of Binary Trees for Range Minimum Queries. 396-407 - Ruiwen Chen, Valentine Kabanets:
Lower Bounds against Weakly Uniform Circuits. 408-419 - Jeff Kinne:
On TC0 Lower Bounds for the Permanent. 420-432 - Kenya Ueno:
Formula Complexity of Ternary Majorities. 433-444 - Fahad Panolan, Ashutosh Rai:
On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles. 445-457 - Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
The Complexity of Unary Subset Sum. 458-469 - Sebastian Ben Daniel:
On the Advice Complexity of Tournaments. 470-481 - Periklis A. Papakonstantinou, Guang Yang:
A Remark on One-Wayness versus Pseudorandomness. 482-494 - Van Bang Le, Dieter Rautenbach:
Integral Mixed Unit Interval Graphs. 495-506 - Benjamin A. Burton:
Complementary Vertices and Adjacency Testing in Polytopes. 507-518 - Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Lucia Keller:
Online Coloring of Bipartite Graphs with and without Advice. 519-530 - Pawel Górecki, Oliver Eulenstein:
Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms. 531-542 - Yongding Zhu, Jinhui Xu:
On the 2-Central Path Problem. 543-555 - Jen-Hou Chou, Chi-Jen Lu, Mu-En Wu:
Making Profit in a Prediction Market. 556-567 - David Liben-Nowell, Alexa Sharp, Tom Wexler, Kevin M. Woods:
Computing Shapley Value in Supermodular Coalitional Games. 568-579 - H. F. Ting, Xiangzhong Xiang:
Equilibria of GSP for Range Auction. 580-591 - Costas Busch, Rajgopal Kannan:
Stretch in Bottleneck Games. 592-603
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-01-06 22:47 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
