| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Amir Shpilka |
Capacity Achieving Two-Write WOM Codes.  |
LATIN  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot |
On Plane Constrained Bounded-Degree Spanners. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Fürer |
Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Boria, Jérôme Monnot, Vangelis Th. Paschos |
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pooya Davoodi, Michiel H. M. Smid, Freek van Walderveen |
Two-Dimensional Range Diameter Queries. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister 0001 |
Computing Minimum Geodetic Sets of Proper Interval Graphs. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum |
An Equivariance Theorem with Applications to Renaming. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiawei Qian, Frans Schalekamp, David P. Williamson, Anke van Zuylen |
On the Integrality Gap of the Subtour LP for the 1, 2-TSP. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Dadush |
A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Antoine Mamcarz, Fabien de Montgolfier |
Algorithms for Some H-Join Decompositions. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Toryn Qwyllyn Klassen, Philipp Woelfel |
Independence of Tabulation-Based Hash Classes. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni |
Advantage of Overlapping Clusters for Minimizing Conductance. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gero Greiner, Riko Jacob |
The Efficiency of MapReduce in Parallel External Memory. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Linqing Tang, Peng Zhang 0008 |
Approximating Minimum Label s-t Cut via Linear Programming. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Crowston, Gregory Z. Gutin, Mark Jones 0001, Venkatesh Raman 0001, Saket Saurabh 0001 |
Parameterized Complexity of MaxSat above Average. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafael da Ponte Barbosa, Yoshiko Wakabayashi |
A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Jonathan Kausch, Markus Lohrey |
Logspace Computations in Graph Groups and Coxeter Groups. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron |
A Generalization of the Convex Kakeya Problem. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther M. Arkin, José Miguel Díaz-Báñez, Ferran Hurtado, Piyush Kumar, Joseph S. B. Mitchell, Belén Palop, Pablo Pérez-Lantero, Maria Saumell, Rodrigo I. Silveira |
Bichromatic 2-Center of Pairs of Points. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Basile Morcrette |
Fully Analyzing an Algebraic Pólya Urn Model. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Brody, Hongyu Liang, Xiaoming Sun 0001 |
Space-Efficient Approximation Scheme for Circular Earth Mover Distance. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi, Vahab S. Mirrokni, Sina Sadeghian Sadeghabad |
On the Non-progressive Spread of Influence through Social Networks. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro, Shmuel Zaks |
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | David Fernández-Baca (eds.) |
LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hadas Shachnai, Gal Tamir, Tami Tamir |
A Theory and Algorithms for Combinatorial Reoptimization. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh 0001 |
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Peter Rossmanith |
On the Advice Complexity of the Knapsack Problem. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Fischer 0001, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki |
Forbidden Patterns. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce, Ladislav Stacho |
Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Vincent Chau |
Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Leena Salmela, Jorma Tarhio |
Indexed Multi-pattern Matching. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernard Mans, Igor E. Shparlinski |
Random Walks and Bisections in Random Circulant Graphs. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hélio B. Macêdo Filho, Raphael C. S. Machado, Celina M. H. de Figueiredo |
Clique-Colouring and Biclique-Colouring Unichord-Free Graphs. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitre Costa Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp Matthias Schäfer, Jayme Luiz Szwarcfiter, Alexandre Toman |
On the Radon Number for P 3-Convexity. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli |
The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger |
k-Gap Interval Graphs. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Elizabeth Maltais, Lucia Moura |
Finding the Best CAFE Is NP-Hard. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Qianping Gu, Navid Imani |
Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Gall, Riko Jacob, Andréa W. Richa, Christian Scheideler, Stefan Schmid 0001, Hanjo Täubig |
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Christian Hundt 0001, Ragnar Nevries |
Efficient Edge Domination on Hole-Free Graphs in Polynomial Time. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Per Austrin, Siavosh Benabbas, Avner Magen |
On Quadratic Threshold CSPs. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuichi Asahiro, Eiji Miyano, Kazuaki Samizo |
Approximating Maximum Diameter-Bounded Subgraphs. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadTaghi Hajiaghayi, Arefeh A. Nasri |
Prize-Collecting Steiner Networks via Iterative Rounding. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Gál, Jing-Tang Jang |
The Size and Depth of Layered Boolean Circuits. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémy Barbay, Francisco Claude, Gonzalo Navarro 0001 |
Compact Rich-Functional Binary Relation Representations. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Qi Ge, Daniel Stefankovic |
The Complexity of Counting Eulerian Tours in 4-Regular Graphs. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Daming Xu |
Communication-Efficient Construction of the Plane Localized Delaunay Graph. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark van Hoeij, Andrew Novocin |
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christine Chung 0001, Katrina Ligett, Kirk Pruhs, Aaron Roth 0001 |
The Power of Fair Pricing Mechanisms. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian |
Colorful Strips. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni 0001, Saket Saurabh 0001 |
Sharp Separation and Applications to Exact and Parameterized Algorithms. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Britta Peis, Martin Skutella, Andreas Wiese |
Packet Routing on the Grid. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato |
The Language Theory of Bounded Context-Switching. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi |
Euclidean Prize-Collecting Steiner Forest. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred G. Madritsch, Brigitte Vallée |
Modelling the LLL Algorithm by Sandpiles. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Karpinski, Andrzej Rucinski 0001, Edyta Szymanska |
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tsunehiko Kameda, Ichiro Suzuki, John Z. Zhang |
Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Jeff M. Phillips, Bardia Sadri |
Lipschitz Unimodal and Isotonic Regression on Paths and Trees. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Bitner, Yam Ki Cheung, Atlas F. Cook, Ovidiu Daescu, Anastasia Kurdia, Carola Wenk |
Visiting a Sequence of Points with a Bevel-Tip Needle. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Carles Padró, Leonor Vázquez |
Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Ferragina, Travis Gagie, Giovanni Manzini |
Lightweight Data Indexing and Compression in External Memory. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Dumitrescu, Minghui Jiang 0001 |
Minimum-Perimeter Intersecting Polygons. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier |
Average Parameterization and Partial Kernelization for Computing Medians. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim von zur Gathen, Alfredo Viola, Konstantin Ziegler |
Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Qi Cheng 0001, Yu-Hsin Li |
Finding the Smallest Gap between Sums of Square Roots. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | René van Bevern, Hannes Moser, Rolf Niedermeier |
Kernelization through Tidying. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Cristopher Moore |
Continuous and Discrete Methods in Computer Science. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gero Greiner, Riko Jacob |
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hagai Cohen, Ely Porat |
Fast Set Intersection and Two-Patterns Matching. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Angel, Evripidis Bampis, Nicolas Thibault |
Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexis Ballier, Bruno Durand 0001, Emmanuel Jeandel |
Tilings Robust to Errors. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kunal Dutta, C. R. Subramanian 0001 |
Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Panario, Brett Stevens, Qiang Wang 0012 |
Ambiguity and Deficiency in Costas Arrays and APN Permutations. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Coury, Pavol Hell, Jan Kratochvíl, Tomás Vyskocil |
Faithful Representations of Graphs by Islands in the Extended Grid. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Diego Recalde, Cyriel Rutten, Petra Schuurman, Tjark Vredeveld |
Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédérique Bassino, Laura Giambruno, Cyril Nicaud |
Complexity of Operations on Cofinite Languages. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Emden R. Gansner, Yifan Hu 0001, Michael Kaufmann 0001, Stephen G. Kobourov |
Optimal Polygonal Representation of Planar Graphs. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Janusz A. Brzozowski, Galina Jirásková, Baiyu Li |
Quotient Complexity of Ideal Languages. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian |
Matching Points with Things. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità |
The Interval Constrained 3-Coloring Problem. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vahab S. Mirrokni, S. Muthukrishnan 0001, Uri Nadav |
Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Lombardy, Jacques Sakarovitch |
Radix Cross-Sections for Length Morphisms. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Fischer 0001 |
Optimal Succinctness for Range Minimum Queries. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk |
Sparse Recovery Using Sparse Random Matrices. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bettina Speckmann, Kevin Verbeek |
Homotopic Rectilinear Routing with Few Links and Thick Edges. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie G. Valiant |
Some Observations on Holographic Algorithms. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Petra Berenbrink, Robert Elsässer, Thomas Sauerwald |
Randomised Broadcasting: Memory vs. Randomness. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Fürer |
Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergio Rajsbaum |
Iterated Shared Memory Models. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul S. Bonsma, Felix Breuer |
Counting Hexagonal Patches and Independent Sets in Circle Graphs. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vonjy Rasendrahasina, Vlady Ravelomanana |
Limit Theorems for Random MAX-2-XORSAT. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan Backer, J. Mark Keil |
The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Viliam Geffert, Giovanni Pighizzini |
Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amalia Duch, Rosa M. Jiménez, Conrado Martínez |
Rank Selection in Multidimensional Data. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat |
Layered Working-Set Trees. |
LATIN |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rodrigo I. Silveira, Marc J. van Kreveld |
Optimal Higher Order Delaunay Triangulations of Polygons. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Chenyu Yan, Yang Xiang |
Collective Additive Tree Spanners of Homogeneously Orderable Graphs. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jurek Czyzowicz, Stefan Dobrev, Thomas Fevens, Hernán González-Aguilar, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia |
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
Location awareness, Local algorithm, Dominating set, Connected dominating set, Unit disk graph, Approximation factor |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license