2024
1.
Online early work scheduling on parallel machines,
European Journal of Operational Research
2024,
2.
Online and Semi-online Scheduling on Two Hierarchical Machines with a Common Due Date to Maximize the Total Early Work,
International Journal of Applied Mathematics and Computer Science
34,
2024,
pp. 253-261
2023
3.
An improved approximation algorithm for a scheduling problem with transporter coordination,
Journal of Scheduling
26,
2023,
pp. 559-570
4.
Exact Approaches to Late Work Scheduling on Unrelated Machines,
International Journal of Applied Mathematics and Computer Science
33 (2),
2023,
pp. 285-295
5.
In silico and in vitro analysis of the impact of single substitutions within EXO-motifs on Hsa-MiR-1246 intercellular transfer in breast cancer cell,
Journal of Applied Genetics
64,
2023,
pp. 105-124
6.
Ab Initio Study of Glycine Formation in the Condensed Phase: Carbon Monoxide, Formaldimine, and Water Are Enough,
The Astrophysical Journal
956 (2),
2023,
pp. 140
7.
Single machine scheduling with due date assignment to minimize the total weighted lead time penalty and late work,
Omega
121,
2023,
pp. 102923
8.
Mathematical challenges in scheduling theory,
Journal of Scheduling
26,
2023,
pp. 519–521
9.
A DNA Algorithm for Calculating the Maximum Flow of a Network,
Foundations of Computing and Decision Sciences
48 (4),
2023,
pp. 483-506
2022
10.
RNA World Modeling: A Comparison of Two Complementary Approaches,
Entropy
24 (4),
2022,
p. 536
11.
Two-machine flow shop scheduling with a common due date to maximize total early work,
European Journal of Operational Research
300 (2),
2022,
pp.504-511
12.
Alternative algorithms for identical machines scheduling to maximize total early work with a common due date,
Computers & Industrial Engineering
2022,
13.
Learning vector quantization as an interpretable classifier for the detection of SARS-CoV-2 types based on their RNA sequences,
Neural Computing and Applications
34 ,
2022,
pp. 67-78
14.
In silico and in vitro analysis of the impact of single substitutions within EXO-motifs on Hsa-MiR-1246 intercellular transfer in breast cancer cell.,
Journal of Applied Genetics
2022,
pp.1-20
15.
Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work.,
arXiv
2022,
16.
RNAloops: a database of RNA multiloops.,
Bioinformatics
38 (17),
2022,
pp. 4200-4205
17.
In memoriam Moshe Dror,
Journal of Scheduling
25,
2022,
p. 1-1
2021
18.
Semi-online Scheduling on Two Identical Machines with a Common Due Date to Maximize Total Early Work,
Discrete Applied Mathematics
290,
2021,
pp. 71-78
19.
Genome-scale de novo assembly using ALGA,
Bioinformatics
37,
2021,
pp. 1644-1651
20.
A Fast Algorithm for Knapsack Problem with Conflict Graph,
Asia-Pacific Journal of Operational Research
38 (06),
2021,
pp. 1-34
21.
Learning vector quantization as an interpretable classifier for the detection of SARS-CoV-2 types based on their RNA sequences,
Neural Computing and Applications
2021,
pp. 1-12
22.
Two-machine flow shop scheduling with a common due date to maximize total early work,
European Journal of Operational Research
2021,
23.
New Perspectives in Scheduling Theory,
Journal of Scheduling
24 (5),
2021,
pp. 455-457
24.
The correctness of large scale analysis of genomic data,
Foundations of Computing and Decision Sciences
46 (4),
2021,
pp. 423-436
25.
Mirror scheduling problems with early work and late work criteria,
Journal of Scheduling
24 (5),
2021,
pp. 483-487
2020
26.
Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date,
European Journal of Operational Research, North-Holland
284 (1),
2020,
pp. 67-74
27.
Recent Results on Computational Molecular Modeling of The Origins of Life,
Foundations of Computing and Decision Sciences
45 (1),
2020,
pp. 35-46
28.
Multi-agent approach to sequence structure simulation in the RNA World hypothesis,
PloS one
15 (8),
2020,
e0238253
29.
Two meta-heuristic algorithms for scheduling on unrelated machines with the late work criterion,
International Journal of applied mathematics and computer science
30 (3),
2020,
pp. 573-584
30.
Virxicon: A Lexicon Of Viral Sequences,
Bioinformatics
36 (22-23),
2020,
pp. 5507-5513
31.
Exact and Heuristic Algorithms for Scheduling on Two Identical Machines with Early Work Maximization,
Computers & Industrial Engineering
144,
2020,
32.
A highly effective approach to cofactor regeneration and subsequent membrane separation of bioconversion products: Kinetic parameters and effect of process conditions,
Bioresource Technology Reports
9,
2020,
pp. 100365
2019
33.
PUM1 and PUM2 exhibit different modes of regulation for SIAH1 that involve cooperativity with NANOS paralogues,
Cellular and Molecular Life Sciences
76 (1),
2019,
pp. 147-161
34.
Two-machine flow-shop scheduling to minimize total late work: revisited,
Engineering Optimization
2019,
doi.org/10.1080/0305215X.2018.1519073
35.
Detecting Life Signatures with RNA Sequence Similarity Measures,
Journal of Theoretical Biology
463,
2019,
pp. 110-120
36.
Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work,
Engineering Optimization
51 (7),
2019,
1-2
37.
Prebiotic Soup Components Trapped in Montmorillonite Nanoclay Form New Molecules: Car-Parrinnello Ab Initio Simulations,
Life: The Origin and Early Evolution of Life: Prebiotic Chemistry of Biomolecules
9 (46),
2019,
38.
Cloud Brokering with Bundles: Multi-objective Optimization of Services Selection,
Foundations of Computing and Decision Sciences, Sciendo
44/4,
2019,
pp. 407-426
39.
VirDB: Crowdsourced Database for Evaluation of Dynamical Viral Infection Models ,
Current Bioinformatics
14 (8),
2019,
pp. 740-748(9)
2018
40.
Graph algorithms for DNA sequencing - origins, current models and the future,
European Journal of Operational Research
264 (3),
2018,
pp. 799-812
41.
RNApdbee 2.0: multifunctional tool for RNA structure annotation,
Nucleic acids research
2018,
https://doi.org/10.1093/nar/gky314
42.
A note on the complexity of scheduling of communication-aware directed acyclic graph.,
Biulletin of the Polish Academy of Sciences, Technical Sciences
66 (2),
2018,
pp. 187-191
43.
RNAvista: a webserver to assess RNA secondary structures with non-canonical base pairs,
Bioinformatics
2018,
doi:10.1093/bioinformatics/bty609
44.
GRASShopPER—An algorithm for de novo assembly based on GPU alignments,
PloS one
13 (8),
2018,
https://doi.org/10.1371/journal.pone.0202355
45.
NPM1 alternative transcripts are upregulated in acute myeloid and lymphoblastic leukemia and their expression level affects patient outcome,
Journal of Translation Medicine
16 (232),
2018,
https://doi.org/10.1186/s12967-018-1608-2
46.
New challenges in scheduling theory,
Journal of Scheduling
21 (6),
2018,
pp. 581–582
2017
47.
Modeling of the catalytic core of Arabidopsis thaliana Dicer-like 4 protein and its complex with double-stranded RNA,
Computational Biology and Chemistry
66,
2017,
pp. 44-56
48.
Computational prediction of nonenzymatic RNA degradation patterns,
Acta Biochimica Polonica
63 (4),
2017,
pp. 745-751
49.
Understanding Life: A Bioinformatics Perspective,
European Review
25 (2),
2017,
pp. 231-245
50.
Tabu Search for the RNA Partial Degradation Problem,
International Journal of Applied Mathematics and Computer Science
27 (2),
2017,
pp. 401-415
51.
Simulating the origins of life: The dual role of RNA replicases as an obstacle to evolution,
PloS one
12 (7),
2017,
e0180827
52.
Complexity of late work minimization in flow shop systems and a particle swarm optimization algorithm for learning effect,
Computers & Industrial Engineering
111,
2017,
pp. 176-182
53.
An integrated model for the transshipment yard scheduling problem,
Journal of Scheduling
20 (1),
2017,
pp. 57-65
2016
54.
Simultaneous detection of mutations and copy number variation of NPM1 in the acute myeloid leukemia using multiplex ligation-dependent probe amplification,
Mutation Research
786,
2016,
pp.14-26.
55.
Hypercycle,
PLoS Comput Biol
12(4): e1004853,
2016,
doi:10.1371/journal.pcbi.1004853
56.
G-MAPSEQ–a new method for mapping reads to a reference genome,
Foundations of Computing and Decision Sciences
41,
2016,
pp. 123-142
57.
Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs,
International Journal of Applied Mathematics and Computer Science
26,
2016,
pp. 391-406
58.
Novel dual discounting functions for the Internet shopping optimization problem: new algorithms,
Journal of Scheduling
19,
2016,
pp. 245-255
59.
AmiRNA Designer-new method of artificial miRNA design,
Acta Biochimica Polonica
63,
2016,
pp. 71-77
60.
Computer representations of bioinformatics models,
Current Bioinformatics
11 (5),
2016,
pp. 551-560
61.
Computational prediction of nonenzymatic RNA degradation patterns,
Acta Biochimica Polonica
2016,
pp. 1-15
62.
Algorithms solving the Internet shopping optimization problem with price discounts,
Bulletin of the Polish Academy of Sciences Technical Sciences
64 (3),
2016,
pp. 505-516
63.
Understanding Life: A Bioinformatics Perspective,
European Review
2016,
pp. 1-15
64.
New challenges in scheduling theory,
Journal of Scheduling
2016,
pp.1-2
65.
Automated RNA 3D Structure Prediction with RNAComposer,
RNA Structure Determination: Methods and Protocols
2016,
pp. 199-215
66.
Structural alignment of protein descriptors - a combinatorial model,
BMC bioinformatics
17,
2016,
pp.383, doi:10.1186/s12859-016-1237-9
67.
Scheduling on parallel identical machines with late work criterion: Offline and online cases,
Journal of Scheduling
19 (6),
2016,
pp. 729-736
2015
68.
Automated 3D RNA structure prediction using the RNAComposer method for riboswitches,
Methods in Enzymology
2015,
doi:10.1016/bs.mie.2014.10.050
69.
New Challenges in Scheduling Theory,
RAIRO-Operations Research
49 (2),
2015,
335-337, DOI: 10.1051/ro/2014047
70.
Special Issue: Eighth International Colloquium on Graphs and Optimization (GO VIII), 2012 Foreword,
Discrete Applied Mathematics
182,
2015,
1-1 (SI), DOI: 10.1016/j.dam.2014.11.011
71.
Optimal pathway reconstruction on 3D NMR maps,
DISCRETE APPLIED MATHEMATICS
182,
2015,
134-149 (SI), DOI: 10.1016/j.dam.2014.04.010
72.
A study of scheduling problems with preemptions on multi-core computers with GPU accelerators,
Discrete Applied Mathematics
196,
2015,
pp. 72-82
73.
Cloud Brokering: Current Practices and Upcoming Challenges,
IEEE Cloud Computing
2,
2015,
(2)
74.
New in silico approach to assessing RNA secondary structures with non-canonical base pairs,
BMC Bioinformatics
16:276,
2015,
DOI: 10.1186/s12859-015-0718-6
75.
Good Laboratory Practice for optimization research,
Journal of the Operational Research Society
2015,
doi: 10.1057/jors.2015.77
76.
Building the Library of Rna 3D Nucleotide Conformations Using the Clustering Approach,
International Journal of Applied Mathematics and Computer Science
20,
2015,
pp.689-700
77.
RNAssess a web server for quality assessment of RNA 3D structures,
Nucleic Acids Research
2015,
doi: 10.1093/nar/gkv557
78.
New perspectives in scheduling theory,
Journal of Scheduling
18,
2015,
pp. 333-334.
2014
79.
Recent advances in computational biology, bioinformatics, medicine, and healthcare by modern OR,
CEJOR
22,
2014,
pp. 427-430.
80.
Unified encoding for hyper-heuristics with application to bioinformatics,
CEJOR
22,
2014,
pp.567-589.
81.
Multi-agent model of hepatitis c virus infection,
Artificial Intelligence in Medicine
60,
2014,
pp. 123-131
82.
The Orderly Colored Longest Path Problem - a survey of applications and new algorithms,
RAIRO Operations Research
48(1),
2014,
pp.25-51.
83.
Internet shopping with price sensitive discounts,
4OR-A Quarterly for Operations Research
12,
2014,
pp. 35-48.
84.
Reference alignment based methods for quality evaluation of multiple sequence alignment - a survey,
Current Bioinformatics
9,
2014,
pp. 44-56.
85.
Preprocessing and storing high-throughput sequencing data,
Computational Methods in Science and Technology
20,
2014,
pp. 9-20
86.
Optimal pathway reconstruction on 3D NMR maps,
Discrete Applied Mathematics
2014,
doi:10.1016/j.dam.2014.04.010
87.
Erratum to: Internet shopping with price-sensitive discounts,
4OR-A Quarterly for Operations Research
12,
2014,
pp 403-406
88.
Sorting signal targeting mRNA into hepatic extracellular vesicles,
RNA Biology
7,
2014,
pp. 836-844
89.
RNApdbee-a webserver to derive secondary structures from pdb files of knotted and unknotted RNAs,
Nucleic Acid Research
42,
2014,
pp. W368-W372
2013
90.
G-MSA - GPU-based, fast and accurate algorithm for multiple sequence alignment,
Journal of Parallel and Distributed Computing
73,
2013,
pp. 32-41.
91.
DNA sequence assembly involving an acyclic graph model,
Foundations of Computing and Decision Sciences
38,
2013,
pp. 25-34.
92.
MLP accompanied beam search for the resonance assignment problem,
Journal of Heuristics
19(3),
2013,
pp. 443-464.
93.
RNAlyzer - novel approach for quality analysis of RNA structural models,
Nucleic Acid Research
41,
2013,
pp. 5978-5990
94.
A hyper-heuristic approach to sequencing by hybridization of DNA sequences,
Annals of Operations Research
207 (1),
2013,
pp. 27-41
95.
New trends in scheduling,
Journal of Scheduling
16,
2013,
pp.347-348
96.
Modelang -- a new approach for experts-friendly viral infections modeling,
Computational and Mathematical Methods in Medicine
2013,
2013,
pp. 1-8.
97.
G-DNA - a highly efficient multi-GPU/MPI tool for aligning nucleotide reads,
Bulletin of the Polish Academy of Sciences-Technical Sciences
61(4),
2013,
pp. 989–992
2012
98.
GeVaDSs - decision support system for novel Genetic Vaccine development process,
BMC Bioinformatics
2012,
pp. 13-91
99.
Complexity issues in computational biology,
Fundamenta Informaticae
118,
2012,
pp. 385-401
100.
Editorial: new branches, old roots,
Journal of Scheduling
15,
2012,
pp. 399-401
101.
A simulated annealing hyper-heuristic methodology for flexible decision support,
4OR-A Quarterly Journal of Operations Research
10,
2012,
pp. 43-66
102.
Highly efficient parallel approach to the next-generation DNA sequencing,
Lecture Notes in Computer Science
7204,
2012,
pp. 262-271
103.
Reduced-by-matching graphs: toward simplifying Hamiltonian circuit problem,
Fundamenta Informaticae
118,
2012,
pp. 225-244
104.
Poseidon: An information retrieval and extraction system for metagenomic marine science,
Ecological Informatics
12,
2012,
pp. 10-15
105.
New algorithms for coupled tasks scheduling- a survey,
RAIRO - Operations Research
46,
2012,
pp. 335-353
106.
Automated 3D structure composition for large RNAs,
Nucleic Acid Research
40(14),
2012,
e112
107.
G-PAS 2.0-an improved version of protein alignment tool with an efficient backtracking routine on multiple GPUs,
Bulletin of the Polish Academy of Sciences-Technical Sciences
60,
2012,
pp. 491-494
2011
108.
The Simplified Partial Digest Problem: approximation and a graph-theoretic model,
European Journal of Operational Research
208,
2011,
pp. 142-152
109.
Adaptive memory programming: local search parallel algorithms for phylogenetic tree construction,
Annals of Operations Research
183,
2011,
pp. 75-94
110.
A parallel branch and bound approach to the rectangular guillotine strip cutting problem,
INFORMS J. on Computing
23,
2011,
pp. 15-25
111.
RNA Partial Degradation Problem: motivation, complexity, algorithm,
Journal of Computational Biology
18,
2011,
pp. 1-14
112.
Berth and quay crane allocation: a moldable task scheduling model,
Journal of the Operational Research Society
62,
2011,
pp. 1189-1197
113.
Some aspects of the anemia of chronic disorders modeled and analyzed by petri net based approach,
Bioprocess and Biosystems Engineering
34,
2011,
pp. 581-595
114.
Protein alignment algorithms with an efficient backtracking routine on multiple GPUs,
BMC Bioinformatics
12,
2011,
181
115.
Combinatorial Optimization Issues in Scheduling,
Journal of Scheduling
14,
2011,
pp. 221-223.
116.
On the complexity of the independent set problem in triangle graphs,
Discrete Mathematics
311,
2011,
pp. 1670-1680
117.
DomAns - pattern based method for protein domain boundaries prediction and analysis,
Foundations of Computing and Decision Sciences
36,
2011,
pp. 99-119
2010
118.
Some operations research methods for analyzing protein sequences and structures,
Annals of Operations Research
175,
2010,
pp. 9-35
119.
Towards prediction of HCV therapy efficiency,
Computational and Mathematical Methods in Medicine
11,
2010,
pp. 185-199
120.
Genetic and tabu search algorithms for peptide assembly problems,
RAIRO - Operations Research
44,
2010,
pp. 153-166
121.
Internet Shopping Optimization problem,
International Journal of Applied Mathematics and Computer Science
20,
2010,
pp. 385-390
122.
Scheduling of coupled tasks with unit processing times,
Journal of Scheduling
13,
2010,
pp. 453-461
123.
New challenges in scheduling theory,
Journal of Scheduling
13,
2010,
pp. 451-452
124.
Hepatitis C virus quasispecies in chronically infected children subjected to interferon–ribavirin therapy,
Archives of Virology
155,
2010,
pp. 1977-1987
125.
RNA FRABASE 2.0: an advanced web-accessible database with the capacity to search the three-dimensional fragments within RNA structures,
BMC Bioinformatics
11,
2010,
231
126.
Flexibility of Dicer studied by implicit solvent molecular dynamics simulations,
Computational Methods in Science and Technology
16,
2010,
pp. 97-104
127.
Operations Research Models for Computational Biology, Bioinformatics and Medicine,
J Math Model Algor
9,
2010,
pp. 209–211
2009
128.
New insights into the human body iron metabolism analyzed by a Petri net based approach,
Biosystems
96,
2009,
pp. 104-113
129.
Translational and structural analysis of the shortest legume enod40 gene in Lupinus luteus.,
Acta Biochimica Polonica
56,
2009,
pp. 89-102
130.
Whole genome assembly from 454 sequencing output via modified DNA graph concept,
Computational Biology and Chemistry
33,
2009,
pp. 224-230
131.
The Knapsack-Lightening problem and its application to scheduling HRT tasks,
Bulletin of the Polish Academy of Sciences, Technical Sciences
57,
2009,
pp. 71-77
132.
Modeling the process of human body iron homeostasis using a variant of timed Petri nets,
Discrete Applied Mathematics
157,
2009,
pp. 2221-2231
133.
Two types of viral quasispecies identified in children suffering from chronic hepatitis C,
Journal of Hepatology
55:27,
2009,
pp.
134.
Zastosowanie sieci Petriego do modelowania procesów biologicznych,
Kosmos
58 (1-2),
2009,
pp. 79-88
135.
System wspomagania wytwarzania i analizy szczepionek genetycznych,
Kosmos
58 (1-2),
2009,
pp. 113-126
136.
On the approximability of the Simplified Partial Digest problem,
Discrete Applied Mathematics
157,
2009,
pp. 3586-3592
137.
Sequence Similarity Based Method For Protein Function Prediction,
Foundations of Computing and Decision Sciences
34,
2009,
pp. 173-192
138.
Some remarks on evaluation of quality of the multiple sequence alignment based on BAliBASE benchmark,
International Journal of Applied Mathematics and Computer Science
19,
2009,
pp. 675-678
2008
139.
Web and Grid technologies in bioinformatics, computational and systems biology: a review,
Current Bioinformatics
3,
2008,
pp. 10-31
140.
Graph reduction and its application to DNA sequence assembly,
Bulletin of the Polish Academy of Sciences, Technical Sciences
56,
2008,
pp. 65-70
141.
Emerging scheduling applications,
Journal of Scheduling
11,
2008,
pp. 309-310
142.
Plant phenolic secondary metabolites mass spectra database,
Acta Biochimica Polonica
55, Suppl.2,
2008,
P3.9
143.
Finding Hamiltonian circuits in quasi-adjoint graphs,
Discrete Applied Mathematics
156,
2008,
pp.2573-2580
144.
Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date,
Computers & Operations Research
35,
2008,
pp.574-599
2007
145.
An analysis of the Petri net based model of the human body iron homeostasis process,
Computational Biology and Chemistry
31,
2007,
pp.1-10
146.
Petri net based model of the body iron homeostasis,
Journal of Biomedical Informatics
40,
2007,
pp.476-485
147.
A note on two-machine job shop with weighted late work criterion,
Journal of Scheduling
10,
2007,
pp.87-95
148.
Selected papers from the Dagstuhl workshop - On scheduling in computer and manufacturing systems,
Journal of Scheduling
10,
2007,
pp.85-86
149.
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem,
Discrete Optimization
4,
2007,
pp.154-162
150.
New machine learning methods for prediction of protein secondary structure,
Control and Cybernetics
36,
2007,
pp.183-201
151.
3D-Judge - A Metaserver Approach to Protein Structure Prediction,
Foundations of Computing and Decision Sciences
32,
2007,
pp. 3-14
152.
ProCKSI: A Decision Support System for Protein (Structure) Comparison, Knowledge, Similarity and Information,
BMC Bioinformatics
14:56,
2007,
pp.
153.
Simplified partial digest problem: enumerative and dynamic programming algorithms,
IEEE/ACM Trans. on Computational Biology and Bioinformatics
4,
2007,
pp. 668-680
2006
154.
Preemptable malleable task scheduling problem,
IEEE Transactions on Computers
55,
2006,
pp.486-490
155.
From HP Lattice Models to Real Proteins: Coordination Number Prediction Using Learning Classifier Systems,
Lecture Notes in Computer Science
3907,
2006,
pp.208-220
156.
Computational complexity of isothermic DNA sequencing by hybridization,
Discrete Applied Mathematics
154,
2006,
pp.718-729
157.
Some operations research methods for analyzing protein sequences and structures,
4OR: A Quarterly Journal of Operations Research
4,
2006,
pp.91 - 123
158.
Dealing with repetitions in sequencing by hybridization,
Computational Biology and Chemistry
30,
2006,
pp 313-320
159.
The parallel genetic algorithm for designing DNA randomizations in a combinatorial protein experiment,
Lecture Notes In Computer Science
3911,
2006,
pp. 1097-1105
160.
DNA sequencing by hybridization via genetic search,
Operations Research
54,
2006,
pp.1185-1192
161.
Candidate mRNAs interacting with fertility protein PUMILIO2 in the human germ line,
Reproductive Biology
6,
2006,
pp.37-42
162.
Human fertility protein PUMILIO2 interacts in vitro with testis mRNA encoding Cdc42 effector 3 (CEP3),
Reproductive Biology
6,
2006,
pp.103-113
2005
163.
An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints,
European Journal of Operational Research
161,
2005,
pp.3-10
164.
Selected combinatiorial problems of computational biology,
European Journal of Operational Research
161,
2005,
pp.585-597
165.
A novel representation of graph structures in web mining and data analysis,
Omega
33,
2005,
pp.65-71
166.
The two-machine flow-shop problem with weighted late work criterion and common due-date,
European Journal of Operational Research
165,
2005,
pp.408-415
167.
Evolutionary approaches to DNA sequencing with errors,
Annals of Operations Research
138,
2005,
pp.67-78
168.
Multistage isothermic sequencing by hybridization,
Computational Biology and Chemistry
29,
2005,
pp.69-77
169.
Homologous Crossovers among Molecules of Brome Mosaic Bromovirus RNA1 or RNA2 Segments in vivo,
Journal of Virology
79,
2005,
pp.5732-5742
170.
Application of tabu search strategy for finding low energy structure of protein,
Artificial Intelligence in Medicine
35,
2005,
pp.135-145
171.
Predicting secondary structures of proteins,
IEEE Engineering in Medicine and Biology
24,
2005,
pp.88-94
172.
RNA tertiary structure determination: NOE pathways construction by tabu search,
Bioinformatics
21,
2005,
pp.2356-2361
173.
Tabu search method for determining sequences of amino acids in long polypeptides,
Lecture Notes in Computer Science
3449,
2005,
pp. 22-32
174.
Metaheuristics for late work minimization in two-machine flow shops with common due date,
Lecture Notes in Artificial Intelligence
3698,
2005,
pp. 222- 234
175.
On graph theoretical models for peptide sequence assembly,
Foundations of Computing and Decision Sciences
30,
2005,
pp. 183-191
176.
Computational methods in diagnostics of chronic hepatitis C,
Bulletin of the Polish Academy of Sciences, Technical Sciences
53,
2005,
pp. 273-281
177.
Znaczenie kliniczne zmian w populacji HCV w pierwszych tygodniach leczenia przewlekłgo zapalenia wątroby typu C interferonem i rybawiryną,
Przegląd Epidemiologiczny
59,
2005,
pp. 581-590
178.
A comparison of solution procedures for two-machine flow shop scheduling with late work criterion,
Computers and Industrial Engineering
49,
2005,
pp. 611-624
179.
Recent advances in scheduling in computer and manufacturing systems,
European Journal of Operational Research
164,
2005,
pp.573-574
180.
Projektowanie macierzy DNA,
Na Pograniczu Chemii i Biologii
XII,
2005,
pp. 513-530
181.
Combinatorial optimization in DNA mapping - a computational thread of the Simplified Partial Digest Problem,
RAIRO - Operations Research
39,
2005,
pp.227-242
2004
182.
Scheduling malleable tasks on parallel processors to minimize the makespan,
Annals of Operations Research
129,
2004,
pp. 65-80
183.
Open shop scheduling problems with late work criteria,
Discrete Applied Mathematics
134,
2004,
pp. 1-24
184.
On the complexity of the Double Digest Problem,
Control and Cybernetics
33,
2004,
pp. 133-140
185.
DNA sequencing - tabu and scatter search combined,
INFORMS Journal on Computing
16,
2004,
pp. 232-240
186.
Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries,
Computational Biology and Chemistry
28,
2004,
pp. 11-19
187.
An algorithm for an automatic NOE pathways analysis of 2D NMR spectra of RNA duplexes,
Journal of Computational Biology
11,
2004,
pp. 167-183
188.
Parallel tabu search approaches for two-dimensional cutting,
Parallel Processing Letters
14,
2004,
pp. 23-32
189.
Parallel algorithms for evolutionary history reconstruction,
Lecture Notes in Computer Science
3019,
2004,
pp. 1138-1145
190.
A tabu search strategy for finding low energy structures of proteins in HP-model,
Computational Methods in Science and Technology
10,
2004,
pp. 7-19
191.
Sequencing by hybridization with isothermic oligonucleotide libraries,
Discrete Applied Mathematics
145,
2004,
pp. 40-51
192.
Assembling SARS-CoV genome - new method based on graph theoretic approach,
Acta Biochimica Polonica
51,
2004,
pp.983-993
193.
Evolutionary algorithm for a reconstruction of NOE paths in NMR spectra of RNA chain,
Bulletin of the Polish Academy of Sciences, Technical Sciences
52,
2004,
pp.221-230
194.
Flow shop scheduling with late work criterion - choosing the best solution strategy,
Lecture Notes in Computer Science
3285,
2004,
pp.68-75
2003
195.
Complexity of DNA sequencing by hybridization,
Theoretical Computer Science
290,
2003,
pp.1459-1473
196.
DNA based algorithms for some scheduling problems,
Lecture Notes in Computer Science
2611,
2003,
pp. 673-683
197.
New algorithm for the Simplified Partial Digest Problem,
Lecture Notes in Bioinformatics
2812,
2003,
pp. 95-110
198.
Scheduling multiprocessor tasks on parallel processors with limited availibility,
European Journal of Operational Research
149,
2003,
pp. 377-389
199.
Artificial evolution. An algorithm for an exploration of the amino acid sequences spaces,
Foundations of Computing and Decision Sciences
28,
2003,
pp. 195-209
2002
200.
Scheduling jobs in open shops with limited machine availability,
RAIRO-RO
36,
2002,
pp.149-156
201.
Scheduling multiprocessor tasks on two parallel processors,
RAIRO-RO
36,
2002,
pp. 37-51
202.
Hybrid genetic algorithm for DNA sequencing with errors,
Journal of Heuristics
8,
2002,
pp. 495-502
203.
On the recognition of de Bruijn graphs and their induced subgraphs,
Discrete Mathematics
245,
2002,
pp.81-92
204.
Flow shops with limited machine availability,
European Journal of Operational Research
136,
2002,
pp.528-540
205.
Linear and quadratic algorithms for scheduling chains and opposite chains,
European Journal of Operational Research
137,
2002,
pp. 248-264
206.
The complexity of two group scheduling problems,
Journal of Scheduling
5,
2002,
pp.477-485
207.
Review of properties of different precedence graphs for scheduling problems,
European Journal of Operational Research
142,
2002,
pp.435-443
208.
A new parallel approach for multi-dimensional packing problem,
Lecture Notes in Computer Science
2328,
2002,
pp.194-201
209.
A heuristic managing errors for DNA sequencing,
Bioinformatics
18,
2002,
pp. 652-660
210.
Scheduling production tasks in a two stage FMS,
International Journal of Production Research
40,
2002,
pp.4341-4352
211.
Szeregowanie zadań elastycznych,
Zeszyty Naukowe Politechniki Śląskiej s. Automatyka
134,
2002,
pp.67-80
212.
Scheduling coupled tasks on a single processor,
Zeszyty Naukowe Politechniki Śląskiej s. Automatyka
134,
2002,
pp.53-66
213.
Lokalizacja i sterowanie maszynami z wykorzystaniem systemu GPS,
Przegląd Komunalny
10,
2002,
pp.44-46
214.
DNA sequencing, Eulerian graphs, and the exact perfect matching problem,
Lecture Notes in Computer Science
2573,
2002,
pp.13-24
215.
A note on the complexity of scheduling coupled tasks on a single processor,
Journal of the Brazilan Computer Society
7,
2002,
pp.23-26
216.
Zarządzanie parkiem maszyn roboczych z aktywnej bazy danych,
Problemy Maszyn Roboczych
20,
2002,
pp. 23-32
217.
System monitorowania maszyn roboczych,
Problemy Maszyn Roboczych
20,
2002,
pp. 33-40
2001
218.
Scheduling complete trees on two uniform processors with integer speed ratios and communication delays,
Parallel Processing Letters
10,
2001,
pp. 267-277
219.
Prediction of protein secondary structure using Logical Analysis of Data algorithm,
Computational Methods in Science and Technology
7,
2001,
pp. 7-25
220.
Suboptimal approaches to scheduling malleable tasks,
Computational Methods in Science and Technology
6,
2001,
pp. 25-41
221.
Drzewa filogenetyczne - informatyczne problemy badawcze,
ProDialog
12,
2001,
pp. 1-32
222.
Integracja procesów logistycznych i monitorowania stanów maszyn roboczych,
Zeszyty Naukowe Politechniki Opolskiej s. Mechanika
64,
2001,
pp. 23-27
223.
Construction of DNA restriction maps based on a simplified experiment,
Bioinformatics
17,
2001,
pp. 398-404
224.
Heuristic algorithms for the two-machine flowshop with limited machine availability,
Omega
29,
2001,
pp.599-608
225.
Approximation Algorithms for Scheduling Independent Malleable Tasks,
Lecture Notes in Computer Science
2150,
2001,
pp. 198-203
226.
Clustal W algorithm for multiple sequence alignment revisited,
Foundations of Computing and Decision Sciences
26,
2001,
pp. 189-196
2000
227.
Tabu search for DNA sequencing with false negatives and false positivies,
European Journal of Operational Research
125,
2000,
pp. 257-265
228.
Scheduling preemptable tasks on parallel processors with limited availability,
Parallel Computing
26,
2000,
pp. 1195-1211
229.
Parallel branch and bound algorithm for the flow shop problem with limited machine availability,
Bulletin of the Polish Academy of Sciences, s.Computer Science
48,
2000,
pp. 105-115
230.
The disjunctive machine representation of the job shop scheduling problem,
European Journal of Operational Research
127,
2000,
pp. 317-331
231.
Scheduling malleable tasks with convex processing speed functions,
Computation y Sistemas
4,
2000,
pp. 158-165
1999
232.
Divisible task scheduling - concept and verification,
Parallel Computing
25,
1999,
pp.87-99
233.
A note on disjunctive graph representation,
Bulletin of the Polish Academy of Sciences, s.Computer Science
47,
1999,
pp.103-114
234.
Scheduling tasks and vehicles in a flexible manufacturing systems,
Foundations of Computing and Decision Sciences
24,
1999,
pp.3-12
235.
DNA sequencing with positive and negative errors,
Journal of Computational Biology
6,
1999,
pp.113-123
236.
On some properties of DNA graphs,
Discrete Applied Mathematics
98,
1999,
pp.1-19
237.
Scheduling a divisible task in a 2-dimensional toroidal mesh,
Discrete Applied Mathematics
94,
1999,
pp.35-50
238.
Informtyka a biologia obliczeniowa,
Pro Dialog
8,
1999,
pp.11-26
239.
Heuristic algorithm for schedule optimization in FMS environment,
Foundations of Computing and Decision Science
24,
1999,
pp.189-207
240.
Scheduling of client-server applications,
International Transactions in Operational Research
6,
1999,
pp. 345-363
1998
241.
Resource constrained chain scheduling of UET jobs on two machines,
Operations Research
46,
1998,
pp.742-746
242.
Szeregowanie zadań w systemach z ograniczoną dostępnocią maszyn,
Zeszyty Naukowe Politechniki Śląskiej s.Automatyka
123,
1998,
pp.55-63
243.
Nowa reprezentacja maszynowa grafu dysjunkcyjnego dla problemu szeregowania w ogólnym systemie obsługi,
Zeszyty Naukowe Politechniki Śląskiej s.Automatyka
123,
1998,
pp.45-54
244.
Scheduling vehicles in a cyclic flexible flowshops,
European J. of Automation
32,
1998,
pp.441-452
245.
Modelowanie szeregowania zadań i wózków w elastycznych przepływowych systemach obsługi,
Zeszyty Naukowe Politechniki Śląskiej s.Automatyka
124,
1998,
pp.9-17
1997
246.
Sequential and parallel algorithms for DNA sequencing,
CABIOS
13,
1997,
pp.151-158
247.
Selected combinatorial optimization problems arising in molecular biology,
Ricerca Operativa
26,
1997,
pp.35-63
248.
Preemptive multiprocessor tasks scheduling with release timesand time windows,
Annals of Operations Research
70,
1997,
pp-43-55
249.
Linear algorithms for preeemptive scheduling of multiprocessor tasks subject to minimal lateness,
Discrete Applied Mathematics
72,
1997,
pp.25-46
250.
Distributed processing of divisible jobs with communication startup costs,
Discrete Applied Mathematics
76,
1997,
pp-21-41
251.
Parameter analysis of clusters of melting temperatures of DNA chains,
Computational Methods in Science and Technology
3,
1997,
pp.7-13
1996
252.
Performance limits of a two-dimensional network of load-sharing processors,
Foundations of Computing and Decision Sciences
2,
1996,
pp.3-15
253.
The job shop scheduling problem : Conventional and new solution techniques,
European Journal of Operational Research
93,
1996,
pp.1-33
254.
Scheduling multiprocessor tasks with chain constraints,,
European Journal of Operational Research
94,
1996,
pp.231-241
255.
Scheduling complete in-trees on two uniform processors with communication delays,
Information Processing Letters
58,
1996,
pp-255-263
256.
Deadline scheduling of multiprocessor tasks,,
Discrete Applied Mathematics
65,
1996,
pp.81-99
257.
Sequential algorithms for DNA sequencing,,
Computational Methods in Science and Technology
1,
1996,
pp.31-42
258.
A comparison of two DNA sequencing methods,,
Computational Methods in Science and Technology
2,
1996,
pp.17-32
1995
259.
A local search approach for two-dimensional irregular cutting,
OR Spektrum
17,
1995,
pp.93-98
260.
Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors,
Annals of Operations Research
58,
1995,
pp.493-517
261.
Scheduling divisible jobs on hypercubes,
Parallel Computing
21,
1995,
pp. 1945-1956
262.
Dwustopniowe studia informatyczne na Politechnice Poznańskiej,
Komputer w Edukacji
4,
1995,
pp. 23-33
1994
263.
Scheduling multiprocessor tasks on three dedicated processors,
Corrigendum Information Processing Letters
49,
1994,
pp.269-270
264.
Vehicle scheduling in two-cycle flexible manufacturing systems,
Mathematical and Computer Modelling
20,
1994,
pp.19-31
265.
Optimal centralized algorithms for store-and-forward deadlock avoidance,
IEEE Trans. Computers
43,
1994,
pp.1333-1338
266.
Scheduling independent multiprocessor tasks on a uniform k-processor system,
Parallel Computing
20,
1994,
pp.15-28
267.
Multiprocessor task scheduling with resource requirements,
Real Time Systems
6,
1994,
pp.37-53
268.
Scheduling preemptive multiprocessor tasks on dedicated processors,
Performance Evaluation
20,
1994,
pp.361-371
269.
Scheduling multiprocessor tasks: A survey,
International Journal of Microcomputer Applications
13,
1994,
pp.89-97
270.
DSS for two-dimensional cutting - new tools improving feasible solution,
Foundations of Computing and Decision Sciences
19,
1994,
pp.285-298
271.
Szeregowanie zadań wieloprocesorowych na alternatywnych zbiorach procesorów dedykowanych,
Zeszyty Naukowe Politechniki Śląskiej s.Automatyka
114,
1994,
pp.13-25
272.
Scheduling with resource management in manufacturing systems,
European J. of Operational Research
76,
1994,
pp.1-14
273.
A note on flexible flowshop scheduling with two-stages,
Foundations of Computing and Decision Sciences
19,
1994,
pp.159-172
274.
Scheduling UET multiprocessor tasks,
Foundations of Computing and Decision Sciences
19,
1994,
pp.273-283
1993
275.
Szeregowanie zadań wieloprocesorowych,
Postępy Cybernetyki
1993,
276.
Algorithms for minimizing maximum lateness with unit length tasks and resource constraints,
Discrete Applied Mathematics
42,
1993,
pp.123-138
277.
Graph theoretical issues in computer networks,
European J. of Operational Research
71,
1993,
pp.1-16
278.
Using a tabu search approach for solving two-dimensional irregular cutting problem,
Annals of Operations Research
41,
1993,
pp.313-325
279.
Szeregowanie zadań wieloprocesorowych w systemach równoległych,
Zeszyty Naukowe Politechniki Śląskiej s.Informatyka
24,
1993,
pp.77-88
280.
Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness,
Information Processing Letters
46,
1993,
pp.109-113
1992
281.
Szeregowanie zadań wieloprocesorowych przed liniami krytycznymi,
Zeszyty Naukowe Politechniki Śląskiej s.Automatyka
109,
1992,
pp.19-28
282.
Defining two-dimensional irregular figures for automatic cutting system,
Foundations of Computing and Decision Sciences
17,
1992,
pp.3-12
283.
Sequencing of robot moves and multiple parts in a robotic cell,
International Journal of FMS
4,
1992,
pp.331-358
284.
Optimization aspects of deadlock prevention in store-and-forward networks,
European J.of Operational Research
57,
1992,
pp.1-12
285.
Scheduling multiprocessor tasks on three dedicated processors,
Information Processing Letters
41,
1992,
pp.275-280
1991
286.
A preemptive open shop scheduling problem with one resource,
Operations Research Letters
10,
1991,
pp.9-15
287.
Scheduling tasks and vehicles in a flexible manufacturing system,
International Journal of FMS
4,
1991,
pp.5-16
288.
Preemptive open shop scheduling with renewable and nonrenewable resources,
Discrete Applied Mathematics
35,
1991,
pp.205-219
289.
Dynamic programming algorithm for a FMS Scheduling problem,
Bull. of the Polish Acad. of Sci. (Tech. Sci.)
39,
1991,
pp.345-350
290.
Mathematical programming formulations for machine scheduling,
European Journal of Operational Research
51,
1991,
pp.283-300
1990
291.
Nowe modele w teorii szeregowania zadań – złożonoć obliczeniowa problemów szeregowania zadań,
Zeszyty Naukowe Politechniki Rzeszowskiej
72,
1990,
pp.10-12
292.
Problemy zapobiegania zakleszczeniom w sieciach komputerowych z komutacją pakietów,
Zeszyty Naukowe Politechniki Rzeszowskiej
72,
1990,
pp.13-14
293.
Scheduling independent two processor tasks on a uniform duo-processor system,
Discrete Applied Mathematics
28,
1990,
pp.11-20
294.
O pewnym problemie szeregowania detali i wózków w elastycznym systemie produkcyjnym,
Zeszyty Naukowe Politechniki Śląskiej s.Automatyka
101,
1990,
pp.325-331
295.
Minimizing schedule length in duo-processor systems,
Wissenschaftlische Berichte der TH Leipzig
11,
1990,
pp.4-10
296.
Decision support system for cutting irregular shapes - implementation and experimental comparison,
Foundations of Computing and Decision Sciences
15,
1990,
pp.121-129
1989
297.
Routing and scheduling within a job-shop framework,
Foundations of Control Engineering
14,
1989,
pp.53-60
1988
298.
New trends in scheduling theory,
European J.of Operational Research
37,
1988,
pp.303-317
299.
Scheduling unit-time tasks on flow-shops under resource constraints,
Annals of Operations Research
16,
1988,
pp.255-266
300.
System wspomagania podejmowania decyzji w zagadnieniach rozkroju,
Zeszyty Naukowe Politechniki Śląskiej
94,
1988,
pp.29-39
301.
Szeregowanie zadań wieloprocesorowych w systemie jednorodnych duoprocesorów,
Zeszyty Naukowe Politechniki Śląskiej
94,
1988,
pp.41-48
302.
Optimal algorithm for prevention of different deadlock types in store-and-forward computer networks,
Bull. of the Polish Acad. of Sci. (Tech. Sci.)
36,
1988,
pp.65-74
1987
303.
Time-stamps approach to store-and-forward deadlock prevention,
IEEE Trans. on Communications
35,
1987,
pp.490-495
304.
Time-stamps approach to prevention of different deadlock types in store-and-forward networks,
IEEE Trans. on Communications
35,
1987,
pp.564-566
305.
Złożonoć obliczeniowa problemów szeregowania zadań na maszynach z ograniczeniami zasobowymi,
Archiwum Automatyki i Telemechaniki
28,
1987,
pp.3-33
306.
Selected topics in scheduling theory,
Annals of Discrete Mathematics
31,
1987,
pp.1-60
307.
Minimizing mean weighted execution time loss on identical and uniform processors,
Information Processing Letters
24,
1987,
pp.259-263
308.
Minimizing mean flow time with parallel processors and resource constraints,
Acta Informatica
24,
1987,
pp.513-524
1986
309.
Scheduling tasks on two processors with deadlines and additional resources,
European J. of Operational Research
25,
1986,
pp.364-370
310.
Scheduling multiprocesor tasks to minimize schedule length,
IEEE Trans. on Computers
35,
1986,
pp.389-393
1985
311.
Dynamic storage allocation with limited compaction-complexity and some practical implications,
Discrete Applied Mathematics
10,
1985,
pp.241-253
1984
312.
Minimizing mean weighted information loss with preemptible tasks and parallel processors,
Technology and Science of Informatics
1984,
pp.415-420
313.
Deadlock resistant flow control procedures for store-and-forward networks,
IEEE Trans. on Communications CoM-32
1984,
pp.884-887
314.
O niektórych problemach szeregowania zadań wieloprocesorowych,
Zeszyty Naukowe Politechniki Śląskiej,s.Automatyka
z.84,
1984,
pp.39-48
315.
Scheduling independent 2-processors tasks to minimize schedule length,
Information Processing Letters
18,
1984,
pp.267-273
316.
On the complexity of scheduling multiprocessor tasks in micropocessor systems,
Bull. Pol. Ac. Sci. Tech. Sci.
32,
1984,
pp.591-600
1983
317.
Minimizing mean weighted execution time loss on parallel machines,
Methods of Operations Research
52,
1983,
pp.415-425
318.
A polynomial in time algorithm for task scheduling under fixed resources constraints,
Foundations of Control Engineering
8,
1983,
pp.3-7
319.
A linear intime algorithm for restricted bin packing and scheduling problem,
Operations Research Letters
2,
1983,
pp.80-83
320.
Scheduling subject to resource constraints: classification and complexity,
Discrete Applied Mathematics
5,
1983,
pp.11-24
321.
Some properties of binary sequences useful for proving Collatz's conjecture,
Foundations of Control Engineering
8,
1983,
pp.53-63
1982
322.
Wielomianowe algorytmy szeregowania zadań na równoległych maszynach przy ograniczeniach zasobowych,
Zeszyty Naukowe Politechniki Śląskiej s. Automatyka
z.63,
1982,
pp.11-17
1981
323.
Solving the resource constrained deadline scheduling problem via reduction to the network flow problem,
European J. of Operational Research
6,
1981,
pp.75-79
1980
324.
Wielomianowe i pseudowielomianowe algorytmy rozwiązywania problemów kombinatorycznych,
Archiwum Automatyki i Telemechaniki
25,
1980,
pp.355-366
325.
Szeregowanie zadań na dedykowanych maszynach przy ograniczeniach zasobowych,
Zeszyty Naukowe Politechniki Śląskiej s.Automatyka
z.54,
1980,
p.9-17
1979
326.
Deadline scheduling of tasks with ready times and resource constraints,
Information Processing Letters
8,
1979,
pp.60-63
327.
Scheduling tasks on parallel processors under resource constraints to minimize mean finishing time,
Methods of Operations Research
35,
1979,
pp.67-72
1978
328.
Deteministyczne problemy szeregowania zadań na procesorach systemów komputerowych z uwzględnieniem dodatkowych zasobów,
Archiwum Automatyki i Telemechaniki
23,
1978,
pp.485-509
329.
Scheduling to meet deadlines with resource constraints-complexity results,
Tanulmanyok of Hungarian Academy of Sciences
78,
1978,
pp.5-21
1977
330.
Simple algorithms for multiprocessor scheduling to meet deadlines,
Information Processing Letters
6,
1977,
pp.162-164
331.
A strategy for scheduling splittable tasks to reduce schedule length,
Acta Cybernetica
3,
1977,
pp.99-106
332.
Scheduling splittable tasks on parallel processors to minimize schedule length,
MTA SzTAKI Kózlemenyek of Hungarian Academy of Science
18,
1977,
pp.139-147
333.
An automatic revised simplex method for constrained resource network scheduling,
ACM Transactions on Mathematical Software
3,
1977,
pp.295-300
1976
334.
Deadline scheduling of tasks - A survey,
Foundations of Control Engineering
1,
1976,
pp.203-216
335.
Some computational problems of scheduling dependent and preemptive tasks to minimize schedule length,
Foundations of Control Engineering
1,
1976,
pp.75-82
336.
A comparison of two specialized versions of the revised simplex method for finding the time-optimal control of a complex of operations,
Foundations of Control Engineering
1,
1976,
pp.103-122
337.
Deterministyczne problemy szeregowania zadań na równoległych procesorach, Cz.I. Zbiory zadań niezależnych,
Podstawy Sterowania
6,
1976,
pp.155-178
338.
Deterministyczne problemy szeregowania zadań na równoległych procesorach, Cz.II. Zbiory zadań zależnych,
Podstawy Sterowania
6,
1976,
pp.297-320.