The SCEAS System
Navigation Menu

Conferences in DBLP

International Symposium on Algorithms and Computation (ISAAC) (isaac)
2004 (conf/isaac/2004)

  1. Erik D. Demaine
    Puzzles, Art, and Magic with Algorithms. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:1- [Conf]
  2. David M. Mount
    The ABCs of AVDs: Geometric Retrieval Made Simple. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:2- [Conf]
  3. David J. Abraham, Katarína Cechlárová, David Manlove, Kurt Mehlhorn
    Pareto Optimality in House Allocation Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:3-15 [Conf]
  4. Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu
    Property-Preserving Data Reconstruction. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:16-27 [Conf]
  5. Kazuyuki Amano, Akira Maruoka
    On the Monotone Circuit Complexity of Quadratic Boolean Functions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:28-40 [Conf]
  6. Amihood Amir, Igor Nor
    Generalized Function Matching. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:41-52 [Conf]
  7. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos
    Approximate Distance Oracles for Graphs with Dense Clusters. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:53-64 [Conf]
  8. Amitai Armon, Uri Zwick
    Multicriteria Global Minimum Cuts. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:65-76 [Conf]
  9. Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama
    Polyline Fitting of Planar Points Under Min-sum Criteria. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:77-88 [Conf]
  10. Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas C. Nandy, Shinji Sasahara, Takeaki Uno
    A Generalization of Magic Squares with Applications to Digital Halftoning. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:89-100 [Conf]
  11. Sang Won Bae, Kyung-Yong Chwa
    Voronoi Diagrams with a Transportation Network on the Euclidean Plane. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:101-112 [Conf]
  12. Markus Bauer, Gunnar W. Klau
    Structural Alignment of Two RNA Sequences with Lagrangian Relaxation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:113-123 [Conf]
  13. Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos
    Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:124-136 [Conf]
  14. Fredrik Bengtsson, Jingsen Chen
    Efficient Algorithms for k Maximum Sums. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:137-148 [Conf]
  15. Sergey Bereg
    Equipartitions of Measures by 2-Fans. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:149-158 [Conf]
  16. Davide Bilò, Guido Proietti
    Augmenting the Edge-Connectivity of a Spider Tree. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:159-171 [Conf]
  17. Vittorio Bilò, Michele Flammini, Giovanna Melideo, Luca Moscardelli
    On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:172-183 [Conf]
  18. Ulrik Brandes, Jürgen Lerner
    Structural Similarity in Graphs (A Relaxation Approach for Role Assignment). [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:184-195 [Conf]
  19. Marcus Brazil, Pawel Winter, Martin Zachariasen
    Flexibility of Steiner Trees in Uniform Orientation Metrics. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:196-208 [Conf]
  20. Jin-yi Cai, Osamu Watanabe
    Random Access to Advice Strings and Collapsing Results. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:209-220 [Conf]
  21. Gruia Calinescu
    Bounding the Payment of Approximate Truthful Mechanisms. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:221-233 [Conf]
  22. Gruia Calinescu, Alexander Zelikovsky
    The Polymatroid Steiner Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:234-245 [Conf]
  23. Timothy M. Chan, Bashir S. Sadjad
    Geometric Optimization Problems Over Sliding Windows. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:246-258 [Conf]
  24. Wun-Tat Chan, Prudence W. H. Wong
    On-Line Windows Scheduling of Temporary Items. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:259-270 [Conf]
  25. Danny Z. Chen, Xiaobo Sharon Hu, Shuang Luan, Shahid A. Naqvi, Chao Wang, Cedric X. Yu
    Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:271-281 [Conf]
  26. Hsin-Fu Chen, Maw-Shang Chang
    An Efficient Exact Algorithm for the Minimum Ultrametric Tree Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:282-293 [Conf]
  27. Kuan-Yu Chen, Kun-Mao Chao
    On the Range Maximum-Sum Segment Query Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:294-305 [Conf]
  28. Xujin Chen, Wenan Zang
    An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:306-317 [Conf]
  29. Zhenming Chen, Vikas Singh, Jinhui Xu
    Efficient Job Scheduling Algorithms with Multi-type Contentions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:318-329 [Conf]
  30. Chao Chen, Ho-Lun Cheng
    Superimposing Voronoi Complexes for Shape Deformation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:330-341 [Conf]
  31. Qi Cheng, Ming-Deh A. Huang
    On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:342-351 [Conf]
  32. Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, René van Oostrum, Chan-Su Shin
    Guarding Art Galleries by Guarding Witnesses. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:352-363 [Conf]
  33. Ho-Kwok Dai, Hung-Chi Su
    On p-Norm Based Locality Measures of Space-Filling Curves. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:364-376 [Conf]
  34. Zhe Dang, Oscar H. Ibarra, Jianwen Su
    Composability of Infinite-State Activity Automata. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:377-388 [Conf]
  35. Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier
    Error Compensation in Leaf Root Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:389-401 [Conf]
  36. Feodor F. Dragan, Irina Lomonosov
    On Compact and Efficient Routing in Certain Graph Classes. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:402-414 [Conf]
  37. Amalia Duch
    Randomized Insertion and Deletion in Point Quad Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:415-426 [Conf]
  38. Bin Fu, Richard Beigel
    Diagnosis in the Presence of Intermittent Faults. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:427-441 [Conf]
  39. Satoshi Fujita, Toru Araki
    Three-Round Adaptive Diagnosis in Binary n-Cubes. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:442-451 [Conf]
  40. Daiji Fukagawa, Tatsuya Akutsu
    Fast Algorithms for Comparison of Similar Unordered Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:452-463 [Conf]
  41. Joachim von zur Gathen, Igor Shparlinski
    GCD of Random Linear Forms. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:464-469 [Conf]
  42. Andreas Goerdt, André Lanka
    On the Hardness and Easiness of Random 4-SAT Formulas. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:470-483 [Conf]
  43. Avraham Goldstein, Petr Kolman, Jie Zheng
    Minimum Common String Partition Problem: Hardness and Approximations. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:484-495 [Conf]
  44. Darin Goldstein, Kojiro Kobayashi
    On the Complexity of Network Synchronization. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:496-507 [Conf]
  45. Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang
    Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:508-521 [Conf]
  46. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth
    Adaptive Spatial Partitioning for Multidimensional Data Streams. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:522-533 [Conf]
  47. Peter Hui, Marcus Schaefer
    Paired Pointset Traversal. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:534-544 [Conf]
  48. Kazuo Iwama, Akinori Kawachi
    Approximated Two Choices in Randomized Load Balancing. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:545-557 [Conf]
  49. Joseph JáJá, Christian Worm Mortensen, Qingmin Shi
    Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:558-568 [Conf]
  50. Jesper Jansson, Ngo Trung Hieu, Wing-Kin Sung
    Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:569-580 [Conf]
  51. Jesper Jansson, Wing-Kin Sung
    The Maximum Agreement of Two Nested Phylogenetic Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:581-593 [Conf]
  52. Jerzy W. Jaromczyk, Zbigniew Lonc
    Sequences of Radius k: How to Fetch Many Huge Objects into Small Memory for Pairwise Computations. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:594-605 [Conf]
  53. Minghui Jiang, Sergey Bereg, Zhongping Qin, Binhai Zhu
    New Bounds on Map Labeling with Circular Labels. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:606-617 [Conf]
  54. Jae-Hoon Kim
    Optimal Buffer Management via Resource Augmentation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:618-628 [Conf]
  55. Egon Wanke, Rolf Kötter
    Oriented Paths in Mixed Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:629-643 [Conf]
  56. Dariusz R. Kowalski, Andrzej Pelc
    Polynomial Deterministic Rendezvous in Arbitrary Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:644-656 [Conf]
  57. Hanno Lefmann
    Distributions of Points and Large Quadrangles. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:657-668 [Conf]
  58. Ovidiu Daescu, Jun Luo
    Cutting Out Polygons with Lines and Rays. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:669-680 [Conf]
  59. Veli Mäkinen, Gonzalo Navarro, Kunihiko Sadakane
    Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:681-692 [Conf]
  60. Kazuyuki Miura, Hiroki Haga, Takao Nishizeki
    Inner Rectangular Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:693-704 [Conf]
  61. Hiroshi Nagamochi, Taizo Kawada
    Approximating the Minmax Subtree Cover Problem in a Cactus. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:705-716 [Conf]
  62. Richard J. Nowakowski, Norbert Zeh
    Boundary-Optimal Triangulation Flooding. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:717-728 [Conf]
  63. Timo von Oertzen
    Exact Computation of Polynomial Zeros Expressible by Square Roots. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:729-741 [Conf]
  64. Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim
    Many-to-many Disjoint Path Covers in a Graph with Faulty Elements. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:742-753 [Conf]
  65. Zeshan Peng, Hing-Fung Ting
    An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:754-765 [Conf]
  66. Artur Alves Pessoa
    Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:766-777 [Conf]
  67. Artur Alves Pessoa, Eduardo Sany Laber, Críston de Souza
    Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:778-792 [Conf]
  68. Marcus Raitner
    Dynamic Tree Cross Products. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:793-804 [Conf]
  69. Christian Schindelhauer, Klaus Volbert, Martin Ziegler
    Spanners, Weak Spanners, and Power Spanners for Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:805-821 [Conf]
  70. Qingmin Shi, Joseph JáJá
    Techniques for Indexing and Querying Temporal Observations for a Collection of Objects. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:822-834 [Conf]
  71. Jinsong Tan, Louxin Zhang
    Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:835-846 [Conf]
  72. Xuehou Tan
    The Two-Guard Problem Revisited and Its Generalization. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:847-858 [Conf]
  73. Ryuhei Uehara
    Canonical Data Structure for Interval Probe Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:859-870 [Conf]
  74. Ryuhei Uehara, Yushi Uno
    Efficient Algorithms for the Longest Path Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:871-883 [Conf]
  75. Lusheng Wang, Liang Dong, Hui Fan
    Randomized Algorithms for Motif Detection. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:884-895 [Conf]
  76. Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier
    Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:896-907 [Conf]
  77. Boting Yang, Danny Dyer, Brian Alspach
    Sweeping Graphs with Large Clique Number. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:908-920 [Conf]
  78. Uri Zwick
    A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:921-932 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002