新規登録 | ログイン | FAQ      [?] 

Algorithmica

最近発刊の雑誌の目次より: Algorithmica © Springer
  • Foreword from the Guest Editors
    Algorithmica, Vol. 52, No. 2. (October 2008), pp. 113-113.
    by Chen, Jianer, Kanj, Iyad
  • Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection
    Algorithmica, Vol. 52, No. 2. (October 2008), pp. 114-132.
    by Huffner, Falk, Wernicke, Sebastian, Zichner, Thomas
  • Fixed-Parameter Complexity of Minimum Profile Problems
    Algorithmica, Vol. 52, No. 2. (October 2008), pp. 133-152.
    by Gutin, Gregory, Szeider, Stefan, Yeo, Anders
  • Solving Connected Dominating Set Faster than 2 n
    Algorithmica, Vol. 52, No. 2. (October 2008), pp. 153-166.
    by Fomin, Fedor, Grandoni, Fabrizio, Kratsch, Dieter
  • Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
    Algorithmica, Vol. 52, No. 2. (October 2008), pp. 167-176.
    by Fellows, , Knauer, , Nishimura, , Ragde, , Rosamond, , Stege, , Thilikos, , Whitesides,
  • Improved Algorithms and Complexity Results for Power Domination in Graphs
    Algorithmica
    by Jiong Guo, Rolf Niedermeier, Daniel Raible
    posted by 1 person AbnerCYH
  • Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles
    Algorithmica, Vol. 52, No. 2. (October 2008), pp. 203-225.
    by Raman, Venkatesh, Saurabh, Saket
  • Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
    Algorithmica, Vol. 52, No. 2. (October 2008), pp. 226-249.
    by Bjorklund, Andreas, Husfeldt, Thore
  • An Improved (and Practical) Parameterized Algorithm for the Individual Haplotyping Problem MFR with Mate-Pairs
    Algorithmica, Vol. 52, No. 2. (October 2008), pp. 250-266.
    by Xie, Minzhu, Wang, Jianxin
  • On the Parameterized Complexity of Layered Graph Drawing
    Algorithmica, Vol. 52, No. 2. (October 2008), pp. 267-292.
    by Dujmovic, Vida, Fellows, Michael, Kitching, Matthew, Liotta, Giuseppe, Mccartin, Catherine, Nishimura, Naomi, Ragde, Prabhakar, Rosamond, Frances, Whitesides, Sue, Wood, David
  • On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms
    Algorithmica, Vol. 52, No. 2. (October 2008), pp. 293-307.
    by Fomin, Fedor, Gaspers, Serge, Pyatkin, Artem, Razgon, Igor
  • The Compatibility of Binary Characters on Phylogenetic Networks: Complexity and Parameterized Algorithms
    Algorithmica, Vol. 51, No. 2. (June 2008), pp. 99-128.
    by Kanj, Iyad, Nakhleh, Luay, Xia, Ge
  • Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs
    Algorithmica, Vol. 51, No. 2. (June 2008), pp. 129-159.
    by Albert, Reka, Dasgupta, Bhaskar, Dondi, Riccardo, Sontag, Eduardo
  • Property-Preserving Data Reconstruction
    Algorithmica, Vol. 51, No. 2. (June 2008), pp. 160-182.
    by Ailon, Nir, Chazelle, Bernard, Comandur, Seshadhri, Liu, Ding
  • Grouping Techniques for Scheduling Problems: Simpler and Faster
    Algorithmica, Vol. 51, No. 2. (June 2008), pp. 183-199.
    by Fishkin, Aleksei, Jansen, Klaus, Mastrolilli, Monaldo
  • Unique Sink Orientations of Grids
    Algorithmica, Vol. 51, No. 2. (June 2008), pp. 200-235.
    by Gartner, Bernd, Morris, Walter, Rust, Leo
  • Approximation Algorithms for Bounded Degree Phylogenetic Roots
    Algorithmica, Vol. 51, No. 1. (May 2008), pp. 1-23.
    by Chen, Zhi-Zhong
  • Distribution-Free Connectivity Testing for Sparse Graphs
    Algorithmica, Vol. 51, No. 1. (May 2008), pp. 24-48.
    by Halevy, Shirley, Kushilevitz, Eyal
  • Tight Results on Minimum Entropy Set Cover
    Algorithmica, Vol. 51, No. 1. (May 2008), pp. 49-60.
    by Cardinal, Jean, Fiorini, Samuel, Joret, Gwenael
  • Synchronous vs. Asynchronous Unison
    Algorithmica, Vol. 51, No. 1. (May 2008), pp. 61-80.
    by Boulinier, Christian, Petit, Franck, Villain, Vincent
  • Treewidth Lower Bounds with Brambles
    Algorithmica, Vol. 51, No. 1. (May 2008), pp. 81-98.
    by Bodlaender, Hans, Grigoriev, Alexander, Koster, Arie
  • Foreword
    Algorithmica, Vol. 50, No. 4. (April 2008), pp. 415-417.
    by Correa, Jose, Kiwi, Marcos
  • Random Bichromatic Matchings
    Algorithmica, Vol. 50, No. 4. (April 2008), pp. 418-445.
    by Bhatnagar, Nayantara, Randall, Dana, Vazirani, Vijay, Vigoda, Eric
  • Eliminating Cycles in the Discrete Torus
    Algorithmica, Vol. 50, No. 4. (April 2008), pp. 446-454.
    by Bollobas, Bela, Kindler, Guy, Leader, Imre, Odonnell, Ryan
  • Incremental Medians via Online Bidding
    Algorithmica, Vol. 50, No. 4. (April 2008), pp. 455-478.
    by Chrobak, Marek, Kenyon, Claire, Noga, John, Young, Neal
  • Algorithms for Modular Counting of Roots of Multivariate Polynomials
    Algorithmica, Vol. 50, No. 4. (April 2008), pp. 479-496.
    by Gopalan, Parikshit, Guruswami, Venkatesan, Lipton, Richard
  • Gaussian Laws for the Main Parameters of the Euclid Algorithms
    Algorithmica, Vol. 50, No. 4. (April 2008), pp. 497-554.
    by Lhote, Loick, Vallee, Brigitte
  • Minimum Cost Source Location Problems with Flow Requirements
    Algorithmica, Vol. 50, No. 4. (April 2008), pp. 555-583.
    by Sakashita, Mariko, Makino, Kazuhisa, Fujishige, Satoru
  • Subquadratic Algorithms for 3SUM
    Algorithmica, Vol. 50, No. 4. (April 2008), pp. 584-596.
    by Baran, Ilya, Demaine, Erik, Ptrascu, Mihai
  • Foreword
    Algorithmica, Vol. 48, No. 4. (August 2007), pp. 301-301.
    by Berman, Piotr, Dasgupta, Bhaskar, Liang, Jie
  • Sampling Conformation Space to Model Equilibrium Fluctuations in Proteins
    Algorithmica, Vol. 48, No. 4. (August 2007), pp. 303-327.
    by Shehu, Amarda, Clementi, Cecilia, Kavraki, E Lydia
  • An Algorithm for Simultaneous Backbone Threading and Side-Chain Packing
    Algorithmica, Vol. 48, No. 4. (August 2007), pp. 329-342.
    by Li, Guojun, Liu, Zhijie, Guo, Jun-Tao, Xu, Ying
  • An Algorithmic Approach to the Identification of Rigid Domains in Proteins
    Algorithmica, Vol. 48, No. 4. (August 2007), pp. 343-362.
    by Choi, Vicky, Goyal, Navin
  • Finding Pathway Structures in Protein Interaction Networks
    Algorithmica, Vol. 48, No. 4. (2007), pp. 363-374.
    by Songjian Lu, Fenghui Zhang, Jianer Chen, Sing-Hoi Sze
    posted by 2 people AbnerCYH CSBBGraphTheory
  • Protein Communication System: Evolution and Genomic Structure
    Algorithmica, Vol. 48, No. 4. (August 2007), pp. 375-397.
    by Bouaynaya, Nidhal, Schonfeld, Dan
  • Rigid Components in Molecular Graphs
    Algorithmica, Vol. 48, No. 4. (August 2007), pp. 399-412.
    by Jackson, Bill, Jordan, Tibor
    posted by 1 person ima
  • A Fast and Simple Algorithm for the Money Changing Problem
    Algorithmica, Vol. 48, No. 4. (2007), pp. 413-432.
    by Sebastian Bocker, Zsuzsanna Liptak
    posted by 1 person nedwards
  • Toward Unsupervised Segmentation of Semi-Rigid Low-Resolution Molecular Surfaces
    Algorithmica, Vol. 48, No. 4. (August 2007), pp. 433-438.
    by Guibas, J Leonidas, Wang, Yusu
  • Quantum Complexity of Testing Group Commutativity
    Algorithmica, Vol. 48, No. 3. (July 2007), pp. 221-232.
    by Magniez, Frederic, Nayak, Ashwin
  • Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
    Algorithmica, Vol. 48, No. 3. (July 2007), pp. 233-248.
    by Dessmark, Anders, Jansson, Jesper, Lingas, Andrzej, Lundell, Eva-Marta
  • Random 2-SAT with Prescribed Literal Degrees
    Algorithmica, Vol. 48, No. 3. (July 2007), pp. 249-265.
    by Cooper, Colin, Frieze, Alan, Sorkin, B Gregory
  • A Linear-Time Algorithm for the Perfect Phylogeny Haplotype Problem
    Algorithmica, Vol. 48, No. 3. (July 2007), pp. 267-285.
    by Bonizzoni, Paola
  • The Consecutive Ones Submatrix Problem for Sparse Matrices
    Algorithmica, Vol. 48, No. 3. (July 2007), pp. 287-299.
    by Tan, Jinsong, Zhang, Louxin
    posted by 2 people AbnerCYH CSBBGraphTheory
  • Foreword
    Algorithmica, Vol. 48, No. 2. (June 2007), pp. 127-127.
    by Wang, Lusheng
  • Server Allocation Algorithms for Tiered Systems
    Algorithmica, Vol. 48, No. 2. (June 2007), pp. 129-146.
    by Chaudhuri, Kamalika, Kothari, Anshul, Pendavingh, Rudi, Swaminathan, Ram, Tarjan, Robert, Zhou, Yunhong
  • Oblivious and Adaptive Strategies for the Majority and Plurality Problems
    Algorithmica, Vol. 48, No. 2. (June 2007), pp. 147-157.
    by Chung, Fan, Graham, Ron, Mao, Jia, Yao, Andrew
  • On Walrasian Price of CPU Time
    Algorithmica, Vol. 48, No. 2. (June 2007), pp. 159-172.
    by Deng, Xiaotie, Huang, Li-Sha, Li, Minming
  • On-Line Construction of Two-Dimensional Suffix Trees in O(n2 log n) Time
    Algorithmica, Vol. 48, No. 2. (June 2007), pp. 173-186.
    by Na, Joong Chae, Giancarlo, Raffaele, Park, Kunsoo
  • Rapid Homology Search with Neighbor Seeds
    Algorithmica, Vol. 48, No. 2. (June 2007), pp. 187-202.
    by Csuros, Miklos, Ma, Bin
  • Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis
    Algorithmica, Vol. 48, No. 2. (June 2007), pp. 203-219.
    by Tan, Jinsong, Chua, Kok Seng, Zhang, Louxin, Zhu, Song
    posted by 1 person tmmurali
    • 注: このページを引用する時は次のURLでどうぞ: http://www.citeulike.org/journal/klu-453

    Result page: 1 2 Next RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.