default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 115
Volume 115, Number 1, January 2015
- Laurent Bulteau, Guillaume Fertin
, Romeo Rizzi, Stéphane Vialette:
Some algorithmic results for [2]-sumset covers. 1-5 - Hao Yang, Keming Tang, Jianjiang Yu, Licai Zhu:
A practical information coverage approach in wireless sensor network. 6-10 - Taolue Chen, Nengkun Yu, Tingting Han:
Continuous-time orbit problems are decidable in polynomial-time. 11-14 - Razvan Diaconescu:
On the existence of translations of structured specifications. 15-22 - Oliver Schaudt:
On disjoint maximal independent sets in graphs. 23-27 - Hirotsugu Kakugawa:
On the family of critical section problems. 28-32 - Wenchang Luo, Min Ji:
Scheduling a variable maintenance and linear deteriorating jobs on a single machine. 33-39 - Martin Rötteler, Rainer Steinwandt:
A note on quantum related-key attacks. 40-44 - Wolfgang Aigner, Franz Aurenhammer, Bert Jüttler:
On triangulation axes of polygons. 45-51 - Béatrice Bérard, Krishnendu Chatterjee, Nathalie Sznajder:
Probabilistic opacity for Markov decision processes. 52-59 - Yerim Chung, Myoung-Ju Park:
Notes on inverse bin-packing problems. 60-68 - Kilho Shin:
Tree Edit Distance and Maximum Agreement Subtree. 69-73
Volume 115, Number 2, February 2015
- Andrzej Indrzejczak:
Eliminability of cut in hypersequent calculi for some modal logics of linear frames. 75-81 - Peter Floderus, Andrzej Lingas, Mia Persson, Dzmitry Sledneu:
Detecting monomials with k distinct variables. 82-86 - Salvador Lucas:
Completeness of context-sensitive rewriting. 87-92 - Simina Brânzei:
A note on envy-free cake cutting with polynomial valuations. 93-95 - Jianhua Tu:
A fixed-parameter algorithm for the vertex cover P3 problem. 96-99 - Ragesh Jaiswal, Mehul Kumar, Pulkit Yadav:
Improved analysis of D2-sampling based PTAS for k-means and other clustering problems. 100-103 - Qiang Dong, Qian Zhao, Ya-Hui An:
The hamiltonicity of generalized honeycomb torus networks. 104-111 - Michal Feldman, Tami Tamir:
Convergence of best-response dynamics in games with conflicting congestion effects. 112-118 - Sílvia Maria Santana Mapa, Sebastián Urrutia:
On the maximum acyclic subgraph problem under disjunctive constraints. 119-124 - Tetsuya Ishiu, Masashi Kikuchi:
The termination of the higher-dimensional tarai functions. 125-127 - Graham Enos, Yuliang Zheng:
An ID-based signcryption scheme with compartmented secret sharing for unsigncryption. 128-133 - Joachim von zur Gathen, Igor E. Shparlinski:
Circulant graphs and GCD and LCM of subsets. 134-138 - Enes Pasalic:
A note on nonexistence of vectorial bent functions with binomial trace representation in the PS- class. 139-140 - K. Ashik Mathew, Patric R. J. Östergård:
On hypercube packings, blocking sets and a covering problem. 141-145 - Péricles Rafael Oliveira Alves, Raphael Ernani Rodrigues, Rafael Martins de Souza, Fernando Magno Quintão Pereira:
A case for a fast trip count predictor. 146-150 - Chang-Hsiung Tsai:
The pessimistic diagnosability of alternating group graphs under the PMC model. 151-154 - S. Akshay, Timos Antonopoulos, Joël Ouaknine, James Worrell:
Reachability problems for Markov chains. 155-158 - Enrique Gerstl, Baruch Mor, Gur Mosheiov:
A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop. 159-162 - Yinfeng Xu, Hongmei Li:
Minimax regret 1-sink location problem in dynamic cycle networks. 163-169 - Jagadish M:
An approximation algorithm for the cutting-sticks problem. 170-174 - Strahil Ristov, Damir Korencic:
Using static suffix array in dynamic application: Case of text compression by longest first substitution. 175-181 - Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk:
An LP-rounding 2√2-approximation for restricted maximum acyclic subgraph. 182-185 - David A. Basin, Felix Klaedtke, Eugen Zalinescu:
Greedily computing associative aggregations on sliding windows. 186-192 - Michael Brand:
Arbitrary sequence RAMs. 193-198 - Javier Marenco, Marcelo Mydlarz, Daniel E. Severín:
Topological additive numbering of directed acyclic graphs. 199-202 - Yu-Liang Liu:
Routing and wavelength assignment for exchanged hypercubes in linear array optical networks. 203-208 - Min-Yun Lien, Jyhmin Kuo, Hung-Lin Fu:
On the decycling number of generalized Kautz digraphs. 209-211 - Luca Aceto, Eugen-Ioan Goriac, Anna Ingólfsdóttir:
A ground-complete axiomatization of stateless bisimilarity over Linda. 212-220 - Bo Ning:
Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs. 221-224 - Junqing Cai:
A sufficient condition involving implicit degree and neighborhood intersection for long cycles. 225-227 - Yanning Wang, Yanyan Wang, Xuguang Zhang:
Note on property M(k) of some complete multipartite graphs. 228-231 - Robert Janczewski, Krzysztof Turowski:
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones. 232-236 - Chetan Dugar, Anuj Jain, Amit Rajawat, Swapan Bhattacharya:
Dynamic pricing of call rates: Bayesian approach. 237-242 - Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader:
A simple algorithm for computing positively weighted straight skeletons of monotone polygons. 243-247 - Yafei Song, Xiaodan Wang, Lei Lei, Yaqiong Xing:
Credibility decay model in temporal evidence combination. 248-252 - Baruch Mor, Gur Mosheiov:
A note: Minimizing maximum earliness on a proportionate flowshop. 253-255 - Andreas Brandstädt, Pavel Ficur, Arne Leitert, Martin Milanic:
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs. 256-262 - Xiang'en Chen, Zepeng Li:
Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with Δ = 9, 10, or 11. 263-268 - Xue Zhou:
A new lower bound for the number of perfect matchings of line graph. 269-274 - Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth:
An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes. 275-279 - Shunichi Matsubara:
An enumeration algorithm for all integers nonrepresentable by some positive integers. 280-284 - Tong Jia, Yan Shi, ZhongXuan Zhou, Dongyue Chen:
3D depth information extraction with omni-directional camera. 285-291 - Giovanni Agosta, Alessandro Barenghi, Gerardo Pelosi, Michele Scandale:
Trace-based schedulability analysis to enhance passive side-channel attack resilience of embedded software. 292-297 - Chaoyi Pang, Junhu Wang, Yu Cheng, Hao Lan Zhang, Tongliang Li:
Topological sorts on DAGs. 298-301 - Zepeng Li, Zehui Shao, Enqiang Zhu, Jin Xu:
A note on local coloring of graphs. 302-305 - Thomas Lambert, Loris Marchal, Bora Uçar:
Comments on the hierarchically structured bin packing problem. 306-309 - Yasuaki Kobayashi:
Computing the pathwidth of directed graphs with small vertex cover. 310-312 - Damianos Gavalas, Charalampos Konstantopoulos, Konstantinos Mastakas, Grammati E. Pantziou, Nikolaos Vathis:
Approximation algorithms for the arc orienteering problem. 313-315 - Ali Dehghan, Mohammad-Reza Sadeghi:
The complexity of the zero-sum 3-flows. 316-320 - Naoyuki Kamiyama, Yasushi Kawase:
On packing arborescences in temporal networks. 321-325 - Michal Debski, Jaroslaw Grytczuk, Malgorzata Sleszynska-Nowak:
The strong chromatic index of sparse graphs. 326-330 - Zuosong Liang, Erfang Shan:
The clique-transversal set problem in claw-free graphs with degree at most 4. 331-335 - Reuven Cohen, Liran Katzir, Aviv Yehezkel:
A unified scheme for generalizing cardinality estimators to sum aggregation. 336-342 - Pranava K. Jha:
A comment on "The domination number of exchanged hypercubes". 343-344 - Andreas Brandstädt, Vassilis Giakoumakis:
Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphs. 345-350 - Chandrashekhar Meshram:
An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem. 351-358 - Ferhat Karakoç, Hüseyin Demirci, A. Emre Harmanci:
AKF: A key alternating Feistel scheme for lightweight cipher designs. 359-367 - Allan Scott, Srinivasan Venkatesh, Ulrike Stege:
k-Attribute-Anonymity is hard even for k=2. 368-370 - Min-Sheng Lin, Chao-Chun Ting:
A polynomial-time algorithm for computing K-terminal residual reliability of d-trapezoid graphs. 371-376 - Yinglei Song, Menghong Yu:
On finding the longest antisymmetric path in directed acyclic graphs. 377-381 - Divesh Aggarwal:
Affine-evasive sets modulo a prime. 382-385 - Jian Guo, Chunhua Su, Wun-She Yap:
An improved preimage attack against HAVAL-3. 386-393 - Wantao Ning, Xiaoli Feng, Ling Wang:
The connectivity of exchanged crossed cube. 394-396 - Sukhyeun Cho, Joong Chae Na, Kunsoo Park, Jeong Seop Sim:
A fast algorithm for order-preserving pattern matching. 397-402
Volume 115, Number 3, March 2015
- Jing-Ming Guo, Chih-Hsien Hsia, Chia-Hao Chang:
JPEG false contour reduction using error diffusion. 403-407 - Massimo Vecchio, Roberto López-Valcarce:
A greedy topology design to accelerate consensus in broadcast wireless sensor networks. 408-413 - Eleni Constantinou, Athanasios Naskos, George Kakarontzas, Ioannis Stamelos:
Extracting reusable components: A semi-automated approach for complex structures. 414-417 - Margus Veanes, Nikolaj S. Bjørner:
Symbolic tree automata. 418-424 - Domagoj Vrgoc:
Using variable automata for querying data graphs. 425-430 - Pradeesha Ashok, Sathish Govindarajan:
On strong centerpoints. 431-434 - Jérôme Monnot:
A note on the traveling salesman reoptimization problem under vertex insertion. 435-438 - Gautam K. Das, Minati De, Sudeshna Kolay, Subhas C. Nandy, Susmita Sur-Kolay:
Approximation algorithms for maximum independent set of a unit disk graph. 439-446 - Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Impossibility of gathering, a certification. 447-452
Volume 115, Number 4, April 2015
- Stanislaw J. Piestrak:
A note on RNS architectures for the implementation of the diagonal function. 453-457 - Malte Darnstädt:
The optimal PAC bound for intersection-closed concept classes. 458-461 - Miaomiao Tian:
Identity-based proxy re-signatures from lattices. 462-467 - Mengjun Li:
Automatic proving or disproving equality loop invariants based on finite difference techniques. 468-474 - Jianming Dong, Yiwei Jiang, An Zhang, Jueliang Hu, Hui Luo:
An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop. 475-480 - Saeedeh Momtazi, Felix Naumann:
Who wants a computer to be a millionaire? 481-485 - Zaiping Lu, Yingbin Ma:
Rainbow 2-Connection Numbers of Cayley Graphs. 486-491 - Xiaofang Gao, Jiye Liang:
An improved incremental nonlinear dimensionality reduction for isometric data embedding. 492-501 - Jens Maßberg:
Generalized Huffman coding for binary trees with choosable edge lengths. 502-506 - Zoltán Király, Erika R. Kovács:
Randomized and deterministic algorithms for network coding problems in wireless networks. 507-511 - Lewis Tseng, Nitin H. Vaidya, Vartika Bhandari:
Broadcast using certified propagation algorithm in presence of Byzantine faults. 512-514 - Prateek Karandikar, Manfred Kufleitner, Philippe Schnoebelen:
On the index of Simon's congruence for piecewise testability. 515-519 - Enes Pasalic:
Corrigendum to "A note on nonexistence of vectorial bent functions with binomial trace representation in the PS- class" [Information Processing Letters 115 (2) (2015) 139-140]. 520
Volume 115, Number 5, May 2015
- Hailiang Zhang, Guanglong Yu, Shanlin Li:
Graphs with six distinct matching roots. 521-526 - Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach:
Kernelization lower bound for Permutation Pattern Matching. 527-531 - Guy-Vincent Jourdan, Hasan Ural, Hüsnü Yenigün:
Reduced checking sequences using unreliable reset. 532-535 - Marco Magirius, Martin Mundhenk, Raphaela Palenta:
The complexity of primal logic with disjunction. 536-542 - Golnaz Badkobeh, Maxime Crochemore:
Infinite binary words containing repetitions of odd period. 543-547 - Jayadev Misra:
Mapping among the nodes of infinite trees: A variation of Kőnig's infinity lemma. 548-549
Volume 115, Numbers 6-8, June-August 2015
- Chun-Nan Hung, Eddie Cheng, Tao-Ming Wang, Lih-Hsing Hsu:
On Hamiltonian properties of unidirectional hypercubes. 551-555 - Gabriela R. Argiroffo, Valeria A. Leoni, Pablo Daniel Torres:
On the complexity of {k}-domination and k-tuple domination in graphs. 556-561 - Hirotsugu Kakugawa:
Self-stabilizing distributed algorithm for local mutual inclusion. 562-569 - Marco Bender, Clemens Thielen, Stephan Westphal:
Packing items into several bins facilitates approximating the separable assignment problem. 570-575 - Hervé Fournier, Anas Ismail, Antoine Vigneron:
Computing the Gromov hyperbolicity of a discrete metric space. 576-579 - Xue-Gang Chen, Shinya Fujita:
Downhill domination problem in graphs. 580-581 - Andrei Braga, Cid C. de Souza, Orlando Lee:
The Eternal Dominating Set problem for proper interval graphs. 582-587 - David Avis, Hans Raj Tiwary:
A generalization of extension complexity that captures P. 588-593 - Aline Medeiros Saettler, Eduardo Sany Laber, Ferdinando Cicalese:
Approximating decision trees with value dependent testing costs. 594-599 - Flavia Bonomo, Guillermo Durán, Amedeo Napoli, Mario Valencia-Pabon:
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to {k}-sparse graphs. 600-603 - André B. Chassein, Marc Goerigk:
Alternative formulations for the ordered weighted averaging objective. 604-608 - Olivier Finkel:
The exact complexity of the infinite Post Correspondence Problem. 609-611 - Salim Haddadi, S. Chenche, Meryem Cheraitia, F. Guessoum:
Polynomial-time local-improvement algorithm for Consecutive Block Minimization. 612-617 - Ehsan Najafi Yazdi, Alireza Bagheri, Zahra Moezkarimi, Hamidreza Keshavarz:
An O(1)-approximation algorithm for the 2-dimensional geometric freeze-tag problem. 618-622 - Hoda Jannati, Abolfazl Falahati:
Analysis of false-reject probability in distance bounding protocols with mixed challenges over RFID noisy communication channel. 623-629 - Shigeyoshi Imai, Kaoru Kurosawa:
Improved reconstruction of RSA private-keys from their fraction. 630-632 - Vince Grolmusz:
A note on the PageRank of undirected graphs. 633-634 - Michal Nánási, Tomás Vinar, Brona Brejová:
Sequence annotation with HMMs: New problems and their complexity. 635-639 - Szymon Grabowski:
A note on the longest common substring with k-mismatches problem. 640-642 - Tomás Flouri, Emanuele Giaquinta, Kassian Kobert, Esko Ukkonen:
Longest common substrings with k mismatches. 643-647
Volume 115, Number 9, September 2015
- Sharareh Alipour, Mohammad Ghodsi, Alireza Zarei, Maryam Pourreza:
Visibility testing and counting. 649-654 - Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Constructing LZ78 tries and position heaps in linear time for large alphabets. 655-659 - Céline Blondeau:
Impossible differential attack on 13-round Camellia-192. 660-666 - Min Chih Lin, Saveliy Vasiliev:
Approximation algorithms for clique transversals on some graph classes. 667-670 - Henning Fernau, Pinar Heggernes, Pim van 't Hof, Daniel Meister, Reza Saei:
Computing the metric dimension for chain graphs. 671-676 - Shuhuan Zhao, Zheng-ping Hu:
A modular weighted sparse representation based on Fisher discriminant and sparse residual for face recognition with occlusion. 677-683 - Martin Dietzfelbinger, Raed Jaberi:
On testing single connectedness in directed graphs and some related problems. 684-688 - François Queyroi, Sergey Kirgizov:
Suppression distance computation for hierarchical clusterings. 689-693 - Jay Thakkar, Aditya Kanade:
Non-deterministic transducer models of retransmission protocols over noisy channels. 694-698 - Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
On the ensemble of optimal dominating and locating-dominating codes in a graph. 699-702 - Yunong Zhang, Binbin Qiu, Long Jin, Dongsheng Guo, Zhi Yang:
Infinitely many Zhang functions resulting in various ZNN models for time-varying matrix inversion with link to Drazin inverse. 703-706 - Irena Hrastnik Ladinek, Janez Zerovnik:
Perfect codes in direct graph bundles. 707-711 - Barun Gorain, Partha Sarathi Mandal:
Approximation algorithm for sweep coverage on graph. 712-718 - Yue-Feng Cen, Wanliang Wang, Xin-Wei Yao:
A fast CU depth decision mechanism for HEVC. 719-724 - Edward A. Hirsch, Dmitry Sokolov:
On the probabilistic closure of the loose unambiguous hierarchy. 725-730
Volume 115, Number 10, October 2015
- Thaís Bardini Idalino, Lucia Moura, Ricardo Felipe Custódio, Daniel Panario:
Locating modifications in signed data for partial data integrity. 731-737 - Nethanel Gelernter, Amir Herzberg:
Gossip Latin square and the meet-all gossipers problem. 738-743 - René van Bevern, Jiehua Chen, Falk Hüffner, Stefan Kratsch, Nimrod Talmon, Gerhard J. Woeginger:
Approximability and parameterized complexity of multicover by c-intervals. 744-749 - Dean Doron, Amnon Ta-Shma:
On the de-randomization of space-bounded approximate counting problems. 750-753 - Enqiang Zhu, Zepeng Li, Zehui Shao, Jin Xu, Chanjuan Liu:
Tree-core and tree-coritivity of graphs. 754-759 - Laurent Gourvès:
Approximating the optimal sequence of acquisitions and sales with a capped budget. 760-764 - Alexander Chane Shiau, Tzong-Huei Shiau, Yue-Li Wang:
Incidence coloring of Cartesian product graphs. 765-768 - Amr Elmasry:
Counting inversions adaptively. 769-772 - Min-Sheng Lin, Chao-Chun Ting:
Computing the K-terminal reliability of directed path graphs. 773-778 - Mrinal Nandi:
On commutativity of Discrete Fourier Transform. 779-785 - Houcine Boumediene Merouane, Mustapha Chellali:
On Secure Domination in Graphs. 786-790 - Jørgen Bang-Jensen, Magnús M. Halldórsson:
Vertex coloring edge-weighted digraphs. 791-796
Volume 115, Number 11, November 2015
- Chen Yuan, Haibin Kan:
A refined analysis on the jump number problem of interval orders. 797-800 - Joao M. M. Barguil, Paulo S. L. M. Barreto:
Security issues in Sarkar's e-cash protocol. 801-803 - Guanqun Ni, Li Luo, Yin-Feng Xu, Jiuping Xu:
Optimal online markdown and markup pricing policies with demand uncertainty. 804-811 - Sheng Huang, Dan Yang, Yongxin Ge, Xiaohong Zhang:
Combined supervised information with PCA via discriminative component selection. 812-816 - Yuxing Yang, Shiying Wang, Jing Li:
Subnetwork preclusion for bubble-sort networks. 817-821 - Jing Chen, Xiuping Wang:
Identification of Hammerstein systems with continuous nonlinearity. 822-827 - Alak Kumar Datta:
Approximate spanning cactus. 828-832 - Vahan Mkrtchyan, K. Subramani:
On the approximability of the Largest Sphere Rule Ensemble Classification problem. 833-837 - Yong Wu, T. C. E. Cheng, Min Ji:
Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines. 838-844 - Miriam Di Ianni, Luciano Gualà, Gianluca Rossi:
Reducing the diameter of a unit disk graph via node addition. 845-850 - Lein Harn, Ching-Fang Hsu:
Dynamic threshold secret reconstruction and its application to the threshold cryptography. 851-857 - Xianmeng Meng, Xuexin Zheng:
Cryptanalysis of RSA with a small parameter revisited. 858-862 - Cosmina Croitoru:
A note on quasi-kernels in digraphs. 863-865 - Tobias Mömke:
An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality. 866-871 - Paulina Grzegorek, Janusz Januszewski:
A note on one-space bounded square packing. 872-876 - Tomás Kaiser, Maria Saumell, Nico Van Cleemput:
10-Gabriel graphs are Hamiltonian. 877-881 - Fred Mesnard, Étienne Payet:
A second-order formulation of non-termination. 882-885 - Jarkko Peltomäki:
Characterization of repetitions in Sturmian words: A new proof. 886-891 - Brahim Neggazi, Mohammed Haddad, Hamamache Kheddouci:
A new self-stabilizing algorithm for maximal p-star decomposition of general graphs. 892-898 - Thomas Eisenbarth, Aaron Meyerowitz, Rainer Steinwandt:
On the security margin of MAC striping. 899-902 - Yan Zhang, Zhaohui Zhu, Jinjin Zhang:
On the greatest solution of equations in CLLR. 903-907 - Sandra Alves, Sabine Broda:
A short note on type-inhabitation: Formula-trees vs. game semantics. 908-911
Volume 115, Number 12, December 2015
- Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
A faster algorithm for the cluster editing problem on proper interval graphs. 913-916 - Chiou-Jiun Lin, Jia Jie Liu, Yue-Li Wang:
Finding outer-connected dominating sets in interval graphs. 917-922 - Vladimir Braverman, Rafail Ostrovsky, Gregory Vorsanger:
Weighted sampling without replacement from data streams. 923-926 - Marios Mavronicolas, Burkhard Monien:
The complexity of pure equilibria in mix-weighted congestion games on parallel links. 927-931 - Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu:
The optimal structure of algorithms for α-paging. 932-938 - Chuandong Xu, Shenggui Zhang, Yi Wang:
On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees. 939-944 - Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng:
Embedding even cycles on folded hypercubes with conditional faulty edges. 945-949 - Huaming Xing, Moo Young Sohn:
Bounds on locating total domination number of the Cartesian product of cycles and paths. 950-956 - Zhi-Yi Shao, Bo Yang:
On security against the server in designated tester public key encryption with keyword search. 957-961 - Daniel L. Lu:
Planar lower envelope of monotone polygonal chains. 962-964 - Hans L. Bodlaender, Marc J. van Kreveld:
Google Scholar makes it hard - the complexity of organizing one's publications. 965-968 - Zhichao Geng, Jinjiang Yuan:
A note on unbounded parallel-batch scheduling. 969-974 - Moshe Milshtein:
A new binary code of length 16 and minimum distance 3. 975-976 - Zhiwei Guo, Haixing Zhao, Yaping Mao:
The equitable vertex arboricity of complete tripartite graphs. 977-982 - Cosme Ernesto Santiesteban-Toca, Jesús S. Aguilar-Ruiz:
A new multiple classifier system for the prediction of protein's contacts map. 983-990
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-04 01:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
