Conferences in DBLP
Srinivas Aluru The Combinatorics of Sequencing the Corn Genome. [Citation Graph (0, 0)][DBLP ] Conf ] Francis Y. L. Chin Online Frequency Assignment in Wireless Communication Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Ming Li Information Distance from a Question to an Answer. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen , Mark A. Healy , Chao Wang , Xiaodong Wu A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy. [Citation Graph (0, 0)][DBLP ] Conf ] Yufeng Wu , Dan Gusfield A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Eudes Duchesne , Mathieu Giraud , Nadia El-Mabrouk Seed-Based Exclusion Method for Non-coding RNA Gene Search. [Citation Graph (0, 0)][DBLP ] Conf ] Lei Xin , Bin Ma , Kaizhong Zhang A New Quartet Approach for Reconstructing Phylogenetic Trees: Quartet Joining Method. [Citation Graph (0, 0)][DBLP ] Conf ] Dan Gusfield , Yelena Frid , Dan Brown Integer Programming Formulations and Computations Solving Phylogenetic and Population Genetic Problems with Missing or Genotypic Data. [Citation Graph (0, 0)][DBLP ] Conf ] Fedor V. Fomin , Serge Gaspers , Saket Saurabh Improved Exact Algorithms for Counting 3- and 4-Colorings. [Citation Graph (0, 0)][DBLP ] Conf ] Benny Chor , Michael R. Fellows , Mark A. Ragan , Igor Razgon , Frances A. Rosamond , Sagi Snir Connected Coloring Completion for General Graphs: Algorithms and Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Hans L. Bodlaender , Michael R. Fellows , Michael A. Langston , Mark A. Ragan , Frances A. Rosamond , Mark Weyer Quadratic Kernelization for Convex Recoloring of Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Kevin Buchin , Christian Knauer , Klaus Kriegel , André Schulz , Raimund Seidel On the Number of Cycles in Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Takuya Nakashima An Improved Exact Algorithm for Cubic Graph TSP. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Kratochvíl , Martin Pergel Geometric Intersection Graphs: Do Short Cycles Help? [Citation Graph (0, 0)][DBLP ] Conf ] Ryan C. Harkins , John M. Hitchcock Dimension, Halfspaces, and the Density of Hard Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Komusiewicz , Falk Hüffner , Hannes Moser , Rolf Niedermeier Isolation Concepts for Enumerating Dense Subgraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Ledergerber , Christophe Dessimoz Alignments with Non-overlapping Moves, Inversions and Tandem Duplications in O ( n 4 ) Time. [Citation Graph (0, 0)][DBLP ] Conf ] Fedor V. Fomin , Alexey A. Stepanov Counting Minimum Weighted Dominating Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Stanley P. Y. Fung , Chung Keung Poon , Feifeng Zheng Online Interval Scheduling: Randomized and Multiprocessor Cases. [Citation Graph (0, 0)][DBLP ] Conf ] George Christodoulou , Laurent Gourvès , Fanny Pascual Scheduling Selfish Tasks: About the Performance of Truthful Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Sheng Liu , Jian Zhang , Binhai Zhu Volume Computation Using a Direct Monte Carlo Method. [Citation Graph (0, 0)][DBLP ] Conf ] Chiranjeeb Buragohain , Subhash Suri , Csaba D. Tóth , Yunhong Zhou Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Endre Boros , Konrad Borys , Khaled M. Elbassioni , Vladimir Gurvich , Kazuhisa Makino , Gábor Rudolf Generating Minimal k-Vertex Connected Spanning Subgraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen , Ewa Misiolek Finding Many Optimal Paths Without Growing Any Optimal Path Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Naoki Katoh , Shin-ichi Tanigawa Enumerating Constrained Non-crossing Geometric Spanning Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrik Brandes , Cesim Erten , J. Fowler , Fabrizio Frati , Markus Geyer , Carsten Gutwenger , S. Hong , Michael Kaufmann , Stephen G. Kobourov , Giuseppe Liotta , Petra Mutzel , Antonios Symvonis Colored Simultaneous Geometric Embeddings. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaotie Deng , Kazuo Iwama , Qi Qi , Aries Wei Sun , Toyotaka Tasaka Properties of Symmetric Incentive Compatible Auctions. [Citation Graph (0, 0)][DBLP ] Conf ] Kristoffer Arnsfelt Hansen , Peter Bro Miltersen , Troels Bjerre Sørensen Finding Equilibria in Games of No Chance. [Citation Graph (0, 0)][DBLP ] Conf ] Ching-Lueh Chang , Yuh-Dauh Lyuu Efficient Testing of Forecasts. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Arpe , Rüdiger Reischuk When Does Greedy Learning of Relevant Attributes Succeed? [Citation Graph (0, 0)][DBLP ] Conf ] Christian Glaßer , Alan L. Selman , Liyu Zhang The Informational Content of Canonical Disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP ] Conf ] Fuxiang Yu On the Representations of NC and Log-Space Real Numbers. [Citation Graph (0, 0)][DBLP ] Conf ] Xizhong Zheng Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals. [Citation Graph (0, 0)][DBLP ] Conf ] Shengyu Zhang Streaming Algorithms Measured in Terms of the Computed Quantity. [Citation Graph (0, 0)][DBLP ] Conf ] Yunlong Liu , Jianer Chen , Jianxin Wang A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Apostolico , Claudia Tagliacollo Optimal Offline Extraction of Irredundant Motif Bases. [Citation Graph (0, 0)][DBLP ] Conf ] Hovhannes A. Harutyunyan , Edward Maraachlian Linear Algorithm for Broadcasting in Unicyclic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Hamid Zarrabi-Zadeh , Timothy M. Chan An Improved Algorithm for Online Unit Clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Shai Gutner Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Pinar Heggernes , Charis Papadopoulos Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. [Citation Graph (0, 0)][DBLP ] Conf ] Alessandro Ferrante , Gopal Pandurangan , Kihong Park On the Hardness of Optimization in Power Law Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Asaf Shapira , Uri Stav Can a Graph Have Distinct Regular Partitions? [Citation Graph (0, 0)][DBLP ] Conf ] Qizhi Fang , Rudolf Fleischer , Jian Li , Xiaoxun Sun Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games. [Citation Graph (0, 0)][DBLP ] Conf ] Kristoffer Arnsfelt Hansen Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates. [Citation Graph (0, 0)][DBLP ] Conf ] Peyman Afshani , Ehsan Chiniforooshan , Reza Dorrigiv , Arash Farzan , Mehdi Mirzazadeh , Narges Simjour , Hamid Zarrabi-Zadeh On the Complexity of Finding an Unknown Cut Via Vertex Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Maurice J. Jansen , Kenneth W. Regan "Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Shihyen Chen , Kaizhong Zhang An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity. [Citation Graph (0, 0)][DBLP ] Conf ] Lusheng Wang , Zhanyong Wang , Zhi-Zhong Chen Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. [Citation Graph (0, 0)][DBLP ] Conf ] Yuli Ye , Allan Borodin Priority Algorithms for the Subset-Sum Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej Czygrinow , Michal Hanckowiak Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families. [Citation Graph (0, 0)][DBLP ] Conf ] Francis Y. L. Chin , Yong Zhang , Hong Zhu A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen , Songjian Lu Improved Algorithms for Weighted and Unweighted Set Splitting Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Robert W. Irving , David Manlove An 8/5-Approximation Algorithm for a Hard Variant of Stable Marriage. [Citation Graph (0, 0)][DBLP ] Conf ] Binay K. Bhattacharya , Yuzhuang Hu , Alexander Kononov Approximation Algorithms for the Black and White Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP ] Conf ] 