Conferences in DBLP
F. Frances Yao Algorithmic Problems in Wireless Ad Hoc Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Kousha Etessami , Mihalis Yannakakis Probability and Recursion. [Citation Graph (0, 0)][DBLP ] Conf ] Annette Ebbers-Baumann , Ansgar Grüne , Marek Karpinski , Rolf Klein , Christian Knauer , Andrzej Lingas Embedding Point Sets into Plane Graphs of Small Dilation. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaodong Wu , Danny Z. Chen , Kang Li , Milan Sonka The Layered Net Surface Problems in Discrete Geometry and Medical Image Segmentation. [Citation Graph (0, 0)][DBLP ] Conf ] Sariel Har-Peled , Vladlen Koltun Separability with Outliers. [Citation Graph (0, 0)][DBLP ] Conf ] Hee-Kap Ahn , Sang Won Bae , Siu-Wing Cheng , Kyung-Yong Chwa Casting an Object with a Core. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Mark de Berg , Otfried Cheong , Joachim Gudmundsson , Herman J. Haverkort , Antoine Vigneron Sparse Geometric Graphs with Small Dilation. [Citation Graph (0, 0)][DBLP ] Conf ] Mirela Tanase , Remco C. Veltkamp , Herman J. Haverkort Multiple Polyline to Polygon Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Mariko Sakashita , Kazuhisa Makino , Satoru Fujishige Minimizing a Monotone Concave Function with Laminar Covering Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Mingen Lin , Zhiyong Lin , Jinhui Xu Almost Optimal Solutions for Bin Coloring Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ying Xiao , Krishnaiyan Thulasiraman , Guoliang Xue GEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Khaled M. Elbassioni , Irit Katriel , Martin Kutz , Meena Mahajan Simultaneous Matchings. [Citation Graph (0, 0)][DBLP ] Conf ] Tsunehiko Kameda , Yi Sun , Luis A. Goddyn An Optimization Problem Related to VoD Broadcasting. [Citation Graph (0, 0)][DBLP ] Conf ] Xujin Chen , Guoli Ding , Xiaodong Hu , Wenan Zang A Min-Max Relation on Packing Feedback Vertex Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao , Xiang-Yang Li , Weizhao Wang Average Case Analysis for Tree Labelling Schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Binh-Minh Bui-Xuan , Michel Habib , Christophe Paul Revisiting T. Uno and M. Yagiura's Algorithm . [Citation Graph (0, 0)][DBLP ] Conf ] Leonid Khachiyan , Endre Boros , Konrad Borys , Khaled M. Elbassioni , Vladimir Gurvich , Kazuhisa Makino Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Xiao Zhou , Takao Nishizeki Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends. [Citation Graph (0, 0)][DBLP ] Conf ] Toshimasa Ishii , Kengo Iwata , Hiroshi Nagamochi Bisecting a Four-Connected Graph with Three Resource Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Ryuhei Uehara , Yushi Uno Laminar Structure of Ptolemaic Graphs and Its Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Zdenek Dvorak , Vít Jelínek On the Complexity of the G -Reconstruction Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Elkind , Helger Lipmaa Hybrid Voting Protocols and Hardness of Manipulation. [Citation Graph (0, 0)][DBLP ] Conf ] Zhixiang Chen , Bin Fu On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Paola Bonizzoni , Gianluca Della Vedova , Riccardo Dondi , Tao Jiang Correlation Clustering and Consensus Clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen , Hu Zhang An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Sebastian Seibert , Walter Unger A 1.5-Approximation of the Minimal Manhattan Network Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Müller-Hannemann , Anna Schulze Hardness and Approximation of Octilinear Steiner Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Akiko Suzuki , Takeshi Tokuyama Dense Subgraph Problems with Output-Density Conditions. [Citation Graph (0, 0)][DBLP ] Conf ] Yvo Desmedt , Yongge Wang , Mike Burmester A Complete Characterization of Tolerable Adversary Structures for Secure Point-to-Point Transmissions Without Feedback. [Citation Graph (0, 0)][DBLP ] Conf ] Marios Mavronicolas , Vicky G. Papadopoulou , Anna Philippou , Paul G. Spirakis Network Game with Attacker and Protector Entities. [Citation Graph (0, 0)][DBLP ] Conf ] Saeed Alaei , Mohammad Toossi , Mohammad Ghodsi SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Høyer The Phase Matrix. [Citation Graph (0, 0)][DBLP ] Conf ] Alexis C. Kaporis , Christos Makris , George Mavritsakis , Spyros Sioutas , Athanasios K. Tsakalidis , Kostas Tsichlas , Christos D. Zaroliagis ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Arge , Laura Toma External Data Structures for Shortest Path Queries on Planar Digraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Tak Wah Lam , Wing-Kin Sung , Swee-Seong Wong Improved Approximate String Matching Using Compressed Suffix Data Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Junyi Xie , Jun Yang , Hai Yu Monitoring Continuous Band-Join Queries over Dynamic Data. [Citation Graph (0, 0)][DBLP ] Conf ] Ying Kit Lai , Chung Keung Poon , Benyun Shi Approximate Colored Range Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Lan Liu , Xi Chen , Jing Xiao , Tao Jiang Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Lusheng Wang , Kaizhong Zhang Space Efficient Algorithms for Ordered Tree Comparison. [Citation Graph (0, 0)][DBLP ] Conf ] Yun Cui , Lusheng Wang , Daming Zhu A 1.75-Approximation Algorithm for Unsigned Translocation Distance. [Citation Graph (0, 0)][DBLP ] Conf ] Nguyen Bao Nguyen , C. Thach Nguyen , Wing-Kin Sung Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Hao Yuan , Linji Yang , Erdong Chen Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Yong He , Yiwei Jiang Preemptive Semi-online Scheduling on Parallel Machines with Inexact Partial Information. [Citation Graph (0, 0)][DBLP ] Conf ] Marc Demange , Bernard Kouakou , Éric Soutif On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Lean Yu , Shouyang Wang , Kin Keung Lai A Novel Adaptive Learning Algorithm for Stock Market Prediction. [Citation Graph (0, 0)][DBLP ] Conf ] Lei Yang Uniformization of Discrete Data. [Citation Graph (0, 0)][DBLP ] Conf ] Li-Sha Huang A Practical Algorithm for the Computation of Market Equilibrium with Logarithmic Utility Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Giesen , Dieter Mitsche Boosting Spectral Partitioning by Sampling and Iteration. [Citation Graph (0, 0)][DBLP ] Conf ] Bodo Manthey , Rüdiger Reischuk Smoothed Analysis of Binary Search Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Christoforos Raptopoulos , Paul G. Spirakis Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Sumit Ganguly Counting Distinct Items over Update Streams. [Citation Graph (0, 0)][DBLP ] Conf ] Tien-Ching Lin , D. T. Lee Randomized Algorithm for the Sum Selection Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Nehéz , Daniel Olejár An Improved Interval Routing Scheme for Almost All Networks Based on Dominating Cliques. [Citation Graph (0, 0)][DBLP ] Conf ] Ioannis Caragiannis , Clemente Galdi , Christos Kaklamanis Basic Computations in Wireless Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Sanguthevar Rajasekaran , Sandeep Sen A Simple Optimal Randomized Algorithm for Sorting on the PDM. [Citation Graph (0, 0)][DBLP ] Conf ] Yan Wang , Deqiang Wang , Wei Liu , Baoyu Tian Efficient Parallel Algorithms for Constructing a k -Tree Center and a k -Tree Core of a Tree Network. [Citation Graph (0, 0)][DBLP ] Conf ] Satoshi Fujita A Tight Bound on the Number of Mobile Servers to Guarantee the Mutual Transferability Among Dominating Configurations. [Citation Graph (0, 0)][DBLP ] Conf ] Fedor V. Fomin , Fabrizio Grandoni , Artem V. Pyatkin , Alexey A. Stepanov Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Feodor F. Dragan , Chenyu Yan Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Bodirsky , Clemens Gröpl , Mihyun Kang Sampling Unlabeled Biconnected Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Knauer , Étienne Schramm , Andreas Spillner , Alexander Wolff Configurations with Few Crossings in Topological Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Adrian Kosowski , Michal Malafiejski , Pawel Zylinski On Bounded Load Routings for Modeling k -Regular Connection Topologies. [Citation Graph (0, 0)][DBLP ] Conf ] Cristina Bazgan , Marek Karpinski On the Complexity of Global Constraint Satisfaction. [Citation Graph (0, 0)][DBLP ] Conf ] Carme Àlvarez , Joaquim Gabarró , Maria J. Serna Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees, . [Citation Graph (0, 0)][DBLP ] Conf ] Masaki Yamamoto An Improved O(1.234m )-Time Deterministic Algorithm for SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Porschen Solving Minimum Weight Exact Satisfiability in Time O (20.2441n ). [Citation Graph (0, 0)][DBLP ] Conf ] Wun-Tat Chan , Yong Zhang , Stanley P. Y. Fung , Deshi Ye , Hong Zhu Efficient Algorithms for Finding a Longest Common Increasing Subsequence. [Citation Graph (0, 0)][DBLP ] Conf ] Heiner Ackermann , Alantha Newman , Heiko Röglin , Berthold Vöcking Decision Making Based on Approximate and Smoothed Pareto Curves. [Citation Graph (0, 0)][DBLP ] Conf ] Federico Della Croce , Vangelis Th. Paschos Computing Optimal Solutions for the min 3-set covering Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Boaz Ben-Moshe , Binay K. Bhattacharya , Qiaosheng Shi Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Zeshan Peng Algorithms for Local Forest Similarity. [Citation Graph (0, 0)][DBLP ] Conf ] Anders Bergkvist , Peter Damaschke Fast Algorithms for Finding Disjoint Subsequences with Extremal Densities. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroki Arimura , Takeaki Uno A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence. [Citation Graph (0, 0)][DBLP ] Conf ] William Kennedy , Guohui Lin 5-th Phylogenetic Root Construction for Strictly Chordal Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Kenya Ueno Recursion Theoretic Operators for Function Complexity Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Ralf Klasing , Zvi Lotker , Alfredo Navarra , Stephane Perennes From Balls and Bins to Points and Vertices. [Citation Graph (0, 0)][DBLP ] Conf ] Pinyan Lu , Jialin Zhang , Chung Keung Poon , Jin-yi Cai Simulating Undirected st -Connectivity Algorithms on Uniform JAGs and NNJAGs. [Citation Graph (0, 0)][DBLP ] Conf ] Damien Woods Upper Bounds on the Computational Power of an Optical Model of Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Hassene Aissi , Cristina Bazgan , Daniel Vanderpooten Complexity of the Min-Max (Regret) Versions of Cut Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Chih-Huai Cheng , Kuan-Yu Chen , Wen-Chin Tien , Kun-Mao Chao Improved Algorithms for the k Maximum-Sums Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ioannis Caragiannis , Clemente Galdi , Christos Kaklamanis Network Load Games. [Citation Graph (0, 0)][DBLP ] Conf ] Jean Cardinal , Samuel Fiorini , Gwenaël Joret Minimum Entropy Coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Vilhelm Dahllöf Algorithms for Max Hamming Exact Satisfiability. [Citation Graph (0, 0)][DBLP ] Conf ] Spyros C. Kontogiannis , Paul G. Spirakis Counting Stable Strategies in Random Evolutionary Games. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Klein , Christian Knauer , Giri Narasimhan , Michiel H. M. Smid Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles. [Citation Graph (0, 0)][DBLP ] Conf ] Chris Worman , Boting Yang On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Joel Fenwick , Vladimir Estivill-Castro Optimal Paths for Mutually Visible Agents. [Citation Graph (0, 0)][DBLP ] Conf ] Hee-Kap Ahn , Otfried Cheong Stacking and Bundling Two Convex Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Gupta Algorithms for Range-Aggregate Query Problems Involving Geometric Aggregation Operations. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Shuichi Miyazaki , Naoya Yamauchi A (2-c*(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Michele Flammini , Luca Moscardelli , Mordechai Shalom , Shmuel Zaks Approximating the Traffic Grooming Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Liying Kang , T. C. Edwin Cheng , C. T. Ng , Min Zhao Scheduling to Minimize Makespan with Time-Dependent Processing Times. [Citation Graph (0, 0)][DBLP ] Conf ] Jérôme Monnot On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Sun-Yuan Hsieh , Ting-Yu Chou Finding a Weight-Constrained Maximum-Density Subtree in a Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Bing Yang , S. Q. Zheng , Enyue Lu Finding Two Disjoint Paths in a Network with Normalized alpha + -MIN-SUM Objective Function. [Citation Graph (0, 0)][DBLP ] Conf ] Seth Pettie Sensitivity Analysis of Minimum Spanning Trees in Sub-inverse-Ackermann Time. [Citation Graph (0, 0)][DBLP ] Conf ] Qingbo Cai , Vincenzo Liberatore Approximation Algorithms for Layered Multicast Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Magdalene Grantson , Christian Borgelt , Christos Levcopoulos Minimum Weight Triangulation by Cutting Out Triangles. [Citation Graph (0, 0)][DBLP ] Conf ] Bin Fu , Sorinel Adrian Oprisan , Lizhe Xu Multi-directional Width-Bounded Geometric Separator and Protein Folding. [Citation Graph (0, 0)][DBLP ] Conf ] Sang Won Bae , Kyung-Yong Chwa Shortest Paths and Voronoi Diagrams with Transportation Networks Under General Distances. [Citation Graph (0, 0)][DBLP ] Conf ] Oliver Klein , Remco C. Veltkamp Approximation Algorithms for Computing the Earth Mover's Distance Under Transformations. [Citation Graph (0, 0)][DBLP ] Conf ] Mingjun Song , Sanguthevar Rajasekaran Fast k-Means Algorithms with Constant Approximation. [Citation Graph (0, 0)][DBLP ] Conf ] Aleksei V. Fishkin , Olga Gerber , Klaus Jansen On Efficient Weighted Rectangle Packing with Large Resources. [Citation Graph (0, 0)][DBLP ] Conf ] Tamás Terlaky , Anthony Vannelli , Hu Zhang On Routing in VLSI Design and Communication Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew Lim , Fan Wang , Zhou Xu The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Cyril Gavoille , Olivier Ly Distance Labeling in Hyperbolic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Paraskevi Fragopoulou , Stavros D. Nikolopoulos , Leonidas Palios Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics. [Citation Graph (0, 0)][DBLP ] Conf ] Jianxi Fan , Xiaola Lin , Xiaohua Jia , Rynson W. H. Lau Edge-Pancyclicity of Twisted Cubes. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Eckhardt , Sven Kosub , Moritz G. Maaß , Hanjo Täubig , Sebastian Wernicke Combinatorial Network Abstraction by Trees and Distances. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Bachmaier , Ulrik Brandes , Barbara Schlieper Drawing Phylogenetic Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Fabrice Bazzaro , Cyril Gavoille Localized and Compact Data-Structure for Comparability Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Robin Nunkesser , Philipp Woelfel Representation of Graphs by OBDDs. [Citation Graph (0, 0)][DBLP ] Conf ] Diego Arroyuelo , Gonzalo Navarro Space-Efficient Construction of LZ-Index. [Citation Graph (0, 0)][DBLP ] Conf ] Erdong Chen , Hao Yuan , Linji Yang Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition. [Citation Graph (0, 0)][DBLP ] Conf ] David J. Abraham , Katarína Cechlárová , David Manlove , Kurt Mehlhorn Pareto Optimality in House Allocation Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen , Xiaobo Sharon Hu , Shuang (Sean) Luan , Shahid A. Naqvi , Chao Wang , Cedric X. Yu Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy. [Citation Graph (0, 0)][DBLP ] Conf ] 