Conferences in DBLP
Leslie G. Valiant Completeness for Parity Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Apostolico Monotony and Surprise. [Citation Graph (0, 0)][DBLP ] Conf ] Shang-Hua Teng Smoothed Analysis of Algorithms and Heuristics. [Citation Graph (0, 0)][DBLP ] Conf ] Shiquan Wu , Xun Gu Gene Network: Model, Dynamics and Simulation. [Citation Graph (0, 0)][DBLP ] Conf ] Guillaume Blin , Romeo Rizzi Conserved Interval Distance Computation Between Non-trivial Genomes. [Citation Graph (0, 0)][DBLP ] Conf ] Sergey Bereg , Binhai Zhu RNA Multiple Structural Alignment with Longest Common Subsequences. [Citation Graph (0, 0)][DBLP ] Conf ] Marie-France Sagot , Eric Tannier Perfect Sorting by Reversals. [Citation Graph (0, 0)][DBLP ] Conf ] Chunfang Zheng , David Sankoff Genome Rearrangements with Partially Ordered Chromosomes. [Citation Graph (0, 0)][DBLP ] Conf ] Tao Liu , Jijun Tang , Bernard M. E. Moret Quartet-Based Phylogeny Reconstruction from Gene Orders. [Citation Graph (0, 0)][DBLP ] Conf ] Jinsong Tan , Kok Seng Chua , Louxin Zhang Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Luay Nakhleh , Derek A. Ruths , Li-San Wang RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal Gene Transfer. [Citation Graph (0, 0)][DBLP ] Conf ] Hengwu Li , Daming Zhu A New Pseudoknots Folding Algorithm for RNA Structure Prediction. [Citation Graph (0, 0)][DBLP ] Conf ] Miklós Csürös , Bin Ma Rapid Homology Search with Two-Stage Extension and Daughter Seeds. [Citation Graph (0, 0)][DBLP ] Conf ] Vincent Berry , Sylvain Guillemot , François Nicolas , Christophe Paul On the Approximation of Computing Evolutionary Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Xiang-Yang Li , Peng-Jun Wan Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Zhipeng Cai , Guohui Lin , Guoliang Xue Improved Approximation Algorithms for the Capacitated Multicast Routing Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Jianyang Zeng , Wen-Jing Hsu , Suiping Zhou Construction of Scale-Free Networks with Partial Information. [Citation Graph (0, 0)][DBLP ] Conf ] Yvo Desmedt , Yongge Wang , Reihaneh Safavi-Naini , Huaxiong Wang Radio Networks with Reliable Communication. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Hoefer , Piotr Krysta Geometric Network Design with Selfish Agents. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Krysta Bicriteria Network Design via Iterative Rounding. [Citation Graph (0, 0)][DBLP ] Conf ] Fabian Kuhn , Pascal von Rickenbach , Roger Wattenhofer , Emo Welzl , Aaron Zollinger Interference in Cellular Networks: The Minimum Membership Set Cover Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Xujin Chen , Xiao-Dong Hu , Tianping Shuai Routing and Coloring for Maximal Number of Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Weizhao Wang , Xiang-Yang Li , Zheng Sun Share the Multicast Payment Fairly. [Citation Graph (0, 0)][DBLP ] Conf ] Jianping Li , Kang Li , Ken C. K. Law , Hao Zhao On Packing and Coloring Hyperedges in a Cycle. [Citation Graph (0, 0)][DBLP ] Conf ] Hai Liu , Peng-Jun Wan , Xiaohua Jia Fault-Tolerant Relay Node Placement in Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Hirotaka Ono , Yen Kaow Ng Best Fitting Fixed-Length Substring Patterns for a Set of Strings. [Citation Graph (0, 0)][DBLP ] Conf ] Saverio Caminiti , Rossella Petreschi String Coding of Trees with Locality and Heritability. [Citation Graph (0, 0)][DBLP ] Conf ] David Liben-Nowell , Erik Vee , An Zhu Finding Longest Increasing and Common Subsequences in Streaming Data. [Citation Graph (0, 0)][DBLP ] Conf ] Joong Chae Na , Raffaele Giancarlo , Kunsoo Park O(n2 log n) Time On-Line Construction of Two-Dimensional Suffix Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Minming Li , Becky Jie Liu , Frances F. Yao Min-Energy Voltage Allocation for Tree-Structured Tasks. [Citation Graph (0, 0)][DBLP ] Conf ] Zhiyi Tan , Yong He Semi-online Problems on Identical Machines with Inexact Partial Information. [Citation Graph (0, 0)][DBLP ] Conf ] Fabien Baille , Evripidis Bampis , Christian Laforest , Nicolas Thibault On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules. [Citation Graph (0, 0)][DBLP ] Conf ] Wun-Tat Chan , Francis Y. L. Chin , Yong Zhang , Hong Zhu , Hong Shen , Prudence W. H. Wong Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Fan R. K. Chung , Ronald L. Graham , Jia Mao , Andrew Chi-Chih Yao Oblivious and Adaptive Strategies for the Majority and Plurality Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Jin-yi Cai , Venkatesan T. Chakaravarthy A Note on Zero Error Algorithms Having Oracle Access to One NP Query. [Citation Graph (0, 0)][DBLP ] Conf ] Ker-I Ko , Fuxiang Yu On the Complexity of Computing the Logarithm and Square Root Functions on a Complex Domain. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Rettinger , Xizhong Zheng Solovay Reducibility on D-c.e Real Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Fábio Viduani Martinez , José Coelho de Pina , José Soares Algorithms for Terminal Steiner Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Parinya Chalermsook , Jittat Fakcharoenphol Simple Distributed Algorithms for Approximating Minimum Steiner Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Luciano Gualà , Guido Proietti A Truthful (2-2/k )-Approximation Mechanism for the Steiner Tree Problem with k Terminals. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Bachmaier , Florian Fischer , Michael Forster Radial Coordinate Assignment for Level Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Guowu Yang , Xiaoyu Song , Hannah Honghua Yang , Fei Xie A Theoretical Upper Bound for IP-Based Floorplanning. [Citation Graph (0, 0)][DBLP ] Conf ] Sean Hallgren , Alexander Russell , Igor Shparlinski Quantum Noisy Rational Function Reconstruction. [Citation Graph (0, 0)][DBLP ] Conf ] Shengyu Zhang Promised and Distributed Quantum Search. [Citation Graph (0, 0)][DBLP ] Conf ] Fabien Viger , Matthieu Latapy Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence. [Citation Graph (0, 0)][DBLP ] Conf ] Beatrice List , Markus Maucher , Uwe Schöning , Rainer Schuler Randomized Quicksort and the Entropy of the Random Source. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Sankowski Subquadratic Algorithm for Dynamic Shortest Distances. [Citation Graph (0, 0)][DBLP ] Conf ] Q. Ding , J. Qian , W. Tsang , C. Wang Randomly Generating Triangulations of a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Yin-Feng Xu , Wenqiang Dai , Naoki Katoh , Makoto Ohsaki Triangulating a Convex Polygon with Small Number of Non-standard Bars. [Citation Graph (0, 0)][DBLP ] Conf ] Zhixiang Chen , Bin Fu , Yong Tang , Binhai Zhu A PTAS for a Disc Covering Problem Using Width-Bounded Separators. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaodong Wu Efficient Algorithms for Intensity Map Splitting Problems in Radiation Therapy. [Citation Graph (0, 0)][DBLP ] Conf ] Hanno Lefmann Distributions of Points in d Dimensions and Large k -Point Simplices. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Icking , Thomas Kamphans , Rolf Klein , Elmar Langetepe Exploring Simple Grid Polygons. [Citation Graph (0, 0)][DBLP ] Conf ] Xuehou Tan Approximation Algorithms for Cutting Out Polygons with Lines and Rays. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Gupta , Ravi Janardan , Michiel H. M. Smid Efficient Non-intersection Queries on Aggregated Geometric Data. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Ackerman , Gill Barequet , Ron Y. Pinter An Upper Bound on the Number of Rectangulations of a Point Set. [Citation Graph (0, 0)][DBLP ] Conf ] Chung Keung Poon , Wai Keung Yiu Opportunistic Data Structures for Range Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Ruskey , Aaron Williams Generating Combinations by Prefix Shifts. [Citation Graph (0, 0)][DBLP ] Conf ] An Braeken , Ventzislav Nikov , Svetla Nikova Error-Set Codes and Related Objects. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaotie Deng , Li-Sha Huang , Minming Li On Walrasian Price of CPU Time. [Citation Graph (0, 0)][DBLP ] Conf ] Spyros Angelopoulos , Atish Das Sarma , Avner Magen , Anastasios Viglas On-Line Algorithms for Market Equilibria. [Citation Graph (0, 0)][DBLP ] Conf ] Anshul Kothari , Subhash Suri , Yunhong Zhou Interval Subset Sum and Uniform-Price Auction Clearing. [Citation Graph (0, 0)][DBLP ] Conf ] Sung Eun Bae , Tadao Takaoka Improved Algorithms for the K -Maximum Subarray Problem for Small K . [Citation Graph (0, 0)][DBLP ] Conf ] Kamalika Chaudhuri , Anshul Kothari , Rudi Pendavingh , Ram Swaminathan , Robert Endre Tarjan , Yunhong Zhou Server Allocation Algorithms for Tiered Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Guang Xu , Jinhui Xu An Improved Approximation Algorithm for Uncapacitated Facility Location Problem with Penalties. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Chrobak , Claire Kenyon , Neal E. Young The Reverse Greedy Algorithm for the Metric K -Median Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Guoxuan Ma , Jiming Peng , Yu Wei On Approximate Balanced Bi-clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Tao-Ming Wang Toroidal Grids Are Anti-magic. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaomin Chen , Mario Szegedy , Lei Wang Optimally Balanced Forward Degree Sequence. [Citation Graph (0, 0)][DBLP ] Conf ] Chandan K. Dubey , Shashank K. Mehta , Jitender S. Deogun Conditionally Critical Indecomposable Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jean Cardinal , Martine Labbé , Stefan Langerman , Eythan Levy , Hadrien Mélot A Tight Analysis of the Maximal Matching Heuristic. [Citation Graph (0, 0)][DBLP ] Conf ] Hossein Jowhari , Mohammad Ghodsi New Streaming Algorithms for Counting Triangles in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] W. Henry Suters , Faisal N. Abu-Khzam , Yun Zhang , Christopher T. Symons , Nagiza F. Samatova , Michael A. Langston A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Allulli , Giorgio Ausiello , Luigi Laura On the Power of Lookahead in On-Line Vehicle Routing Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ewa Misiolek , Danny Z. Chen Efficient Algorithms for Simplifying Flow Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Takuro Fukunaga , Hiroshi Nagamochi Approximation Algorithms for the b -Edge Dominating Set Problem and Its Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Dom , Jiong Guo , Rolf Niedermeier Bounded Degree Closest k -Tree Power Is NP-Complete. [Citation Graph (0, 0)][DBLP ] Conf ] Leonid Khachiyan , Endre Boros , Khaled M. Elbassioni , Vladimir Gurvich A New Algorithm for the Hypergraph Transversal Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Domingo Gómez , Jaime Gutierrez , Álvar Ibeas , Carmen Martínez , Ramón Beivide On Finding a Shortest Path in Circulant Graphs with Two Jumps. [Citation Graph (0, 0)][DBLP ] Conf ] Wen-Lian Hsu A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Takehiro Ito , Akira Kato , Xiao Zhou , Takao Nishizeki Algorithms for Finding Distance-Edge-Colorings of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Maw-Shang Chang , Ton Kloks , Dieter Kratsch , Jiping Liu , Sheng-Lung Peng On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Chung-Shou Liao , Der-Tsai Lee Power Domination Problem in Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Cristina Bazgan , Zsolt Tuza , Daniel Vanderpooten Complexity and Approximation of Satisfactory Partition Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Fabrizio Grandoni , Jochen Könemann , Alessandro Panconesi Distributed Weighted Vertex Cover via Maximal Matchings. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Kára , Jan Kratochvíl , David R. Wood On the Complexity of the Balanced Vertex Ordering Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Frank K. H. A. Dehne , Michael R. Fellows , Michael A. Langston , Frances A. Rosamond , Kim Stevens An O(2O(k) n3 ) FPT Algorithm for the Undirected Feedback Vertex Set Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Guantao Chen , Zhicheng Gao , Xingxing Yu , Wenan Zang Approximating the Longest Cycle Problem on Graphs with Bounded Degree. [Citation Graph (0, 0)][DBLP ] Conf ] Yong He , György Dósa Bin Packing and Covering Problems with Rejection. [Citation Graph (0, 0)][DBLP ] Conf ] Lane A. Hemaspaandra , Mayur Thakur Query-Monotonic Turing Reductions. [Citation Graph (0, 0)][DBLP ] Conf ] Oscar H. Ibarra , Sara Woodworth , Hsu-Chun Yen , Zhe Dang On Sequential and 1-Deterministic P Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaofei Huang Global Optimality Conditions and Near-Perfect Optimization in Coding. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Kutz , Attila Pór Angel, Devil, and King. [Citation Graph (0, 0)][DBLP ] Conf ] Ferdinando Cicalese , Peter Damaschke , Libertad Tansini , Sören Werth Overlaps Help: Improved Bounds for Group Testing with Interval Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Eun-Jun Yoon , Kee-Young Yoo New Efficient Simple Authenticated Key Agreement Protocol. [Citation Graph (0, 0)][DBLP ] Conf ] Zhixiang Chen , Bin Fu A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Sebastian Böcker , Zsuzsanna Lipták The Money Changing Problem Revisited: Computing the Frobenius Number in Time O(k a1 ). [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen , Xiuzhen Huang , Iyad A. Kanj , Ge Xia W -Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications.Citation Graph (0, 0)][DBLP ] Conf ] Xiao-guang Yang , Jian-zhong Zhang Some New Results on Inverse Sorting Problems. [Citation Graph (0, 0)][DBLP ] Conf ] 