The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Imed Kacem" ( http://dblp.L3S.de/Authors/Imed_Kacem )

URL (Homepage):  http://kacem.imed.perso.neuf.fr/site/  Author page on DBLP  Author page in RDF  Community of Imed Kacem in ASPL-2

Publication years (Num. hits)
2001-2009 (20) 2010-2013 (19) 2014-2016 (26) 2017-2018 (17) 2019 (6)
Publication types (Num. hits)
article(55) incollection(1) inproceedings(32)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3 occurrences of 3 keywords

Results
Found 89 publication records. Showing 88 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Pascal Schroeder, Imed Kacem, Günter Schmidt 0002 Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices. Search on Bibsonomy RAIRO - Operations Research The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ahmed Abdelmoumene Kadri, Imed Kacem, Karim Labadi Lower and upper bounds for scheduling multiple balancing vehicles in bicycle-sharing systems. Search on Bibsonomy Soft Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Hans Kellerer Complexity results for common due date scheduling problems with interval data and minmax regret criterion. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pascal Schroeder, Imed Kacem Optimal cash management with uncertain, interrelated and bounded demands. Search on Bibsonomy Computers & Industrial Engineering The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pascal Schroeder, Imed Kacem New algorithms for online time series search with interrelated prices. Search on Bibsonomy CoDIT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Ilyes Kadri, Benoît Martin, Isabelle Pecci 2-Dimensional packing algorithms on a variable-size rectangular interface. Search on Bibsonomy CoDIT The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Youcef Abdelsadek, Kamel Chelghoum, Francine Herrmann, Imed Kacem, Benoît Otjacques Community extraction and visualization in social networks applied to Twitter. Search on Bibsonomy Inf. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Hans Kellerer Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Yousif Elhadi Elsideeg Ahmed, Kondo H. Adjallah, Romuald Stock, Imed Kacem, Sharief F. Babiker NDSC based methods for maximizing the lifespan of randomly deployed wireless sensor networks for infrastructures monitoring. Search on Bibsonomy Computers & Industrial Engineering The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Aristide Grange, Imed Kacem, Sébastien Martin Algorithms for the bin packing problem with overlapping items. Search on Bibsonomy Computers & Industrial Engineering The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman On the m-clique free interval subgraphs polytope: polyhedral analysis and applications. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Runliang Dou, Chen-Fu Chien, Imed Kacem, Chia-Yu Hsu Industry Applications of Computational Intelligence: Preface. Search on Bibsonomy Int. J. Comput. Intell. Syst. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Gais Alhadi, Imed Kacem, Pierre Laroche, Izzeldin M. Osman Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval. Search on Bibsonomy CoDIT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yacine Benziani, Imed Kacem, Pierre Laroche Genetic Algorithm for Open Shop Scheduling Problem. Search on Bibsonomy CoDIT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Hans Kellerer Improved Fully Polynomial Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. Search on Bibsonomy ICCL The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Myriam Sahnoune, Günter Schmidt 0002 Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines. Search on Bibsonomy RAIRO - Operations Research The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Christophe Rapine Approximation Algorithms for the Open Shop Problem with Delivery Times. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Imed Kacem, Hans Kellerer Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times under Non-Availability or Deadline Constraints. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Imed Kacem Applications of Optimization Methods to Industrial Engineering Problems. Search on Bibsonomy Computers & Industrial Engineering The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fadel Abdallah, Camel Tanougast, Imed Kacem, Camille Diou, Daniel Singer A comparison of two metaheuristic algorithms for scheduling problem on a heterogeneous CPU/FPGA architecture with communication delays. Search on Bibsonomy CoDIT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Telmo Reis Cunha, Valerie Botta-Genoulaz Keynote 5: "Scheduling with non-availability constraints: Offline and semi-online scenarios". Search on Bibsonomy CoDIT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman Mathematical formulation for open shop scheduling problem. Search on Bibsonomy CoDIT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Hans Kellerer, Pierre Laroche Foreword - Advanced Optimization Approaches and Modern OR-Applications. Search on Bibsonomy RAIRO - Operations Research The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Hans Kellerer Semi-online scheduling on a single machine with unexpected breakdown. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Youcef Abdelsadek, Kamel Chelghoum, Francine Herrmann, Imed Kacem, Benoît Otjacques On the visualization of the detected communities in dynamic networks: A case study of Twitter's network. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Aristide Grange, Imed Kacem, Sébastien Martin Algorithms for the Pagination Problem, a Bin Packing with Overlapping Items. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Youcef Abdelsadek, Kamel Chelghoum, Francine Herrmann, Imed Kacem, Benoît Otjacques Triangles as basis to detect communities: an application to Twitter's network. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Ahmed Abdelmoumene Kadri, Imed Kacem, Karim Labadi A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems. Search on Bibsonomy Computers & Industrial Engineering The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Hans Kellerer, Maryam Seifaddini Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Bao-Thien Hoang, Kamel Chelghoum, Imed Kacem Modeling Information Diffusion via Reputation Estimation. Search on Bibsonomy DEXA (1) The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut. Search on Bibsonomy ISCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sana Khalfa, Nizar Rokbani, Achraf Jabeur Telmoudi, Imed Kacem, Lotfi Nabli, Alaoui Mdaghri Zoubida PSO for Job-Shop Scheduling with Multiple Operating Sequences Problem - JS. Search on Bibsonomy HIS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ayet Allah Ferjani, Noureddine Liouane, Imed Kacem Task allocation for wireless sensor network using logic gate-based evolutionary algorithm. Search on Bibsonomy CoDIT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Bao-Thien Hoang, Kamel Chelghoum, Imed Kacem A learning-based model for predicting information diffusion in social networks: Case of Twitter. Search on Bibsonomy CoDIT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Pascal Schroeder, Günter Schmidt 0002, Imed Kacem Optimal on-line algorithms for bi-directional non-preemptive conversion with interrelated conversion rates. Search on Bibsonomy CoDIT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman Valid inequalities for unrelated parallel machines scheduling with precedence constraints. Search on Bibsonomy CoDIT The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Youcef Abdelsadek, Kamel Chelghoum, Francine Herrmann, Imed Kacem, Benoît Otjacques Visual Interactive Approach for Mining Twitter's Networks. Search on Bibsonomy DMBD The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Youcef Abdelsadek, Kamel Chelghoum, Francine Herrmann, Imed Kacem, Benoît Otjacques On the Community Identification in Weighted Time-Varying Networks. Search on Bibsonomy ICSIBO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Isabelle Pecci, Benoît Martin, Imed Kacem, Imed Maamria, Sébastien Faye, Nicolas Louveton, Gabriela Gheorghe, Thomas Engel 0001 Not a tile out of place: Toward creating context-dependent user interfaces on smartglasses. Search on Bibsonomy HSI The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Walid Hfaiedh, Cherif Sadfi, Imed Kacem, Atidel Hadj-Alouane A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization. Search on Bibsonomy Applied Mathematics and Computation The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Youcef Abdelsadek, Francine Herrmann, Imed Kacem, Benoît Otjacques Branch-and-bound algorithm for the maximum triangle packing problem. Search on Bibsonomy Computers & Industrial Engineering The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Hans Kellerer, Yann Lanuel Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Yousif Elhadi Elsideeg Ahmed, Kondo H. Adjallah, Imed Kacem, Sharief F. Babikir Genetic algorithm based scheduling method for lifespan extension of a wireless sensors network. Search on Bibsonomy IDAACS The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Hans Kellerer Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Hans Kellerer, Maryam Seifaddini Efficient Approximation Schemes for the Maximum Lateness Minimization on a Single Machine with a Fixed Operator or Machine Non-Availability Interval. Search on Bibsonomy ISCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin Unrelated parallel machines with precedence constraints: application to cloud computing. Search on Bibsonomy CLOUDNET The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Vahid Farrokhi, Imed Kacem, Laszlo Pokoradi Ranking the solution techniques for reactive scheduling problem in operating room. Search on Bibsonomy CoDIT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Walid Hfaiedh, Cherif Sadfi, Imed Kacem, Atidel B. Hadj-Alouane An iterative lower bound algorithm for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization. Search on Bibsonomy CoDIT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Racem Mellouli, Imed Kacem, Cherif Sadfi, Chengbin Chu Lagrangian relaxation and column generation-based lower bounds for the Pm, hj1‖∑wiCiPm, hj1‖∑wiCi scheduling problem. Search on Bibsonomy Applied Mathematics and Computation The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Vangelis Th. Paschos Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability. Search on Bibsonomy Discrete Optimization The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Maher Rebai, Imed Kacem, Kondo H. Adjallah Scheduling jobs and maintenance activities on parallel machines. Search on Bibsonomy Operational Research The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Imed Kacem Effective algorithms for scheduling problems under non-availability constraints (Invited paper). Search on Bibsonomy ICSCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Anass Nagih, Maryam Seifaddini Differential approximation analysis of Jackson's rule for single-machine scheduling problem with a fixed non-availability interval. Search on Bibsonomy ICNSC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Yacine Benziani, Imed Kacem, Pierre Laroche, Anass Nagih Lower bounds for the makespan minimization in job shops. Search on Bibsonomy ICNSC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Nizar Souayah, Mohamed Haouari Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions. Search on Bibsonomy RAIRO - Operations Research The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Rabia Nessah, Imed Kacem Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates. Search on Bibsonomy Computers & OR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Maher Rebai, Imed Kacem, Kondo H. Adjallah Earliness-tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods. Search on Bibsonomy J. Intelligent Manufacturing The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Said Ben Messaoud, Imed Kacem Guest Editorial: Advanced Combinatorial Optimization and Applications. Search on Bibsonomy IJCOPI The full citation details ... 2012 DBLP  BibTeX  RDF
1Imed Kacem Erratum to "Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval" [Comput. Ind. Eng. 56(2009) 1708-1712]. Search on Bibsonomy Computers & Industrial Engineering The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Hans Kellerer Foreword: Combinatorial optimization for industrial engineering. Search on Bibsonomy Computers & Industrial Engineering The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Hans Kellerer Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. Search on Bibsonomy J. Scheduling The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Maher Rebai, Imed Kacem, Kondo H. Adjallah Evolutionary Algorithm for Scheduling Production Jobs and Preventive Maintenance Activities. Search on Bibsonomy Business Process Management Workshops (2) The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Makram Zaidi, Bassem Jarboui, Imed Kacem, Taïcir Loukil Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Mhand Hifi, Imed Kacem, Stéphane Nègre, Lei Wu 0005 A Linear Programming Approach for the Three-Dimensional Bin-Packing Problem. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Imed Kacem Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ahmed Mellouli, Faouzi Masmoudi, Imed Kacem, Mohamed Haddar A Hybrid Genetic Algorithm for Optimization of Two-dimensional Cutting-Stock Problem. Search on Bibsonomy Int. J. of Applied Metaheuristic Computing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Imed Kacem New Fully Polynomial Time Approximation Scheme for the Makespan Minimization with Positive Tails on a Single Machine with a Fixed Non-availability Interval. Search on Bibsonomy CTW The full citation details ... 2010 DBLP  BibTeX  RDF
1Abdelghani Bekrar, Imed Kacem An Exact Method for the 2D Guillotine Strip Packing Problem. Search on Bibsonomy Adv. Operations Research The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Nizar Souayah, Imed Kacem, Mohamed Haouari, Chengbin Chu Scheduling on parallel identical machines to minimise the total weighted tardiness. Search on Bibsonomy IJAOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Mohamed Haouari Approximation algorithms for single machine scheduling with one unavailability period. Search on Bibsonomy 4OR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF MSC classification (2000) 90B35
1Racem Mellouli, Cherif Sadfi, Chengbin Chu, Imed Kacem Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Ali Ridha Mahjoub Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Search on Bibsonomy Computers & Industrial Engineering The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Imed Kacem Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Non-availability constraint, Scheduling, Approximation, Makespan
1Imed Kacem, Chengbin Chu, Ahmed Souissi Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times. Search on Bibsonomy Computers & OR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Chengbin Chu Minimizing the weighted flow time on a single machine with the resumable availability constraint: worst case of the WSPT heuristic. Search on Bibsonomy Int. J. Computer Integrated Manufacturing The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Chengbin Chu Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Imed Kacem Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Search on Bibsonomy Computers & Industrial Engineering The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Nozha Zribi, Imed Kacem, Abdelkader El Kamel, Pierre Borne Assignment and Scheduling in Flexible Job-Shops by Hierarchical Optimization. Search on Bibsonomy IEEE Trans. Systems, Man, and Cybernetics, Part C The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Imed Kacem Flexible Job-Shop Scheduling Problems. Search on Bibsonomy Encyclopedia of Information Science and Technology (II) The full citation details ... 2005 DBLP  BibTeX  RDF
1Imed Kacem, Cherif Sadfi, Abdelkader El-Kamel Branch and bound and dynamic programming to minimize the total completion times on a single machine with availability constraints. Search on Bibsonomy SMC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Ahmed Souissi, Imed Kacem, Chengbin Chu Minimizing total tardiness on a single machine with sequence-dependent setup times. Search on Bibsonomy SMC (2) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Imed Kacem Scheduling Flexible Job-Shops: A Worst Case Analysis And An Evolutionary Algorithm. Search on Bibsonomy International Journal of Computational Intelligence and Applications The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Imed Kacem Genetic algorithm for the flexible job-shop scheduling problem. Search on Bibsonomy SMC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Slim Hammadi, Pierre Borne Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Search on Bibsonomy Mathematics and Computers in Simulation The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Slim Hammadi, Pierre Borne Correction to "approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems". Search on Bibsonomy IEEE Trans. Systems, Man, and Cybernetics, Part C The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Slim Hammadi, Pierre Borne Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. Search on Bibsonomy IEEE Trans. Systems, Man, and Cybernetics, Part C The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Imed Kacem, Slim Hammadi, Pierre Borne Approach by localization and genetic manipulation algorithm for flexible job-shop scheduling problem. Search on Bibsonomy SMC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #88 of 88 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license