Search results for "LATIN"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini 0001, Jan Arne Telle	On the Complexity of Reconstructing H -free Graphs from Their Star Systems.	LATIN	2008	DBLP DOI BibTeX RDF
1	Anupam Gupta 0001, Kunal Talwar	How to Complete a Doubling Metric.	LATIN	2008	DBLP DOI BibTeX RDF
1	Juraj Stacho	On 2-Subcolourings of Chordal Graphs.	LATIN	2008	DBLP DOI BibTeX RDF
1	Andreas Brandstädt, Christian Hundt 0001	Ptolemaic Graphs and Interval Graphs Are Leaf Powers.	LATIN	2008	DBLP DOI BibTeX RDF	and Classification Leaf powers, leaf roots, strongly chordal graphs, ptolemaic graphs, graph class inclusions, (unit) interval graphs, clique-width, graph powers
1	Luís M. S. Russo, Gonzalo Navarro 0001, Arlindo L. Oliveira	Fully-Compressed Suffix Trees.	LATIN	2008	DBLP DOI BibTeX RDF
1	Bruce A. Reed, Zhentao Li	Optimization and Recognition for K 5-minor Free Graphs in Linear Time.	LATIN	2008	DBLP DOI BibTeX RDF
1	Marshall W. Bern, Barry Hayes	Origami Embedding of Piecewise-Linear Two-Manifolds.	LATIN	2008	DBLP DOI BibTeX RDF
1	Pinar Heggernes, Dieter Kratsch, Daniel Meister 0001	Bandwidth of Bipartite Permutation Graphs in Polynomial Time.	LATIN	2008	DBLP DOI BibTeX RDF
1	Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte	On Dissemination Thresholds in Regular and Irregular Graph Classes.	LATIN	2008	DBLP DOI BibTeX RDF
1	Seok-Hee Hong 0001, Hiroshi Nagamochi	Approximating Crossing Minimization in Radial Layouts.	LATIN	2008	DBLP DOI BibTeX RDF
1	Kooshiar Azimian, Mario Szegedy	Parallel Repetition of the Odd Cycle Game.	LATIN	2008	DBLP DOI BibTeX RDF	two prover games, CHSH, parallel repetition
1	Spyros Angelopoulos 0001, Reza Dorrigiv, Alejandro López-Ortiz	List Update with Locality of Reference.	LATIN	2008	DBLP DOI BibTeX RDF
1	Joachim von zur Gathen, Igor E. Shparlinski	Approximate Polynomial gcd: Small Degree and Small Height Perturbations.	LATIN	2008	DBLP DOI BibTeX RDF	Euclidean algorithm, gcd, approximate computation
1	Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko	Approximating Minimum-Power Degree and Connectivity Problems.	LATIN	2008	DBLP DOI BibTeX RDF
1	Yoshifumi Inui, François Le Gall	Quantum Property Testing of Group Solvability.	LATIN	2008	DBLP DOI BibTeX RDF
1	Rodrigo González, Gonzalo Navarro 0001	Improved Dynamic Rank-Select Entropy-Bound Structures.	LATIN	2008	DBLP DOI BibTeX RDF
1	Leah Epstein, Rob van Stee	Maximizing the Minimum Load for Selfish Agents.	LATIN	2008	DBLP DOI BibTeX RDF
1	Andreas Maletti	Myhill-Nerode Theorem for Recognizable Tree Series Revisited.	LATIN	2008	DBLP DOI BibTeX RDF
1	Gérard Cornuéjols, François Margot	On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints.	LATIN	2008	DBLP DOI BibTeX RDF	intersection cut, group relaxation, integer programming
1	Richard Matthew McCutchen	The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences.	LATIN	2008	DBLP DOI BibTeX RDF	one-sided preferences, popular matching, algorithms, matching, NP-hardness, voting
1	Nikhil Bansal 0001, David P. Bunde, Ho-Leung Chan, Kirk Pruhs	Average Rate Speed Scaling.	LATIN	2008	DBLP DOI BibTeX RDF
1	Marcin Bienkowski, Aleksander Madry	Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers.	LATIN	2008	DBLP DOI BibTeX RDF	online algorithms, network problems, packet buffering
1	Yakov Nekrich	I/O-Efficient Point Location in a Set of Rectangles.	LATIN	2008	DBLP DOI BibTeX RDF
1	Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier	Fixed-Parameter Algorithms for Cluster Vertex Deletion.	LATIN	2008	DBLP DOI BibTeX RDF
1	Ali Akhavi, Damien Stehlé	Speeding-Up Lattice Reduction with Random Projections (Extended Abstract).	LATIN	2008	DBLP DOI BibTeX RDF
1	Andrzej Dudek, Vojtech Rödl	New Upper Bound on Vertex Folkman Numbers.	LATIN	2008	DBLP DOI BibTeX RDF	vertex Folkman numbers, Ramsey theory
1	Conrado Martínez, Lucia Moura, Daniel Panario, Brett Stevens	Algorithms to Locate Errors Using Covering Arrays.	LATIN	2008	DBLP DOI BibTeX RDF
1	Christine T. Cheng	The Generalized Median Stable Matchings: Finding Them Is Not That Easy.	LATIN	2008	DBLP DOI BibTeX RDF
1	Brian C. Dean, Adam Griffis, Adam A. Whitley	Approximation Algorithms for k-Hurdle Problems.	LATIN	2008	DBLP DOI BibTeX RDF
1	Stanislav Angelov, Keshav Kunal, Andrew McGregor 0001	Sorting and Selection with Random Costs.	LATIN	2008	DBLP DOI BibTeX RDF
1	Dominik Scheder	Guided Search and a Faster Deterministic Algorithm for 3-SAT.	LATIN	2008	DBLP DOI BibTeX RDF
1	Sergey Bereg, Minghui Jiang 0001, Wencheng Wang, Boting Yang, Binhai Zhu	Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance.	LATIN	2008	DBLP DOI BibTeX RDF
1	Paul S. Bonsma, Florian Zickfeld	Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms.	LATIN	2008	DBLP DOI BibTeX RDF
1	Rina Panigrahy	An Improved Algorithm Finding Nearest Neighbor Using Kd-trees.	LATIN	2008	DBLP DOI BibTeX RDF
1	Mario Alberto López, Yan Mayster	Weighted Rectilinear Approximation of Points in the Plane.	LATIN	2008	DBLP DOI BibTeX RDF
1	Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad	Paths and Trails in Edge-Colored Graphs.	LATIN	2008	DBLP DOI BibTeX RDF	properly edge-colored paths, trails and cycles, connectivity, Edge colored graphs
1	Imre Bárány, Attila Pór, Pavel Valtr 0001	Paths with no Small Angles.	LATIN	2008	DBLP DOI BibTeX RDF
1	Martin Hoefer 0001	Competitive Cost Sharing with Economies of Scale.	LATIN	2008	DBLP DOI BibTeX RDF
1	Evangelos Kranakis, Danny Krizanc, Pat Morin	Randomized Rendez-Vous with Limited Memory.	LATIN	2008	DBLP DOI BibTeX RDF
1	Hervé Daudé, Vlady Ravelomanana	Random 2-XORSAT at the Satisfiability Threshold.	LATIN	2008	DBLP DOI BibTeX RDF
1	Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky	Coloring Geometric Range Spaces.	LATIN	2008	DBLP DOI BibTeX RDF
1	GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski	Profile of Tries.	LATIN	2008	DBLP DOI BibTeX RDF
1	George Karakostas, Euripides Markou	Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes.	LATIN	2008	DBLP DOI BibTeX RDF
1	Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat Morin, Michiel H. M. Smid	Spanners of Complete k -Partite Geometric Graphs.	LATIN	2008	DBLP DOI BibTeX RDF
1	Amol Deshpande, Samir Khuller, Azarakhsh Malekian, Mohammed Toossi	Energy Efficient Monitoring in Sensor Networks.	LATIN	2008	DBLP DOI BibTeX RDF
1	Pavol Hell, André Raspaud, Juraj Stacho	On Injective Colourings of Chordal Graphs.	LATIN	2008	DBLP DOI BibTeX RDF
1	Christine Chung 0001, Kirk Pruhs, Patchrawat Uthaisombut	The Online Transportation Problem: On the Exponential Boost of One Extra Server.	LATIN	2008	DBLP DOI BibTeX RDF
1	Raphaël M. Jungers, Vladimir Protasov, Vincent D. Blondel	Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices.	LATIN	2008	DBLP DOI BibTeX RDF
1	Arvind Gupta, Pavol Hell, Mehdi Karimi 0001, Arash Rafiey	Minimum Cost Homomorphisms to Reflexive Digraphs.	LATIN	2008	DBLP DOI BibTeX RDF	minimum cost homomorphism, reflexive digraph, NP-completeness, polynomial time algorithm, homomorphism, dichotomy
1	Martin Fürer	Solving NP-Complete Problems with Quantum Search.	LATIN	2008	DBLP DOI BibTeX RDF
1	Zeev Nutov	Approximating Steiner Networks with Node Weights.	LATIN	2008	DBLP DOI BibTeX RDF
1	Cristina G. Fernandes, Carlos Eduardo Ferreira, Christian Tjandraatmadja, Yoshiko Wakabayashi	A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant.	LATIN	2008	DBLP DOI BibTeX RDF
1	Andrzej Lingas, Eva-Marta Lundell	Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs.	LATIN	2008	DBLP DOI BibTeX RDF
1	Gábor Ivanyos, Luc Sanselme, Miklos Santha	An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups.	LATIN	2008	DBLP DOI BibTeX RDF
1	Domingos Dellamonica Jr.	Simpler Constant-Seed Condensers.	LATIN	2008	DBLP DOI BibTeX RDF
1	Sergey A. Afonin	The View Selection Problem for Regular Path Queries.	LATIN	2008	DBLP DOI BibTeX RDF	view selection problem, semigroups of regular languages, regular path queries
1	Binh-Minh Bui-Xuan, Michel Habib	A Representation Theorem for Union-Difference Families and Application.	LATIN	2008	DBLP DOI BibTeX RDF
1	Mukul S. Bansal, Jianrong Dong, David Fernández-Baca	Comparing and Aggregating Partially Resolved Trees.	LATIN	2008	DBLP DOI BibTeX RDF
1	Thomas Erlebach, Erik Jan van Leeuwen	Domination in Geometric Intersection Graphs.	LATIN	2008	DBLP DOI BibTeX RDF
1	Elad Hazan	Sparse Approximate Solutions to Semidefinite Programs.	LATIN	2008	DBLP DOI BibTeX RDF
1	Regant Y. S. Hung, Hing-Fung Ting	Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream.	LATIN	2008	DBLP DOI BibTeX RDF
1	Baruch Awerbuch, Rohit Khandekar	Stateless Near Optimal Flow Control with Poly-logarithmic Convergence.	LATIN	2008	DBLP DOI BibTeX RDF
1	Igor E. Shparlinski	Pseudorandom Graphs from Elliptic Curves.	LATIN	2008	DBLP DOI BibTeX RDF	Pseudorandom graph, elliptic curve, exponential sum
1	Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin	On Stateless Multihead Automata: Hierarchies and the Emptiness Problem.	LATIN	2008	DBLP DOI BibTeX RDF
1	Igor E. Shparlinski, Arne Winterhof	Constructions of Approximately Mutually Unbiased Bases.	LATIN	2006	DBLP DOI BibTeX RDF
1	Laura Chaubard	C-Varieties, Actions and Wreath Product.	LATIN	2006	DBLP DOI BibTeX RDF
1	Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu	De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space).	LATIN	2006	DBLP DOI BibTeX RDF
1	Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid	Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.	LATIN	2006	DBLP DOI BibTeX RDF
1	Loïck Lhote, Brigitte Vallée	Sharp Estimates for the Main Parameters of the Euclid Algorithm.	LATIN	2006	DBLP DOI BibTeX RDF
1	Frank Neumann 0001, Marco Laumanns	Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization.	LATIN	2006	DBLP DOI BibTeX RDF
1	Corinna Cortes, Mehryar Mohri, Ashish Rastogi, Michael Riley 0001	Efficient Computation of the Relative Entropy of Probabilistic Automata.	LATIN	2006	DBLP DOI BibTeX RDF
1	Goran Konjevod, Andréa W. Richa, Donglin Xia	On Sampling in Higher-Dimensional Peer-to-Peer Systems.	LATIN	2006	DBLP DOI BibTeX RDF
1	Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier	Robust Model-Checking of Linear-Time Properties in Timed Automata.	LATIN	2006	DBLP DOI BibTeX RDF	robust verification, Implementability, timed systems
1	R. Ravi 0001	Matching Based Augmentations for Approximating Connectivity Problems.	LATIN	2006	DBLP DOI BibTeX RDF
1	Mariko Sakashita, Kazuhisa Makino, Satoru Fujishige	Minimum Cost Source Location Problems with Flow Requirements.	LATIN	2006	DBLP DOI BibTeX RDF
1	Herman J. Haverkort, Laura Toma	I/O-Efficient Algorithms on Near-Planar Graphs.	LATIN	2006	DBLP DOI BibTeX RDF
1	Eduardo Moreno 0001, Martín Matamala	Minimal Eulerian Circuit in a Labeled Digraph.	LATIN	2006	DBLP DOI BibTeX RDF
1	Gruia Calinescu, Adrian Dumitrescu, János Pach	Reconfigurations in Graphs and Grids.	LATIN	2006	DBLP DOI BibTeX RDF
1	Miklós Ajtai, Cynthia Dwork, Larry J. Stockmeyer	An Architecture for Provably Secure Computation.	LATIN	2006	DBLP DOI BibTeX RDF
1	Gabriele Di Stefano, Stefan Krause, Marco E. Lübbecke, Uwe T. Zimmermann	On Minimum k-Modal Partitions of Permutations.	LATIN	2006	DBLP DOI BibTeX RDF	monotone sequence, k-modal sequence, cocoloring, approximation algorithm, online algorithm, Mixed integer program, hardness, LP rounding
1	Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi	An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees.	LATIN	2006	DBLP DOI BibTeX RDF
1	Nuttapong Attrapadung, Yang Cui 0001, David Galindo, Goichiro Hanaoka, Ichiro Hasuo, Hideki Imai, Kanta Matsuura, Peng Yang 0002, Rui Zhang 0002	Relations Among Notions of Security for Identity Based Encryption Schemes.	LATIN	2006	DBLP DOI BibTeX RDF
1	Benjamín René Callejas Bedregal, Santiago Figueira	Classical Computability and Fuzzy Turing Machines.	LATIN	2006	DBLP DOI BibTeX RDF
1	Pierre Fraigniaud, Nicolas Nisse	Connected Treewidth and Connected Graph Searching.	LATIN	2006	DBLP DOI BibTeX RDF
1	Martin Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro	Lower Bounds for Clear Transmissions in Radio Networks.	LATIN	2006	DBLP DOI BibTeX RDF	Station selection, Wake up, Weak Sensor Model, ACM-class: F.2.2, Sensor network, Ad-hoc network, Lower bound, Broadcast, Dominating set, Leader election, Radio network, Maximal independent set, Contention resolution, Random geometric graphs
1	Avi Wigderson	The Power and Weakness of Randomness in Computation.	LATIN	2006	DBLP DOI BibTeX RDF
1	James King 0001	A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains.	LATIN	2006	DBLP DOI BibTeX RDF
1	Joachim Giesen, Eva Schuberth, Milos Stojakovic	Approximate Sorting.	LATIN	2006	DBLP DOI BibTeX RDF	Spearman’s footrule metric, Kendall’s tau metric, Ranking, Sorting
1	Nadia Pisanti, Alexandra M. Carvalho, Laurent Marsan, Marie-France Sagot	RISOTTO: Fast Extraction of Motifs with Mismatches.	LATIN	2006	DBLP DOI BibTeX RDF
1	Edgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia	Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges.	LATIN	2006	DBLP DOI BibTeX RDF
1	Hervé Fournier, Antoine Vigneron	Lower Bounds for Geometric Diameter Problems.	LATIN	2006	DBLP DOI BibTeX RDF	Hopcroft’s problem, Computational geometry, Lower bound, Diameter, Convex polytope
1	Vicky Choi, Navin Goyal	An Efficient Approximation Algorithm for Point Pattern Matching Under Noise.	LATIN	2006	DBLP DOI BibTeX RDF
1	Frederic Dorn, Jan Arne Telle	Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm.	LATIN	2006	DBLP DOI BibTeX RDF
1	Regant Y. S. Hung, Hing-Fung Ting	Design and Analysis of Online Batching Systems.	LATIN	2006	DBLP DOI BibTeX RDF
1	Nazim Fatès, Damien Regnault, Nicolas Schabanel, Eric Thierry	Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata.	LATIN	2006	DBLP DOI BibTeX RDF
1	Ferran Hurtado	Squares.	LATIN	2006	DBLP DOI BibTeX RDF
1	Ling Gai, Guochuan Zhang	Common Deadline Lazy Bureaucrat Scheduling Revisited.	LATIN	2006	DBLP DOI BibTeX RDF
1	Sandeep Dey, Nicolas Schabanel	Customized Newspaper Broadcast: Data Broadcast with Dependencies.	LATIN	2006	DBLP DOI BibTeX RDF
1	Mikael Hammar, Bengt J. Nilsson, Mia Persson	The Online Freeze-Tag Problem.	LATIN	2006	DBLP DOI BibTeX RDF
1	Orlando Lee, Aaron Williams	Packing Dicycle Covers in Planar Graphs with No K5-e Minor.	LATIN	2006	DBLP DOI BibTeX RDF

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