Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=7936

• Small H-coloring problems for bounded degree digraphs
  Pavol Hell, Aurosish Mishra
  Lecture Notes in Computer Science 7936, 2013, pp. 579-590
• Bounded model checking for propositional projection temporal logic
  Zhenhua Duan, Cong Tian, Mengfei Yang, Jia He
  Lecture Notes in Computer Science 7936, 2013, pp. 591-602
• Packing cubes into a cube is NP-hard in the strong sense
  Yiping Lu, Danny Z. Chen, Jianzhong Cha
  Lecture Notes in Computer Science 7936, 2013, pp. 603-613
• On the complexity of solving or approximating convex recoloring problems
  Manoel B. Campêlo, Cristiana G. Huiban, Rudini M. Sampaio, Yoshiko Wakabayashi
  Lecture Notes in Computer Science 7936, 2013, pp. 614-625
• 2-connecting outerplanar graphs without blowing up the pathwidth
  Jasine Babu, Manu Basavaraju, Sunil Chandran Leela, Deepak Rajendraprasad
  Lecture Notes in Computer Science 7936, 2013, pp. 626-637
• How to catch L_2-heavy-hitters on sliding windows
  Vladimir Braverman, Ran Gelles, Rafail Ostrovsky
  Lecture Notes in Computer Science 7936, 2013, pp. 638-650
• Time/memory/data tradeoffs for variants of the RSA problem
  Pierre-Alain Fouque, Damien Vergnaud, Jean-Christophe Zapalowicz
  Lecture Notes in Computer Science 7936, 2013, pp. 651-662
• An improved algorithm for extraction of exact boundaries and boundaries inclusion relationship
  Tao Hu, Xianyi Ren, Jihong Zhang
  Lecture Notes in Computer Science 7936, 2013, pp. 663-671
• Straight-line monotone grid drawings of series-parallel graphs
  Md. Iqbal Hossain, Md. Saidur Rahman
  Lecture Notes in Computer Science 7936, 2013, pp. 672-679
• Combination of two-machine flow shop scheduling and shortest path problems
  Kameng Nip, Zhenbo Wang
  Lecture Notes in Computer Science 7936, 2013, pp. 680-687
• The program download problem: Complexity and algorithms
  Chao Peng, Jie Zhou, Binhai Zhu, Hong Zhu
  Lecture Notes in Computer Science 7936, 2013, pp. 688-696
• Finding theorems in NBG set theory by automated forward deduction based on strong relevant logic
  Hongbiao Gao, Kai Shi, Yuichi Goto, Jingde Cheng
  Lecture Notes in Computer Science 7936, 2013, pp. 697-704
• Perturbation analysis of maximum-weighted bipartite matchings with low rank data
  Xingwu Liu, Shang-Hua Teng
  Lecture Notes in Computer Science 7936, 2013, pp. 705-712
• Sublinear time approximate sum via uniform random sampling
  Bin Fu, Wenfeng Li, Zhiyong Peng
  Lecture Notes in Computer Science 7936, 2013, pp. 713-720
• Tractable connected domination for restricted bipartite graphs
  Zhao Lu, Tian Liu, Ke Xu
  Lecture Notes in Computer Science 7936, 2013, pp. 721-728
• On the minimum caterpillar problem in digraphs
  Taku Okada, Akira Suzuki, Takehiro Ito, Xiao Zhou
  Lecture Notes in Computer Science 7936, 2013, pp. 729-736
• A new model for product adoption over social networks
  Lidan Fan, Zaixin Lu, Weili Wu, Yuanjun Bi, Ailian Wang
  Lecture Notes in Computer Science 7936, 2013, pp. 737-746
• Generating uncertain networks based on historical network snapshots
  Meng Han, Mingyuan Yan, Jinbao Li, Shouling Ji, Yingshu Li
  Lecture Notes in Computer Science 7936, 2013, pp. 747-758
• A short-term prediction model of topic popularity on microblogs
  Juanjuan Zhao, Weili Wu, Xiaolong Zhang, Yan Qiang, Tao Liu, Lidong Wu
  Lecture Notes in Computer Science 7936, 2013, pp. 759-769
• Social network path analysis based on HBase
  Yan Qiang, Junzuo Lu, Weili Wu, Juanjuan Zhao, Xiaolong Zhang, Yue Li, Lidong Wu
  Lecture Notes in Computer Science 7936, 2013, pp. 770-779
• Community expansion model based on charged system theory
  Yuanjun Bi, Weili Wu, Ailian Wang, Lidan Fan
  Lecture Notes in Computer Science 7936, 2013, pp. 780-790
• Centrality and spectral radius in dynamic communication networks
  Danica Vukadinović Greetham, Zhivko Stoyanov, Peter Grindrod
  Lecture Notes in Computer Science 7936, 2013, pp. 791-800
• Finding network communities using random walkers with improved accuracy
  You Li, Jie Wang, Benyuan Liu, Qilian Liang
  Lecture Notes in Computer Science 7936, 2013, pp. 801-810
• Homophilies and communities detection among a subset of Blogfa Persian weblogs: Computer and Internet Category
  Adib Rastegarnia, Meysam Mohajer, Vahid Solouk
  Lecture Notes in Computer Science 7936, 2013, pp. 811-820
• Neighborhood-based dynamic community detection with graph transform for 0-1 observed networks
  Li Wang, Yuanjun Bi, Weili Wu, Biao Lian, Wen Xu
  Lecture Notes in Computer Science 7936, 2013, pp. 821-830