Seznam publikací 1999-2003 - KAM

chatventriloquistAI and Robotics

Dec 1, 2013 (3 years and 4 months ago)

123 views

Seznam publikací 1999
-
2003

Knihy a editované sborníky

[1]

M. Fiedler,
J. Kratochvíl
,
J. Nešetřil

(editors), Combinatorics, Graph Theory,
Algorithms and Applications, Proceedings of the 5th Czech and Slovak Symposium,
July 6
-
11, 1998, Czech Agricultural Univer
sity, Prague; published as volume 229(1
-
3)
of Discrete Mathematics, 2001.

[2]

M. Fiedler,
J. Kratochvíl
,
J. Nešetřil

(editors), Graph Theory, Proceedings of the 5th
Czech and Slovak Symposium, July 6
-
11, 1998, Czech Agricultural University,
Prague; published a
s volume 233(1
-
3) of Discrete Mathematics, 2001.

[3]

M. Fiedler,
J. Kratochvíl
,
J. Nešetřil

(editors), Combinatorics, Proceedings of the 5th
Czech and Slovak Symposium, July 6
-
11, 1998, Czech Agricultural University,
Prague; published as volume 235(1
-
3) of Dis
crete Mathematics, 2001.

[4]

H. de Fraysseix
, J. Kratochvíl

(guest editors), Graph Drawing and Representations:
Special Issue on Selected papers from 1999 Symposium on Graph Drawing, Journal
on Graph Algorithms and Applications,

Vol. 6 No 1 (2002), viz
http://
www.cs.brown.edu/publications/jgaa/

[5]

R.L.Graham,
J.Kratochvíl
,
J.Nešetřil
, F.S.Roberts (editors), Contemporary Trends in
Discrete Mathematics (from DIMACS and DIMATIA to the future), DIMACS Series
in Discrete Mathematics and Theoretical Computer Science 49 (1999), American
Mathematical Society, Providence.

[6]

Grosky,
W.I.,
Plášil, F
., (Editors): SOFSEM 2002: Theory and Practice of
Informatics. In: Proceedings of the 29th Conference on Current Trends in Theory and
Practice of Informatics, Springer LNCS 2540, Nov 2002

[7]

J
.
Hajič
,
Disambiguation of Rich Inflection (Computat
ional Morphology of Czech)
,
MFF UK

2002, Praha
.

[8]

J
.
Hajič
,
B
.
Vidová
-
Hladká
,
J
.
Panevová
,
E
.
Hajičová
,
P
.
Sgall
,
P
.
Pajas
,
Prague
Dependency Treebank 1.0 (Final Production Label)
,
CDROM

(2001)
,
CAT:
LDC2001T10., ISBN 1
-
58563
-
212
-
0
.

[9]

E. Hajičová
, Panevová Jar
mila, Sgall Petr
Úvod do teoretické a počítačové
,
Karolinum 2002,
ISBN 80
-
246
-
0470
-
1
.

[10]

V. Jirovský,

Principy počítačů. Matfyzpress, PRAHA, 2000.

[11]

P. Kolman
,
A. Pultr
,
J. Sgall

(editors), Proceedings of the 26th Mathematical
Foundations of Computer Science,
LNCS 2136, Springer
-
Verlag, 2001.

[12]

J. Kratochvíl

(editor), Graph Drawing, Proceedings of the 7th international
symposium on Graph Drawing 1999, LNCS 1731 (1999), Springer
-
Verlag.

[13]

P. Kůrka
: Topological and Symbolic Dynamics. Société Mathématique de France,
Paris 2003

[14]

J. Matoušek
, Geometric Discrepancy, An Illustrated Guide, Springer
-
Verlag, Berlin
etc., 1999.

[15]

J. Matoušek
, Lectures on Discrete Geometry, Graduate Texts in Mathematics 212,
Springer, New York, 2002.

[16]

J. Matoušek
, Using the Borsuk
-
Ulam Theorem. L
ectures on Topological Methods in
Combinatorics and Geometry, Universitext, Springer
-
Verlag, Berlin, 2003.

[17]

J. Matoušek
,
J. Nešetřil
, Kapitoly z

diskrétní matematiky, Karolinum,
377 stran,
Karolinum, Praha 2000, ISBN 80
-
246
-
0084
-
6. Anglický překlad
Invitation to Discrete
Mathematics, Oxford University Press 2001. Německý překlad
Diskrete Matematik.
Eine Entdeckungsreise, Spr
inger
-
Lehrbuch, Berlin 2002. Japonský překlad
Springer
-
Verlag, Tokyo 2003.

[18]

J. Nešetřil

(editor): Algorithms
-

ESA '99. 7th annual European symposium, Prague,
Czech Republic, July 16
--
18, 1999, Lecture Notes in Computer Science 1643 (1999),
Springer, 552 st
ran

[19]

J. Nešetřil

(guest editor), Selected papers from European Symposium on Algorithms
1998 (ESA’98), Theoretical Computer Science 287(2) (2002), Elsevier.

[20]

J. Nešetřil
, M. Noy, O. Serra (editors), Proceedings of EuroComb 2001, Discrete
Math. 273 (2003),
Els
evier
.

[21]

Panevová Jarmila,
Hajičová Eva
, Sgall Petr Introduction to Theoretical and
Computational Linguistics 2002 , Karolinum

[22]

P
.
Pecina
,
M
.
Holub
,
Sémanticky signifikantní kolokace
,
MFF UK

2002, Praha
.

Kapitoly v

knih
ách

[23]

J. Matoušek
: Derandomization in co
mputational geometry, in Handbook of
Computational Geometry, North
-
Holland, Amstredam, 2000, pages 559
-
596

[24]

J. Pokorný
, XML: A Challenge for Databases? Chapter 13 in Contemporary Trends
in Systems Development, Kluwer Academic Publishers, Boston, 2001, pp.
147
-
164.

[25]

Pokorný J.
, Dealing with Dimensions in Data Warehousing. Chapter 13 in
Knowledge Discovery for Business Information Systems, Kluwer Academic
Publishers, Boston, 2000.

[26]

Pokorný J,

Data Warehouses: A Modelling Perspective. Chapter 6 in Evolution and
Challenges in System Development, Kluwer Academic/Plenum Press Publ., 1999,
pp.59
-
71.

[27]

Pultr
, Frames, Handbook of Algebra, Vol. 3, Elsevier, Amsterdam 2003, 791
-
858.

Patenty

[28]

V. Jirovský,

Zapojení pro obousměrný přenos informace optickým vláknem.Úřad
průmys
lového vlastnictví, Praha, 1999, patent

[29]

V. Jirovský,

Zapojení pro řízení a monitorování prvků kabelové televize. Úřad
průmyslového vlastnictví, Praha, 1999, patent

[30]

V. Jirovský,

Zapojení pro sloučení optických signálů v kanále s časovým
multiplexem. Úřad pr
ůmyslového vlastnictví, Praha, 1999, patent

Původní vědecké články v

mezinárodních časopisech a sbornících
recenzovaných konferencí

Diskrétní matematika a teoretická informatika

[31]

J. Adamec,

J. Nešetřil,
Towards an aesthetic invariant for graph drawing, Pr
oceedings
9th International Symposium, Graph Drawing 2001; Lecture Notes in Computer
Science vol. 2265, Springer
-
Verlag, 2002, 287
-
296

[32]

J. Adámek,
V. Koubek
, J. Velebil, A duality between infinitary varieties and
algebraic theories, Comment. Math. Univ. Ca
rolinae 41 (2000), 529
-
541.

[33]

J. Adámek,
V. Koubek

and V. Trnková, How large are left exact functors?, Theory
and Appl. of Categories (electronic) 8 (2001), 377
-
390

[34]

H.
-
K. Ahn, M. de Berg, P. Bose, S.
-
W. Cheng, D. Halperin,
J. Matoušek
, O.
Schwarzkopf, Separa
ting an object from its cast, Computer
-
Aided Design 34 (2002)
547
-
559.

[35]

H.
-
K.Ahn, O. Cheong,
J. Matoušek
, A. Vigneron: Reachability by paths of bounded
curvature in convex polygons, Proc. 16th ACM Sympos. Comput. Geom. 2000

[36]

J. Alber,
J. Fiala
, Geometric sep
aration and exact solutions for the parameterized
independent set problem on disk graphs, Proceedings of 17th Theoretical Computer
Science (TCS'02), IFIP Conference Proceedings 223 (2002), Kluwer, 26
-
37.

[37]

M.H. Albert, M.D. Atkinson,
M. Klazar
, The enumera
tion of simple permutations, J.
of Integer Sequences 6 (2003), article 03.4.4, 18 pages.

[38]

H. Albrecher,
J. Matoušek
, R. Tichy: Discrepancy of point sequences on fractal sets,
Publicationes Mathematicae Debrecen, 56(2000) 233
-
249

[39]

N. Alon, G. Kalai,
J. Matouš
ek
, R. Meshulam, Transversal numbers for hypergraphs
arising in geometry, Adv. Appl. Math. 29 (2002) 79
-
101.

[40]

N. Alon,
P. Pudlák
: Constructive lower bounds for off
-
diagonal Ramsey numbers,
Israel Journ. of Math. 122 (2001), 243
-
251.

[41]

N. Alon,
P. Pudlák
, Equ
ilateral sets in l
_
p, Geometric and Functional Analysis 13
(2003), 467
-
482.

[42]

Amit, N. Linial,
J. Matoušek
, Random lifts of graphs III: Independence and
chromatic number, Rand. Struct. Algo. 20 (2002) 1
-
22.

[43]

Atserias, N. Galesi,
P. Pudlák
, Monotone simulation
s of nonmonotone proofs, J. of
Computer and System Sciences 65 (2002), 626
-
638.

[44]

L. Babel, T. Kloks,
J.Kratochvíl
, D. Kratsch, H. Müller and S. Olariu: Efficient
algorithms for graphs with few $P_4$s, Discrete Mathematics 235 (2001) 29
-
51

[45]

R. Babilon
,
J.
Matoušek
,
J. Maxová
,
P. Valtr
, Low
-
distortion embeddings of trees,
Proceedings 9th International Symposium Graph Drawing 2001, LNCS 2265 (2002),
Springer
-
Verlag, 343
-
351.

[46]

R. Babilon
,
H. Nyklová
,
O. Pangrác
,
J. Vondrák
, Visibility Representations of
Comple
te Graphs, Proceedings 7th International Symposium Graph Drawing 1999,
LNCS 1731 (1999), Springer
-
Verlag, 333
-
340.

[47]

E. Bampis, M. Caramia,
J. Fiala
, A. V. Fishkin, A. Iovanella, Scheduling of
independent dedicated multiprocessor tasks, Proceedings of 13th

Algorithms and
Computation (ISAAC'02), LNCS 2518 (2002), Springer
-
Verlag, 391
-
402.

[48]

B. Banaschewski,
A. Pultr
, A constructive view of complete regularity, Kyungpook
Mathematical Journal 43 (2003) 257
-
262.

[49]

B. Banaschewski,
A. Pultr
, Adjointness aspects of

the down
-
set functor, Appl.Categ.
Structures 9 (2001), 418
-
436.

[50]

B. Banaschewski,
A. Pultr
, Scott Information Systems, Frames and Domains,
Mathematik
-
Arbeitspapiere 54, Proceedings of the Conference "Categorical Methods
in Algebra and Topology" (2000), 3
5
-
46.

[51]

I. Bárány,
J. Matoušek
, A fractional Helly theorem for convex lattice sets, Adv.
Math. 174 (2003) 227
-
235.

[52]

I. Bárány,
J. Matoušek
, Equipartition of two measures by a 4
-
fan, Discr. Comput.
Geom. 27 (2002), 293
-
302.

[53]

I. Bárány ,
J. Matoušek
, Simultaneo
us partitions of measures by k
-
fans, Discr.
Comput. Geom. 25,3(2001) 317
-
334.

[54]

T. Bárta, D. Opěla, P. Pyrih,
R. Šámal
, A Continuum where Absolute Terminality and
HU
-
Terminality Coincide, Q & A in General Topology 17(2) (1999), 233
-
235.

[55]

T. Bárta, D. Opěla, P. Pyrih, P. Růžička,
R. Šámal
, Irreducible Mappings and HU
-
Terminal Continu
a, Southwest Journal of Pure and Applied Mathematics 2 (1999),
31
-
41.

[56]

R. Barták
: Conceptual Models for Combined Planning and Scheduling. Electronic
Notes in Discrete Mathematics, Elsevier, 1999, vol. 4, 1999

[57]

R. Barták
, On the Boundary of Planning and Sch
eduling: A Study. In Petley, Gary;
Coddington, Alexandra and Aylett, Ruth (eds.) Proceedings of the Eighteenth
Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG).
Manchester: University of Salford, 1999, p. 28
-
39

[58]

R. Barták
, Constra
int Programming: What is behind? In Figwer, J. (ed.) Proceedings
of the 1st Workshop on Constraint Programming for Decision and Control (CPDC
99). Gliwice, 1999, p. 7
-
15

[59]

R. Barták
,
Constraint Programming: A Survey of Solving Technology.
AIRO News
Journal
,
1999, vol. IV, no. 4, p. 7
-
11

[60]

R. Barták
, Dynamic Constraint Models for Planning and Scheduling Problems. In
Apt,
Krzysztof;

Kakas, Antoni; Monfroy, Eric and Rossi, Francesca (eds.) New
Trends in Constraints.
LNAI 1865, Springer Verlag, 2000, p. 237
-
255

[61]

R.
Barták
: Mixing Planning and Scheduling to Model Complex Process
Environments in Proceedings of PACLP 2000, , Manchester, UK, 2000, pp.329
-
332

[62]

R. Barták
, A General Relation Constraint: An Implementation. In Henz, Martin (ed.)
Proceedings of CP2000 Workshop
on Techniques for Implementing Constraint
Programming Systems (TRICS). Singapore, 2000, p. 30
-
40

[63]

R. Barták
, Slot Models for Schedulers Enhanced by Planning Capabilities.
In
Garagnani, Max (ed.)
Proceedings of the Nineteenth Workshop of the UK Planning
and
Scheduling Special Interest Group (PlanSIG). Milton Keynes: Open University,
2000, p. 11
-
24.

[64]

R. Barták
,
Dynamic Global Constraints: A First View. In
Gervet, Carmen and
Wallace, Mark (eds.)
Proceedings of Third International Conference on Integration of
AI
and OR Techniques in Constraint Programming for Combinatorial Optimisation
Problems (CP
-
AI
-
OR 01). Ashford, 2001, p. 39
-
49

[65]

R. Barták
, Filtering Algorithms for Tabular Constraints, in Proceedings of
Colloquium on Implementation of Constraint and Logic Progr
amming Systems
(CICLOPS), Paphos (2001), pp. 168
-
182

[66]

R. Barták
, H. Rudová, Integrated Modelling for Planning, Scheduling, and
Timetabling Problems. In Levine, John (ed.) Proceedings of the Twentieth Workshop
of the UK Planning and Scheduling Special Intere
st Group (PlanSIG). Edinburgh:
University of Edinburgh, 2001, p. 19
-
31

[67]

R. Barták
, Theory and Practice of Constraint Propagation,
In Figwer, J. (ed.)
Proceedings of the 3rd Workshop on Constraint Programming for Decision and
Control,
(CPDC 2001)

Gliwice, Po
lsko, 7
-
14

[68]

R. Barták
, Visopt ShopFloor: On the edge of planning and scheduling. In
O’Sullivan,
Barry et al. (eds.)
Proceedings of Joint Workshop of the ERCIM Working Group on
Constraints and the CologNet area on Constraint and Logic Programming on
Constrai
nt Solving and Constraint Logic Programming. Cork, 2002, p. 180
-
189

[69]

R. Barták
, On Modelling Planning and Scheduling Problems with Time and
Resources, in T. Grant & C. Witteveen (eds.): Proceedings of the 21th workshop of
the UK Planning and Scheduling Spec
ial Interest Group (PLANSIG), Delft University
of Technology, 2002, pp. 87
-
98

[70]

R. Barták,

Modelling Resource Transitions in Constraint
-
Based Scheduling, in W.I.
Grosky, F. Plášil (eds.): Proceedings of SOFSEM 2002: Theory and Practice of
Informatics, LNCS
2540, Springer Verlag, 2002, pp. 186
-
194

[71]

R. Barták,

Modelling Soft Constraints: A Survey, Neural Network World, Vol. 12,
Number 5, pp. 421
-
431, 2002

[72]

R. Barták,

Visopt ShopFloor: On the edge of planning and scheduling,
In Van
Hentenryck, Pascal (ed.) Princ
iples and Practice of Constraint Programming
-

Proceedings of CP2002, LNCS 2470, Springer Verlag, Ithaca, 2002, pp. 587
-
602

[73]

R. Barták,

Modelling Planning and Scheduling Problems with Time and Resources,
In Mastorakis N. and Mladenov V. (eds.)
Recent Adva
nces in Computers, Computing
and Communications, WSEAS Press, Rethymnon, 2002, pp.104
-
109

[74]

R. Barták,

Modelling Transition Constraints, in Proceedings of the ECAI workshop
on Modelling and Solving Problems with Constraints, Lyon, 2002, pp. 3
-
10

[75]

R. Barták,

A

Theoretical Framework for Constraint Hierarchy Solvers, in F. van
Harmelen (ed.): ECAI 2002. Proceedings of the 15th European Conference on
Artificial Intelligence, IOS Press, Lyon, 2002, pp. 146
-
150

[76]

R. Barták
, Constraint
-
based scheduling: an introduction

for newcomers, Intelligent
Manufacturing Systems 2003, IFAC Publications (2003), Elsevier Science, North
-
Holland, Amsterdam, 69
-
74.

[77]

R. Barták
, Dynamic Global Constraints: A First View,
In
Gervet, Carmen and
Wallace, Mark (eds.)
Proceedings of the 3rd Inte
rnational Workshop on Integration of
AI and OR Techniques in Constraint Programming for Combinatorial Optimisation
Problems, Ashford, 2001, UK, str. 39
-
49. Viz též
R. Barták
, Dynamic Global
Constraints: A First View, Proceedings of the 2001 ERCIM Workshop
on Constraints,
Matfyzpress, Praha, 2001.

[78]

R. Barták
, Dynamic global constraints in backtracking based environments, Annals of
Operations Research 118 (2003), 101
-
119.

[79]

R. Barták,

Integrated Modelling: When time and resources play a role, in L.
McCluskey (ed
.) Proceedings of AIPS02 Workshop on Knowledge Engineering Tools
and Techniques for AI Planning, Toulouse 2002, AAAI Press 2002, pp. 22
-
29

[80]

R. Barták
, Real
-
life manufacturing problems: a challenge,
In
Hoffmann, Jörg and
Edelkamp, Stefan (eds.)
Proceedings of

International Conference om Automated
Planning and Scheduling (ICAPS'03), Workshop on the Competition: Impact,
Organization, Evaluation, Benchmarks (2003), AAAI Press, 38
-
42.

[81]

R. Barták
, Practical Constraints: A Tutorial on Modelling with Constraints. In
Figwer, J. (ed.) Proceedings of the 5th Workshop on Constraint Programming for
Decision and Control (CPDC 2003). Gliwice, 2003, p. 7
-
17

[82]

R. Barták
, Visopt ShopFloor: going beyond traditional scheduling,
In O’Sullivan,
Barry (ed.)

Recent Advances in Constrai
nts, LNAI 2627 (2003), Springer
-
Verlag,
185
-
199.

[83]

R. Barták
, Visopt ShopFloor System: Integrating Planning into Production
Scheduling. In Golden, Keith and Vidal, Thierry (eds.) Printed Notes of ICAPS'03
System Demos. Trento, 2003, p. 5
-
6.

[84]

R. Barták
,
R. Mec
l
, Integrating planning into production scheduling: Visopt
Shopfloor system,
In Kendall, Graham; Burke, Edmund and Petrovic, Sanja (eds.)
Proceedings of the 1st Multidisciplinary International Conference on
Scheduling:Theory and Applications (MISTA) (2003)
, Kluwer, 259
-
278.

[85]

R. Barták
,
T. Müller
, H. Rudová, Minimal perturbation problem


a formal view,
Neural Network World 13 (2003), 501
-
511. viz též
R. Barták
,
T. Müller
, H. Rudová,
Minimal perturbation problem


a formal view
, Proceedings of ERCIM Working
G
roup on Constraints/CompulogNet Area on "Constraint Programming" Workshop
(2003), ERCIM, 209
-
217

[86]

R. Barták
,
T. Müller
, H. Rudová, A New Labeling Algorithm to Solve Minimal
Perturbation Problems: A Preliminary Report. In Porteous, Julie (ed.)
Proceedings of

the 22nd Workshop of the UK Planning and Scheduling Special Interest Group
(PlanSIG). Glasgow: University of Strathclyde, 2003, p. 1
-
11

[87]

Y. Bartal, S. Leonardi, A. Marchetti
-
Spaccamela,
J. Sgall
, L. Stougie, Multiprocessor
scheduling with rejection, SIAM J
. Disc. Math 13(1) (2000), 64
-
78.

[88]

F.Blanchard, E.Formenti,
P. Kůrka
: Cellular automata in the Cantor, Besicovitch and
Weyl spaces. Complex Systems 11,2, (1999) 107
-
123

[89]

E. Bodirsky,
J. Nešetřil
, Constraint satisfaction with countable homogeneous
templates,
International Workshop on Computer Science and Logic, LNCS 2803
(2003), Springer
-
Verlag, 44
-
57.

[90]

Boneh, C. Dunworth, R. J. Lipton,
J. Sgall
, Making DNA computers error resistant,
DNA Based Computers II, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 44
(
1999), AMS, 163
-
170

[91]

Borodin, A.V.Kostochka,
J. Nešet
řil
, A. Raspaud, E. Sopena: On the maximal
average degree and the oriented chromatic number of a graph, Discrete Math. 206
(1999),77
-
86

[92]

Brass, Gy. Karolyi,
P. Valtr
, A Turan
-
type extremal theory of convex geometric
graphs, Discrete and Computational Geomet
ry (2003), Springer, 275
-
300.

[93]

H. Broersma, F.V. Fomin,
J. Kratochvíl
, G.J. Woeginger, Planar graph coloring with
forbidden subgraphs: Why trees and paths are dangerous, Proceedings 8th
Scandinavian Workshop on Algorithm Theory (SWAT 2002), LNCS 2368 (2002)
,
Springer
-
Verlag, 160
-
169.

[94]

H. Bronnimann, B. Chazelle,
J. Matoušek
: Product range spaces, sensitive sampling
and derandomization, SIAM J. Comput. 28,5(1999) 1552
-
1575

[95]

Brummer,
A. Pultr,
W. Tholen, Local(ic) Enrichments of Categories, Cahiers de Top.
et G
eom. Diff. Cat. XLI
-
2 (2000), 121
-
142.

[96]

S. Buss,
P. Pudlák
,On the computational content of intuitionistic propositional proofs
Annals of Pure and Applied Logic 109 (2001), 49
-
64

[97]

R. Caha
,
P. Gregor
, Embedding Fibonacci Cubes into Hypercubes with $
\
Omega
(2^
{cn})$ Faulty Nodes, Proc. of the MFCS'2000, Bratislava, LNCS 1893 (2000),
Springer, 253
-
263

[98]

R. Caha
,
V. Koubek
, Optimal embeddings of generalized ladders into hypercubes,
Discr. Math. 233 (2001), 65
-
83

[99]

R. Caha
,
V. Koubek
, Optimal embeddings of odd ladders

into a hypercube, Discr.
Appl. Math. 116 (2002), 73
-
102

[100]

O. Cheong, S. Har
-
Peled
J. Matoušek
, and N. Linial, The one
-
round Voronoi game,
Proc. 18th ACM Sympos. Comput. Geom. 2002, 97
-
101

[101]

M. Chrobak, L. Epstein, J. Noga,
J. Sgall
, R. van Stee,
T. Tichý
, N.

Vakhania,
Preemptive scheduling in overloaded systém, J. Comput. Syst. Sci. 67 (2003) 183
-
197.

[102]

M. Chrobak,
J. Sgall
, A simple analysis of the harmonic algorithm for two servers,
Inf. Process. Lett. (1
-
2) (2000),75
-
77.

[103]

M. Chrobak,
J. Sgall
, The weighted
2
-
server problem, Proceedings of the 17th Ann.
Symp. on Theor. Aspects of Comput. Science, LNCS 1770 (2000),. Springer
-
Verlag,
593
-
604.

[104]

B. Codenotti,
P. Pudlák
, J. Resta, Some structural properties of low rank matrices
related to computational complexity
Theoretical Computer Sci. 235 (2000), 89
-
107.

[105]

J. Csirik, I. Csanád, M. Chrobak, J. Noga,
J. Sgall
, G. J. Woeginger, The buffer
minimization problem for multiprocessor scheduling with conflicts, Proc. of the 28th
International Colloquium on Automata, Langua
ges, and Programming, LNCS 2076,
Springer
-
Verlag, 2001, str. 862
-
874.

[106]

O. Čepek
, M. Okada, M. Vlach: Note: On the two
-
machine no
-
idle flowshop
problem, Naval Reasearch Logistics 47 (2000), 353
-
358

[107]

Čepek,O
.; Okada,M.; Vlach,M. Nonpreemtive flowshop schedulin
g with machine
dominance. European Journal of Operational Research 139 (2002), pp. 245
-
261

[108]

Čepek,O.;

Sung, S.C. Just in time scheduling with periodic time slots
.

Proceedings of
5th Czech
-
Japan Seminar on Data Analysis and Decision Making under Uncertainty,

Koyasan, Japan, Sept. 2002,

Osaka Institute of Technology, 2002,
pp. 27
-
29

[109]

Čepek,O
.; Sung, S.C. Just in time scheduling on identical parallel machines
.

Proc. of
5th Czech
-
Japan Seminar on Data Analysis and Decision Making under Uncertainty,

Koyasan, Japan
, Sept. 2002,

Osaka Institute of Technology, 2002,
pp. 30
-
33

[110]

J. Černý
,
J. Kára
,
D. Kráľ
, P. Podbrdský ,
R. Šámal
, M. Sotáková , On the number of
intersections of polygons, Commentationes Mathematicae Universitatis Carolinae 44
(2003) 217
-
218.

[111]

J. Černý
,
D.
Kráľ
,
H. Nyklová
,
O. Pangrác
, On intersection graphs of segments with
prescribed slopes, Proceedings 9th International Symposium, Graph Drawing 2001;
LNCS 2265, Springer
-
Verlag, 2002, 261
-
271.

[112]

M. Demlová,
V. Koubek
, Endomorphism monoids in varieties of ba
nds, Acta Sci.
Math. 66 (2000), 474
-
516.

[113]

J. Diaz,
J. Nešetřil
, M. Serna, D. Thilikos, H
-
coloring of large degree graphs, EurAsia


Information and Communication Technology, LNCS 2510 (2002), Springer
-
Verlag,
851
-
857.

[114]

T. Dvořák
, I. Havel and P. Liebl: Eu
ler cycles in K2m plus perfect matching, Eur. J.
Comb. 20(1999), 227
-
232

[115]

T. Dvořák

: Chromatic index of hypergraphs and Shannon's theorem. Eur. J. Comb.
21(2000), 585
-
591

[116]

T. Dvořák

, I. Havel and M. Mollard: On paths and cycles dominating hypercubes,
Disc
rete Math. 262(2003), 121
-
129

[117]

P. A. Dreyer, Ch. Malon,
J. Nešetřil
, Universal H
-
colorable graphs without a given
configuration, Discrete Math. 250 (2002), 242
-
252.

[118]

Z. Dvořák
,
J. Kára
,
D. Kráľ
,
O. Pangrác
, On Pattern Coloring of Cycle Systems,
Proceedings 2
8th Workshop on Graph Theoretical Concepts in Computer Science
(WG'02), LNCS 2573 (2002), Springer
-
Verlag, 164
-
175.

[119]

Z. Dvořák,
D. Kráľ
, On Planar Mixed Hypergraphs, The Electronic Journal of
Combinatorics 8(1) (2001) R35.

[120]

L. Epstein,
J. Sgall
, A lower bo
und for on
-
line scheduling on uniformly related
machines, Oper. Res. Lett. 26(1) (2000), 17
-
22.

[121]

L. Epstein,
J. Sgall
, Approximation schemes for scheduling on uniformly related and
identical parallel machines. Proc. of the 7th European Symp. on Algorithms (
ESA),
LNCS 1643 (1999), Springer
-
Verlag, 151
-
162.

[122]

T. Erlebach,
J. Fiala
, On
-
line coloring of geometric intersection graphs,
Computational Geometry: Theory and Applications, 23 (2002) 243
-
255; ITI Series
2002
-
052.

[123]

J. Fiala
, Computational complexity of cove
ring cylic graphs
, Discrete Mathematics
235 (2001), 87
-
94

[124]

J. Fiala
, NP
-
completeness of the edge precoloring extension problem on bipartite
graphs, Journal of Graph Theory 43 (2003) 156
-
160.

[125]

J. Fiala
, A. V. Fishkin, F. V. Fomin, Off
-
line and on
-
line distanc
e constrained
labeling of disk graphs, Proceedings 9th European Symposium on Algorithms (ESA
'01), LNCS 2161 (2001), Springer Verlag, 464
-
475.

[126]

J. Fiala
, P. Hegerness, P. Kristiansen, J.
-
A. Telle, Generalized H
-
coloring and H
-
covering of trees, Nordic J. Co
mputing 10 (2003) 206
-
224.

[127]

J. Fiala
, K. Jansen, Van Bang Le, E. Seidel, Graph subcolorings: complexity and
algorithms,
SIAM Journal on Discrete Mathematics 16 (2003) 635
-
650.

[128]

J. Fiala
, K. Jansen, Van Bang Le, E. Seidel, The complexity of graph subcolorings
,
Proceedings 27th Workshop on
Graph
-
Theoretical Concepts in Computer Science
(WG '01), LNCS 2204 (2001), Springer Verlag, 154
-
165; viz
též
J. Fiala
, T. Kloks,
J.
Kratochvíl
, Fixed
-
parameter complexity of lambda
-
colorings, Proceedings of Graph
Theoretic Concepts in Computer Science (WG '99), LNCS 1665 (1999), Springer
Verlag, 350
-
363.

[129]

J. Fiala
, T. Kloks and
J. Kratochvíl
, Fixed
-
parameter c
omplexity of $
\
lambda$
-
labelings, Discrete Applied Mathematics, 113 (1) (2001), pp.~59
--
72

[130]

J. Fiala
,
J. Kratochvíl
, Complexity of partial covers of graphs, Proceedings of 12th
Algorithms and Computation (ISAAC

01), LNCS 2223 (2001), Springer Verlag, 537
-
54
9.

[131]

J. Fiala
,
J. Kratochvíl
, Partial covers of graphs, Discussiones Mathematicae Graph
Theory, 22 (2002) 89
-
99.

[132]

J. Fiala
,
J. Kratochvíl
, A. Proskurowski, Distance constrained labeling of precolored
trees, Proceedings of 7th Theoretical Computer Science(ICT
CS '01), LNCS 2202
(2001), Springer Verlag, 285
-
292.

[133]

J. Fiala
,
J. Kratochvíl
, A. Proskurowski, Geometric systems of disjoint
representatives, Proceedings of 10th Graph Drawing (GD'02), LNCS 2528 (2002),
Springer
-
Verlag, 110
-
117.

[134]

J. Fiala
, D. Paulusma, Th
e computational complexity of the role assignment problem,
Proceedings of 30th International Colloquium on Automata, Languages and
Programming (ICALP'03), LNCS 2719 (2003),
Springer
-
Verlag
, 817
-
828.

[135]

T. Fleiner, W. Hochstättler, M. Laurent,
M. Loebl
, Cycle
bases For lattices of binary
matroids with no Fano dual minor and their one
-
element extensions, J. Combinatorial
Theory B, 77,1 (25
-
38) 1999.

[136]

D. Fon
-
Der
-
Flaass, A. Kostochka,
J. Nešetřil
, A. Raspaud, E. Sopena, Nilpotent
families of endomorphisms of (P
+
,

), J. Comb. Th. B 86 (2002) 100
-
108.

[137]

A. Galluccio,
M. Loebl
, A Theory of Pfaffian Orientations I, Electronic Journal of
Combinatorics 6,1 1999.

[138]

A. Galluccio,
M. Loebl
, A Theory of Pfaffian Orientations II, Electronic Journal of
Combinatorics 6,1 1999.

[139]

A
. Galluccio,
M. Loebl
,
J. Vondrák
, A new algorithm for the Ising problem, Partition
Function for Finite Lattice Graphs, Physical Review Letters 84, 5924
-
5927 (2000).

[140]

A. Galluccio,
M. Loebl
,
J. Vondrák
, Optimization via enumeration: A new algorithm
for th
e Max Cut problem, Mathematical Programming 90(2) (2001), 273
-
290.

[141]

Gartner, J. Solymosi, F. Tschirschnitz,
P. Valtr
, E. Welzl, One line and n points, Proc.
33rd Annual ACM Symposium on Theory of Computing (STOC), 2001, str. 306
-
315.


[142]

R. L. Graham,
J. Nešet
řil
, Ramsey theory and Paul Erdős (recent results from a
historical perspective), in: Paul Erdős and his Mathematics, II , Bolyai Society Math.
Studies 11, Springer
-
Verlag, 2002, 339
-
365.

[143]

Hahn,
J. Kratochvíl
, J. Širáň, D. Sotteau, On the injective chromati
c number of
graphs, Discr. Math. 256 (2002) 179
-
192.

[144]

M. Halldorsson,
J. Kratochvíl
, J.A. Telle, Independent sets with domination
constraints, Discrete Appl. Math. 99 (2000), 39
-
54.

[145]

M. Halldorsson,
J. Kratochvíl
, J.A. Telle, Mod
-
2 Independence and Dominatio
n in
Graphs, Proceedings of Graph Theoretic Concepts in Computer Science (WG '99),
LNCS 1665 (1999), Springer Verlag, 101
-
109.

[146]

M. Halldorsson,
J. Kratochvíl
, J.A. Telle, Mod
-
2 Independence and domination in
graphs, Internat. J. Found. Comput. Sci. 11 (20
00), 355
-
364.

[147]

P. Hell,
J. Nešetřil
, A. Raspaud, E. Sopena: Three
-
and
-
More Set Theorem, Comm.
Math. Univ. Carol. 41, 4 (2000), 793
-
802

[148]

Herrlich,
A. Pultr
, Nearness, Subfitness and Sequential Regularity, Appl. Cat.
Structures 8 (2000), 67
-
80.

[149]

P. Hliněný,
J.

Kratochvíl
, Representing graphs by disks and balls (a survey of
recognition complexity results), Discrete Mathematics, 229 (1
-
3) (2001), 101
-
124.

[150]

W.Hochst
ä
ttler,
M. Loebl
, Bases of Cocycle Lattices and Submatrices of a Hadamard
Matrix, DIMACS Series in D
iscrete Mathematics and Theoretical Computer Science
49 (1999), AMS, 159
-
168.

[151]

W. Hochstaetter,
J.Nešetřil
: Linear Programming Duality and Morphisms, Comment.
Math. Univ. Carol. 40,3(1999) 557
-
592

[152]

J. Hrůza,
P. Štěpánek
: Binary Speed Up for Logic Programs in: Computationam
Logic CL
-
2000 (John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kuni
g
-
Kiu Lau, Catuscia Palamidesi, Luis Moniz Pereira Yehoshua Sagiv, Peter J. Stuckey,

Editors), Lecture Notes in Artificial Intelligence Vol 1861, pp 116
-
130 Springer
-
Verlag
Berlin

[153]

O. Hudec,
K. Zimmermann
, Biobective center
-
balance graph location model,
Op
timization 45 (1999), 107
-
115.

[154]

R. Impagliazzo,
P. Pudlák
, A lower bound for DLL algorithms for k
-
SAT,
Symposium on discrete algorithms 2000 (SODA’00), ACM (2000), 128
-
136.

[155]

R. Impagliazzo,
P. Pudlák
,
J. Sgall
, Lower bounds for the polynomial calculus and
th
e Groebner basis algorithm. Comput. Complexity, 8(2) (1999), 127
-
144.

[156]

V. Janota,
J.

Nešetřil
, Pančoška P., Novel matrix descriptor for determination of the
connectivity of secondary structure segments in proteins. Analysis of general
properties using grap
h theory, Discrete Mathematics 235 (2001), 399
-
423

[157]

F.V. Jensen,
M. Vomlelová
; Unconstrained influence diagrams. Eighteenth
Conference on Uncertainty in Artificial Intelligence, Edmonton Canada, August 2002,
Morgan Kaufmann (2002) 234
-
241

[158]

F.V. Jensen, U. K
jaerullf, B. Kristiansen, H. Langseth, C. Skaanning, J. Vomlel,
M.
Vomlelová
: The SACSO methodology for troubleshooting complex systems;
Artificial Intelligence for Engineering, Design, Analysis and Manufacturing, 15
(2001) 321
-
333

[159]

Juurlink,
P. Kolman
,
F. Meyer auf der Heide and I. Rieping: Optimal Broadcast on
Parallel Locality Models, Journal of Discrete Algorithms, Volume 1, Issue 2, 2003,
pp. 151
-
166

[160]

T. Kaiser,
M. Klazar
, On growth rates of hereditary permutation classes, Electr. J.
Combinatorics 9 (
2) (2003) R10.

[161]

J. Kára
,
D. Kráľ
, Minimum degree and the number of chords, Ars Combinatoria 68
(2003) 169
-
179.

[162]

J. Kára
,
D. Kráľ
, Optimal free binary decision diagrams for computation of EAR_n,
Proceedings 27th International Symposium, Mathematical Foundations of Computer
Science
2002, LNCS 2420, Springer
-
Verlag, 2002, 411
-
422.

[163]

Gy. Karolyi,
P. Valtr
, Point configurations in d
-
space without large subsets in convex
position, Discrete and Computational Geometry 30 (2003), 277
-
286.

[164]

M. Kiwi,
M. Loebl
, Largest planar matching in rando
m bipartite graphs, Random
Structures and Algorithms 21 (2002) 162
-
181.

[165]

M. Klazar
, Bell numbers, their relatives, and algebraic differential equations, J.
Combin. Theory, Ser. A 102 (2003) 53
-
87.

[166]

M. Klazar
, Comments on a result of Trotter and Winkler in co
mbinatorial probability
(extended abstract), Paul Erdös and his Mathematics, Research communications of
the conference held in the memory of Paul Erdös, Budapest, Hungary, July 4
-
11,
1999, János Bolyai Mathematical Society, Budapest, 1999, 127
-
129.

[167]

M. K
lazar
, Counting even and odd partitions, Amer. Math. Monthly 110 (2003) 527
-
532.

[168]

M. Klazar
, Counting pattern
-
free set partitions I: A generalization of Stirling numbers
of the second kind, Europ. J. Combinatorics 21(2000), 367
-
378.

[169]

M. Klazar
, Counting pat
tern
-
free set partitions II: Noncrossing and other
hypergraphs, Electr. J. Combinatorics 7 (2000), R34, 25 pages.

[170]

M. Klazar
, Extremal problems for colored trees and Davenport
-

Schinzel sequences,
Discrete Math. 197/198 (1999), 469
-
482.

[171]

M. Klazar
, Gene
ralized Davenport
-
Schinzel sequences: results, problems, and
applications, Integers 2 (2002) A11.

[172]

M. Klazar
, Non P
-
recursiveness of numbers of matchings or linear chord diagrams
with many crossings, Adv. Appl. Math. 30 (2003) 126
-
136.

[173]

M. Klazar
, On the ma
ximum lengths of Davenport
-
Schinzel sequences,
Contemporary Trends in Discrete Mathematics, AMS, Providence, 1999, 169
-
178.

[174]

M. Klazar
, The Füredi
-
Hajnal conjecture implies the Stanley
-

Wilf conjecture,
Formal Power Series and Algebraic Combinatorics, Sp
ringer, Berlin, 2000, 250
-
255.

[175]

M. Klazar
, F. Luca, On some arithmetic properties of polynomial expressions
involving Stirling numbers of the second kind, Acta Arith. 107 (2003) 357
-
372.

[176]

M. Klazar
, J. Němeček , A bijection between nonnegative words and sparse abba
-
free
partitions, Discrete Math. 265 (2003) 411
-
416.

[177]

T. Kloks,
J. Kratochvíl
, H. Muller, New branchwidth territories, Proceedings 16th
symposium on Theoretical aspects of computer science

(STACS 99), LNCS 1563
(1999), Springer Verlag, 173
-
18.

[178]

P. Kolman
, A note on the greedy algorithm for the unsplittable flow Problem,
Information Processing Letters 88 (2003) 101
-
105.

[179]

P.

Kolman
,
C. Scheideler, Simple On
-
Line Algorithms for the Maximum Disjo
int
Paths Problem, in: Proc. 13 ACM Symposium on Parallel Algorithms and
Architectures (SPAA), 2001

[180]

P. Kolman
,
C. Scheideler,
Improved Bounds for the Unsplittable Flow Problem

,
Proc. 13th ACM
-
SIAM Symposium on Discrete Algorithms (SODA), 2002

[181]

Korte.and
J.

Nešetřil
, Vojtěch Jarník’s work in combinatorial optimalization, Discrete
Mathematics 235 (2001), 1
-
17

[182]

A.J. Kostochka,
Nešetřil J
.,Smolíková P., Colorings and homomorphisms of
degenerate and bounded degree graphs, Discrete Mathematics 233 (2001), 257
-
276

[183]

V. Koubek
, Universal topological unary varieties, Topology and its Appl. 127(2003)
425
-
446.

[184]

V. Koubek

,
A. Koubková
, Algorithms for transitive closure, Inform. Processing
Letters 81(2002), 289
-
296.

[185]

V. Koubek
, J. Sichler, Strongly alg
-
universal semigroup v
arieties, Alg. Universalis
42 (1999), 79
-
105.

[186]

V. Koubek

a J. Sichler, On almost universal varieties of modular lattices, Alg.
Universalis 45 (2001), 191
-
200

[187]

V. Koubek

a J. Sichler, Endomorphism monoids of chained graphs, Discrete Math.
242 (2002), 157
-
174

[188]

D. Kráľ
, A counter
-
Example to Voloshin's hypergraph co
-
perfectness conjecture,
Australasian Journal on Combinatorics 27 (2003) 253
-
262.

[189]

D. Krá
ľ
: Algebraic and Uniqueness Properties of Parity Ordered Binary Decision
Diagrams and their Generalization, Pro
ceedings 25th Symposium on Mathematical
Foundations of Computer Science 2000 (MFCS'00), LNCS 1893 (2000), Springer
-
Verlag, 477
-
487.

[190]

D. Kráľ
, On complexity of coloring mixed hypertrees, Fundamentals of Computation
Theory, Proceedings FCT 2001, LNCS 2138 (2
001), Springer Verlag, 516
-
524.

[191]

D. Krá
ľ
,
J. Kratochvíl
, A. Proskurowski, J.
-
H. Voss: Coloring mixed hypertrees,
Proceedings 26th Workshop on Graph
-
Theoretic Concepts in Computer Science 2000
(WG'00), LNCS 1928 (2000), Springer
-
Verlag, 279
-
289.

[192]

Kráľ
,
J. Kr
atochvíl
, Zs. Tuza, G. Woeginger, Complexity of coloring graphs without
forbidden induced subgraphs, Proceedings of 27th Workshop on Graph Theoretic
Concepts in Computer Science (WG '01), LNCS 2204 (2001), Springer Verlag, 2001,
254
-
262.

[193]

Kráľ
,
J. Kratochví
l
, H.
-
J. Voss, Complexity note on mixed hypergraphs, Proceedings
of Mathematical Foundations of Computer Science 2001 (MFCS

01), LNCS 2136
(2001), Springer Verlag, 474
-
485.

[194]

D. Kráľ
,
J. Kratochvíl
, H.
-
J. Voss, Mixed hypegraphs with bounded degree: edge
-
colo
ring of mixed multigraphs, Theoretical Computer Science 295 (2003), 263
-
278.

[195]

D. Kráľ
, R. Škrekovski, A theorem about the channel assignment problem, SIAM
Journal on Discrete Mathematics 16 (2003), 426
-
437.

[196]

J. Kratochvíl
, Complexity of hypergraph coloring a
nd Seidel's switching, Graph
Theoretic Concepts in Computer Science, Proceedings of WG 2003, LNCS 2880
(2003), Springer
-
Verlag, 297
-
308.

[197]

J. Kratochvíl
, P. Mihók, Hom
-
properties are uniquely factorizable into irreducible
factors, Discr. Math. 213 (2000),
189
-
194.

[198]

J. Kratochvíl
, Zs. Tuza, On the complexity of bicoloring clique hypergraphs of
graphs, J. of Algorithms 45 (2002) 40
-
54
;
viz též
J. Kratochvíl
, Zs. Tuza, Bicoloring
clique hypergraphs (extended abstract), Proceedings of 11th annual ACM symposium
on Discrete Algorithms SODA '00 (2000), ACM and SIAM , 40
-

41.

[199]

J. Kratochvíl
, Zs. Tuza, Rankings of directed graphs, SIAM J. Discr
ete Math. 12
(1999), 374
-
384.

[200]

J. Kratochvíl
, Zs. Tuza, M. Voigt, New trends in the theory of graph colorings,
Choosability and list coloring, in: Contemporary Trends in Discrete Mathematics
(from DIMACS and DIMATIA to the future), DIMACS Series in Disc
rete
Mathematics and Theoretical Computer Science 49 (1999), American Mathematical
Society, Providence, 183
-
197.

[201]

A.
Kučera
, K. Ambos
-
Spies, Randomness in computability theory, Computability and
its applications, Proceedings of a 1999 AMS
-

IMS
-

SIAM joint summer research
conference (Cholak. et al. ed.) Contemporary Mathematics 257 (2000), 1
-
14

[202]

A. Kučera
, T. A. Slaman, R
andomness and Recursive Enumerability, SIAM Journal
on Computing, Vol. 31, 2001, 199
-
211.

[203]

A. Kučera

, S. A. Terwijn, Lowness for the class of random sets, Journal of Symbolic
Logic, 64, 4 (1999), 1396
-
1402.

[204]

L. Kučera
, Wait
-
free deflection routing of long m
essages, IEEE Trans. on Parallel
and Distributed systems, 12 (5), 2001, 499
-

513

[205]

P.Kůrka
: Zero
-
dimensional dynamical systems, formal languages, and universality.
Theory of Computing Systems 32, 423
--
433 (1999).

[206]

P.Kůrka
, A.Maass: Realtime subshifts. Th
eoretical Computer Scienc 237, 307
--
325
(2000).

[207]

P.Kůrka
, A.Maass, Recurrence dimension in Toeplitz subshifts. Proceedings of the
conference "Dynamical Systems: From Crystal to Chaos" (J.M.Gambaudo, P.Hubert,
S.Vaienti, eds.), pp. 165
-

175, World Scientific
, Singapore 2000.

[208]

P.Kůrka
, A.Maass, Limit sets of cellular automata associated to probability measures.
Journal of Statistical Physics 100, 5/6, (2000) pp.1031
-
1047

[209]

P.Kůrka,
Topological dynamics of cellular automata. Codes, Systems, and Graphical
Models
(eds. B.Marcus and J.Rosenthal) IMA Volumes in Mathematics and its
Applications 123, pp. 447
-
485, Springer, New York 2001

[210]

P.Kůrka
, A.Maass: Stability of subshifts in cellular automata. Fundamenta
Informaticae 52, 143
--
155, 2002

[211]

P.Kůrka
, V.Penné, S.Vaienti
: Dynamically defined recurrence dimension. Discrete
and Continuous Recurrence Systems, 8, 137
--
146, 2002

[212]

P. Kůrka
: Cellular automata with vanishing particles. Fundamenta Informaticae, 20,
1
-
18, 2003

[213]

K. Kuperberg, W. Kuperberg,
J. Matoušek
,
P. Valtr
, A
lmost
-

tiling the plane by
ellipses, Discrete and Computational Geometry 22 (1999), 367
-
375.

[214]

P. Květoň
, V. Koubek
, Functions preserving classes of languages, Development in
language theory, Foundations, applications and perspectives 1999, Word Scientific
Publishing (2000), 81
-
102.

[215]

M. Loebl
, On the dimer problem and the Ising problem in finite 3
-
dimensional
lattices, Electronic Journal of Combinatorics 9 (2002), R30.

[216]

M. Loebl
, M. Matamala: Some Remarks on Cycles in Graphs and Digraphs,

in:
Contemporary Tren
ds in Discrete Mathematics

(R. L. Graham, J. Kratochvíl, J. Nešetřil,
F.S. Roberts eds.), AMS, Providence 1999

[217]

M. Loebl
,
J. Nešetřil
, B. Reed, A note on random homomorphisms from arbitrary
graphs to Z, Discrete Mathematics 273 (2003) 173
-
181.

[218]

M. Loebl
,
J. Vondrák
, Towards a theory

of frustrated degeneracy, Discrete
Mathematics 271 (2003) 179
-
193.

[219]

J. Matoušek
: On the signed domination in graphs, Combinatorica 20,1(2000) 103
-
108

[220]

J. Matoušek
: On approximate geometric k
-
clustering, Discr. Comput. Geom.
24(2000) 61
-
84

[221]

J. Matoušek
: On th
e linear and hereditary discrepancies, European J. Combin.
21(2000) 519
-
521

[222]

J. Matoušek
, Lower bound on the minus
-
domination number, Discr. Math. 233(2001)
361
-
370

[223]

J. Matoušek
, Yuri Rabinovich, On dominated l_1 metrics, Israel J. Math. 123(2001)
285
-
301

[224]

J.

Matoušek
, Lower bounds on the transversal numbers of d
-
intervals, Discr. Comput.
Geom. 26(2001) 283
-
287

[225]

J. Matoušek
, A lower bound for weak epsilon
-
nets in high dimension, Discr. Comput.
Geom. 28(2002) 45
-
48.

[226]

J. Matoušek
, A lower bound on the size of Lip
schitz subsets in dimension 3, Combin.
Probab. Comput. 12 (2003), 427
-
430.

[227]

J. Matoušek
, On the discrepancy for Cartesian products, J. London Math. Soc. 61
(2000), 737
-
747.

[228]

J. Matoušek
, On directional convexity, Discr. Comput. Geom. 25,3(2001) 389
-
405

[229]

J. M
atoušek
, On the chromatic number of Kneser hypergraphs, Proc. Amer. Math.
Soc. 130 (2002), 2509
-
2514.

[230]

J. Matoušek
,
P. Valtr
, Visibility and covering by convex sets, Israel J. Math. 113
(1999), 341
-
379.

[231]

J. Matoušek
, U. Wagner, New constructions of weak e
psilon
-
nets, Proc. 19th ACM
Sympos. Comput. Geom. 2003 129
-
135.

[232]

J. Maxová
,
J. Nešetřil
, Complexity of compatible decompositions of Eulerian graphs
and their transformations, European Symposium on Algorithms (ESA’02), LNCS
2461 (2002), Springer
-
Verlag, 711
-
722.

[233]

J. Maxová
,
J. Nešetřil
, On faithful cycle covers of graphs, Proceeding
s of the 3rd
Scientific Colloquium (2001), VŠCHT Praha, 130
-
135.

[234]

J. Maxová
,
Nešetřil J
., On oriented path double covers., Discrete Mathematics 233
(2001), 371
-
380

[235]

T.Müller
,

R. Barták
, Interactive Timetabling: Concepts, Techniques, and Practical
Results. In

Burke, Edmund and Causmaecker, Patrick De (eds.) Proceedings of the 4th
International Conference on the Practice and Theory of Automated Timetabling
(PATAT2002). Gent, 2002, p. 58
-
72

[236]

J. Nešetřil
, J. Solymosi,
P. Valtr
, Induced monochromatic subconfigurat
ions,
DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume
49 (1999), 219
-
227.

[237]

J. Nešetřil
, A. Raspaud: Antisymmetric flows and strong colourings of oriented
graphs, Ann. Inst. Fourier Grenoble 49, 3 (1999) 1037
-
1056

[238]

J. Nešetřil
,

A. Raspaud: Colored homomorphism of Colored and Mixed Graphs, J.
Comb. Th. B

80 (2000), 147
-
155

[239]

J. Nešetřil
: Aspects of structural combinatorics, Taiwanese J. Math. 3,4(1999), 381
-
424

[240]

J. Nešetřil
: The homomorphism structure of classes of graphs, Combin. P
robab.
Comput. 8(1999) 177
-
184

[241]

J. Nešetřil
, A rigid graph for every set, J. of Graph Th. 39 (2002), 108
-
110.

[242]

J. Nešetřil
, Art of drawing and art, Journal Graph Algorithms and Applications 6(1)
(2002), 131
-
147.

[243]

J. Nešetřil
, S. Shelah, On the order of count
able graphs, European J. Combin. 24
(2003) 649
-
663.

[244]

J. Nešetřil
, R. Owczarzy, P. Pančoška, P. V. Riccelli, P. M. Valtone, Calculating
Sequence Dependent Melting Stability of Duplex DNA Oligomers and Multiplex
Sequence Analysis by Graphs, Methods in Enzymol
ogy 340 (2001).

[245]

J. Nešetřil
,
A. Pultr
, A note on homomorphism
-
indepenent families, Discrete Math.
235 (2001), 327
-
334.

[246]

J
.
Nešetřil
and Rosenfeld M., I.Shur, C. E. Shannon and Ramsey Numbers, a short
story, Discrete Mathematics 229 (2001), 185
-
195

[247]

J. Nešet
řil
, C. Tardif: Duality Theorems for Finite Structures (Characterizations Gaps
and Good Characterizations) , J. Comb. Th. B 80 (2000), 80
-
97

[248]

J. Nešetřil
, C. Tardif, Density via duality, Theoret. Computer Sci. 287 (2002), 589
-
591.

[249]

J. Nešetřil
, X. Zhu, Cons
truction of sparse graphs with prescribed circular colorings,
Discrete Math. 233 (2001), 277
-
291.

[250]

P. Olmer
, P. Štěpánek
: Schema
-
Based Transformations of Logic Programs in
lambdaProlog, In P. J. Stuckey (ed.), Proceedings of the 18 International Conference
on Logic Programming, ICLP 2002, LNCS 2401, Springer, Berlin, 2002, p. 472

[251]

D. Opěla,
R. Šámal
, P. Pyrih, An Example of Openly Minimal Dendrite, Q & A in
General Topology 18(2) (2000), 229
-
236.

[252]

D. Opěla, P. Pyrih,
R. Šámal
: Chain of Dendrites Openly Unboun
ded from Below,
Mathematica Pannonica 12/1 (2001), 83

92

[253]

P. Ossona de Mendez,
J. Nešetřil
, Coloring and homomorphisms of minor closed
classes, v Discrete and Computational Geometry
-
The Goodman
-
Pollack Festschrift,
Springer
-
Verlag, Berlin 2003, 651
-
664.

[254]

T.
Plewe,
A. Pultr

and A. Tozzi, Regular Monomorphisms of Hausdorff Frames
Applied Categorical Structures 9 (2001), 15
-
33

[255]

A. Pór,
P. Valtr
, The partitioned version of the Erdős
-
Szekeres theorem, Discrete and
Computational Geometry 28 (2002), 625
-
637.

[256]

P. Pu
dlák
, Algoritmus pro prvočísla, Vesmír 82 (2003) 11
-
12.

[257]

P. Pudlák
, A note on applicability of the incompleteness theorem to human mind,
Annals of Pure and Applied Logic 96 (1999), 335
-
342.

[258]

P. Pudlák
, A Note On the Use of Determinant for Proving Lower Boun
ds on the Size
of Linear Circuits. Information Processing Letters 74 (2000), 197
-
201.

[259]

P. Pudlák
, Complexity theory and genetics: The computational power of crossing
over, Information and Computation 171, (2001), 201
-
223.

[260]

P. Pudlák,

Cycles of nonzero elem
ents in low rank matrices, Combinatorica 22 (2),
2002, 321
-
334.

[261]

P. Pudlák
, On reducibility and symmetry of disjoint NP
-
pairs, Theor. Comput.
Science 295 (2003) 323
-
339.

[262]

P. Pudlák
, On the complexity of propositional calculus , Sets and Proofs, Invited
paper
s from Logic Colloquium'97, Cambridge Univ. Press 1999, 197
-
218.

[263]

P. Pudlák,

Proofs as games , American Math. Monthly, June
-
July 2000, 541
-
550.

[264]

P. Pudlák
, P. Paturi, F. Zane: Satisfiability coding lemma. Chicago Journal of
Theoretical Computer Science, De
cember 1999. Preliminary version in Proc. 38
-
th
FOCS, IEEE Computer Society 1997, 566
-
574.

[265]

A. Pultr
, J. Sichler and V. Trnková, Homomorphisms of complete distributive lattices,
Quaestiones Mathematicae 23 ( 2000), 259
-
268.

[266]

A. Pultr
, S. E. Rodabaugh, Examp
les for different sobrieties in fixed
-
basis topology,
Topological and Algebraic Structures in Fuzzy Sets: Recent Developments in the
Mathematics of Fuzzy Sets, Trends in Logic 20 (2003), Kluwer Academic Publishers,
427
-
440.

[267]

A. Pultr
, S. E. Rodabaugh, Latt
ice
-
valued frames, functor categories, and classes of
sober spaces, Topological and Algebraic Structures in Fuzzy Sets: Recent
Developments in the Mathematics of Fuzzy Sets, Trends in Logic 20,
Kluwer
Academic Publishers, Boston/Dordrecht/London 2003, 153
-
187.

[268]

A. Pultr,

J. Sichler, A Priestley view of spatialization of frames, Cahiers de Top. et
Geom. Diff. Cat. XLI
-
3 ( 2000), 225
-
238.

[269]

A. Pultr
, W. Tholen: Loca(ic) enrichments of categories, , Cahiers de Topologie et
Geometrie Differentielle Categoriques
XLI (2000), 121
-
142

[270]

A. Pultr
, W. Tholen, Free Quillen factorization systems, Georgian Math. J. 9 (2002),
805
-
818.

[271]

A. Pultr,

A. Tozzi, Completion and coproducts of nearness frames, Proc. Symp. on
Cat. Topology, University of Cape Town (1999), 177
-

186.

[272]

A.Pu
ltr

and A. Tozzi, A note on reconstruction of spaces and maps from lattice data,
Quaestiones Mathematicae 24 (2001), 55
-
63

[273]

A. Pultr
, A. Tozzi, Continuous DCPOs as complete information systems,
Seminarberichte Hagen 74 (2003) 69
-
79.

[274]

P. Savický,
J. Sgall
,
DNF tautologies with a limited number of occurrences of every
variable, Theoretical Comput. Sci. 238(1
-
2) (2000), 495

498.

[275]

J. Sgall
: Bounds on pairs of families with restricted intersections, Combinatorica
19(4) (1999), 555
-
566.

[276]

J. Sgall
, On
-
line schedul
ing, Online Algorithms: The State of the Art, LNCS 1442
(2000), Springer
-
Verlag, 196
-
231.

[277]

J. Sgall
, G. J. Woeginger, A lower bound for cake cutting, v Proc. of the 11th Ann.
European Symp. on Algorithms (ESA), LNCS 2607, Springer
-
Verlag, Berlin 2003,
247
-
2
59.

[278]

J. Sgall
, G. J. Woeginger, The complexity of coloring graphs without long induced
paths, Acta Cybernetica 15(1) (2001), 107
-
117.

[279]

R. Šámal
, Antisymmetric flows and strong oriented coloring of planar graphs, Discrete
Math. 273 (2003) 203
-
210.

[280]

R. Šámal
,

J. Vondrák
: The limit checker number of a graph, Discrete Mathematics 235
(2001) 343

347

[281]

A. Tharwat,
K. Zimmermann,

A Difference Scalarization Technique To Solve Bi
-
Criteria Location Problem , Proceddings of The First International Cnference on
Informati
cs and Systems INFOS, 17.
-
20.6.2002, The University of Cairo, Egypt, pp.
OR
-
2
-
3
-
1
-
14

[282]

T. Tichý
, Randomized on
-
line scheduling on three processors, Operations Research
Letters 32 (2004) 152
-
158.

[283]

Toth and
P. Valtr
, Geometric graphs with few disjoint edges,
Discrete Comput.
Geom. 22 (1999), 633
-
642.

[284]

P. Valtr
, Davenport
-
Schinzel trees, Combinatorica 23 (2003), 151
-
184.

[285]

P. Valtr
, Generalizations of Davenport
-
Schinzel sequences, in: Contemporary Trends
in Discrete Mathematics (from DIMACS and DIMATIA to the fu
ture), DIMACS
Series in Discrete Mathematics and Theoretical Computer Science, Volume 49, AMS
1999, pp. 349
-
389.

[286]

P. Valtr
, On an extremal problem for colored trees, Europ. J. Comb. 20 (1999), 115
-
121.

[287]

P. Valtr
, On galleries with no bad points, Discrete a
nd Computational Geometry 21
(1999), 193
-
200.

[288]

P. Valtr
, A sufficient condition for the existence of large empty convex polygons,
Discrete and Computational Geometry 28 (2002) 671
-
682

[289]

P.
Vilím,
R. Barták
, Filtering Algorithms for Batch Processing with Sequ
ence
Dependent Setup Times, in M. Ghallab, J. Hertzberg, P. Traverso (eds.) Proceedings
of The Sixth International Conference on Artificial Intelligence Planning and
Scheduling (AIPS 2002), AAAI Press, Toulouse 2002, pp. 312
-
320

[290]

M. Vomlelová

and J. Vomlel:

Troubleshooting: NP
-
hardness and solution methods,
Soft Computing Journal, Volume 7, Number 5, April 2003, pp. 357
-
368. Viz též
M.
Sochorová
and J. Vomlel: Troubleshooting: NP
-
hardness and solution methods, The
Fifth Workshop on Uncertainty Processing WUP
ES'2000, Jindrichuv Hradec, Czech
Republic, 20
-
24th June 2000

[291]

M. Vomlelová
: Complexity of decision
-
theoretic troubleshooting, International
Journal of Intelligent Systems,Volume 18, Issue 2, 267
-
277, viz též
M. Vomlelová

Complexity of decision
-
theoretic tr
oubleshooting. In Proceedings of 9th Spanish
Association for Artificial Intelligence Conference and 4th Technological Transfer of
Intelligence Artificial Congress, Gijo'n, Spain, November 14
-
16, 2001

[292]

K. Zimmermann
, Generalized fuzzy relational inequalities

and related problems, Int.
J. General Systems 29(4) (2000), 637
-
644.

[293]

K. Zimmermann
, The Absolute Balance Point of a Path (spoluautor Žerovnik, J.), in
Proceedings of SOP 2001, Preddvor, 2001, ed. L. Lenart, L. Zadnik
-
Stirn, S. Drobne,
stránky 183
-
188.

[294]

K. Zimmermann
, Some Machine
-
Time Synchronization Problems, in Proceedings of
SOR 2001,

Preddvor, 2001, ed. L. Lenart, L. Zadnik
-
Stirn, S. Drobne, stránky 107
-
110.

[295]

K. Zimmermann
, Solving Two
-
Sided (Max,+)
-
linear Inequalities, in Proceedinggs of
Mathematical Methods in Economics 2001, Hradec Králové, ed. M. Dlouhý, stránky
207
-
213

[296]

K. Zimmerma
nn,
A Comment to Numerical Treatment of an Asset Price Model with
Non
-
Stochastic Uncertainty by R. Tichatschke, A.Kaplan, T. Voetmann and M. B
öhm
,
Top , vol. 10, No 1, pp.43
-
45

[297]

K. Zimmermann,

Optimization Problems with Nested Constraints, Proceedings
Mathe
matical Methods in Economics, Ostrava 2002, pp.283
-
286, ISBN 80
-
248
-
0153
-
1.

[298]

K. Zimmermann,

On Some Multiple Objective Location Problems, in Proceedings of
Quantitative Methods in Economics
(Multiple Criteria Decision Making XI), Nitra
2002, pp. 281
-
286, I
SBN 80
-
8069
-
114
-
2

[299]

K. Zimmermann
: Disjunctive optimization , max
-
separable problems and Extremal
Algebras, Theoretical Computer Science 293(2003), str. 45
-
54

Lingvistické systémy

[300]

Bémová Alevtina,
Hajič Jan
,
Vidová
-
Hladká Barbora
, Panevová Jarmila
Morphological and Syntactic Tagging of the Prague Dependency Treebank 1999. In:
Journées ATALA
-

Corpus annotés pour la syntaxe; ATALA Workshop
-

Treebanks,
Paris, 153
-
159.

[301]

Blatná

R.,
Hlaváčová, J.
, Světel
ný rok, Čeština doma a ve světě 1,2/2001, FF UK
v

Praze (2001), 25
-
29.

[302]

Blatná

R.,
Hlaváčová, J.
, Dialog mezi dvěma břehy, Čeština doma a ve světě
1,2/2001, FF UK v Praze (2001), 14
-
22.

[303]

Böhmová
,
M
.
Holub
,
Use of Dependency Tree Structures for the Microconte
xt
Extraction
,
ACL2000, Workshop on Recent Advances in Natural Language
Processing and Information Retrieval (eds. Judith Klavans and Julio Gonzalo)

(2000)
,
Hong Kong, 23
-
33.

[304]

J
.
Hajič
,
Morphological Tagging: Data vs. Dictionaries
,
6th ANLP Conference / 1st

NAACL Meeting. Proceedings

(2000)
,
Seattle, Washington, ISBN 1
-
55860
-
704
-
8
, 94
-
101.

[305]

J
.
Hajič
,
Disambiguation of Rich Inflection (Computational Morphology of Czech)
,
MFF UK

2002, Praha
.

[306]

J
.
Hajič
,
O
.
Cikhart
,
Word Sense Disambiguation of Czech Texts
,
TSD'99
,
Proceedings (eds. V. Matoušek, P. Mautner, J. Ocelíková, P. Sojka)

(1999)
,
Lecture
Notes in Artificial Intelligence vol.1692, Springer, 107
-
111.

[307]

J
.
Hajič
,
M
.
Collins
,
L
.
Ramshaw
,
C
.
Tillmann
,
A Statistical Parser for Czech
,
ACL'99

(1999)
,
Maryland, USA,
505
-
512
.

[308]

J
.
Hajič
,
P
.
Krbec
,
K
.
Oliva
,
P
.
Květoň
,
V
.
Petkevič
,
Serial Combination of Rules and
Statistics: A Case Study in Czech
,
Proceedings of ACL'01

(2001)
,
Toulouse, France,
260
-
267
.

[309]

Hajič Jan
,
Kuboň Vladislav
, Hric Jano Česílko
-

an MT system for clos
ely related
languages 2000. In: ACL2000, Tutorial Abstracts and Demonstration Notes, ACL,
ISBN 1
-
55860
-
730
-
7, 7
-
8.

[310]

Hajič Jan
,
Kuboň Vladislav
, Hric Jano Machine Translation of Very Close
Languages 2000 In: 6th ANLP Conference / 1st NAACL Meeting. Proceedin
gs,
Seattle, Washington, ISBN 1
-
55860
-
704
-
8, 7
-
12.

[311]

J
.
Hajič
,
D
.
Oard
,
D
.
Demner
-
Fushman
,
B
.
Ramabhadran
,
S
.
Gustman
,
W
.
Byrne
,
D
.
Soergel
,
B
.
Dorr
,
P
.
Resnik
,
M
.
Picheny
,
Cross
-
Language Access to Recorded Speech
in the MALACH Project
,
Text, Speech and Dial
ogue. 5th International Conference,
TSD 2002

(2002)
,
Springer
, 57
-
64.

[312]

J
.
Hajič
,
J
.
Panevová
,
Z
.
Urešová
,
A
.
Bémová
,
V
.
Řezníčková
,
P
.
Pajas
,
PDT
-
VALLEX: Creating a Large
-
coverage Valency Lexicon for Treebank Annotation
,
Proceedings of The Second Workshop o
n Treebanks and Linguistic Theories

(2003)
,
Vaxjo University Press, Sweden
, 57
-
68.

[313]

Hajič Jan
, Psutka Josef, Ircing Pavel, Byrne William, Mírovský Jiří, Ramabhadran
Bhuvana, Gustman Samuel, Psutka Josef V., Radová Vlasta Language Model Data
Selection for Cz
ech ASR in the MALACH Project 2003 In: ICASSP 2003, 68
-
75.

[314]

J
.
Hajič
,
Z
.
Urešová
,
Linguistic Annotation: from Links to Cross
-
Layer Lexicons
,
Proceedings of The Second Workshop on Treebanks and Linguistic Theories

(2003)
,
Vaxjo University Press, Sweden
, 69
-
8
0.

[315]

J
.
Hajič
,
B
.
Vidová
-
Hladká
,
Czech Language Processing


PoS Tagging
,
Proceedings of the First International Conference on Language Resources &
Evaluation

(1998)
,
Granada, Spain, 931
-
936
.

[316]

J
.
Hajič
,
B
.
Vidová
-
Hladká
,
Tagging Inflective Languages: Predicti
on of
Morphological Categories for a Rich, Structured Tagset
,
Proceedings of the
Conference COLING
-

ACL `98

(1998)
,
Montreal, Canada, 483
-
490
.

[317]

Hajič Jan
,
Vidová
-
Hladká Barbora
, Böhmová Alena,
Hajičová Eva
: The Prague
Dependency Treebank: A Three
-
Level Ann
otation Scenario 2003 In: Treebanks:
Building and Using Syntactically Annotated Corpora (ed. Anne Abeille), Kluver
Academic Publishers, Amsterdam, Netherlands, 286
-
293.

[318]

Hajič Jan
,
Vidová
-
Hladká Barbora
,
Hajičová Eva
, Sgall Petr,
Pajas Petr
,
Řezníčková Vero
nika
,
Holub Martin

The Current Status of the Prague Dependency
Treebank 2001 In: TSD2001 Proceedings (eds. V. Matoušek, P. Mautner, R. Mouček,
K. Taušer), LNAI 2166, Springer
-
Verlag Berlin Heidelberg New York, ISBN 3
-
540
-
42557
-
8, pp. 11
-
20.

[319]

J
.
Hajič
,
B
.
Vi
dová
-
Hladká
,
P
.
Pajas
,
The Prague Dependency Treebank:
Annotation Structure and Support
,
Proceeding of the IRCS Workshop on Linguistic
Databases

(2001)
,
University of Pennsylvania, Philadelphia, USA, 105
-
114
.

[320]

Hajič Jan
,
Vidová
-
Hladká Barbora
,
Pajas Petr

Th
e Prague Dependency Treebank:
Annotation Structure and Support 2001. In: Proceeding of the IRCS Workshop on
Linguistic Databases, Univesity of Pennsylvania, Philadelphia, USA, pp. 105
-
114.

[321]

J
.
Hajič
,
B
.
Vidová
-
Hladká
,
D
.
Zeman
,
M
.
Collins
,
L
.
Ramshaw
,
C
.
Ti
llmann
,
E
.
Brill
,
D
.
Jones
,
C
.
Kuo
,
O
.
Schwartz
,
Core Natural Language Processing Technology
Applicable to Multiple Languages
,
PBML 70

(1998)
, 73
-
82.

[322]

Hajičová Eva

A Praguian view on Optimality Theory 2000 In: Linguistica Pragensia,
Vol.X/2, ÚJČ AV ČR, ISSN

0862
-
8432, 59
-
72.

[323]

Hajičová Eva

Dependency
-
Based Underlying
-
Structure Tagging of a Very Large
Czech Corpus 2000 In: Special issue of TAL journal, Grammaires de Dépendence /
Dependency Grammars (ed. Sylvian Kahane), Hermes, 57
-
78.

[324]

Hajičová Eva

Possibilities

and Limits of Optimality in Topic
-
Focus Articulation 2002
In: Current issues in formal Slavic linguistics, Peter Lang (2001), 385
-
394.

[325]

Hajičová Eva

Syntaktický výzkum nad Českým národním korpusem 2001 In: Čeština
-

univerzália a specifika 3 (eds. Z. Hladk
á, P. Karlík), MU Brno, ISBN 80
-
210
-
2532
-
8, pp. 173
-
181

[326]

Hajičová Eva

Teorie optimality a aktuální členění věty 2000 In: Slovo a slovesnost
61, 161
-
169.

[327]

Hajičová Eva

The Prague Dependency Treebank: Crossing the Sentence Boundary
1999 In: TSD'99, Proceedings

(eds. V. Matoušek, P. Mautner, J. Ocelíková, P. Sojka),
Lecture Notes in Artificial Intelligence vol.1692, Springer

[328]

E
.
Hajičová
,
Theoretical description of language as a basis of corpus annotation: The
case of Prague Dependency Treebank
,
Prague Linguistic

Circle Papers

(2002)
,
John
Benjamins
, 111
-
127.

[329]

Hajičová Eva

Syntaktický výzkum nad ČNK 2000 In: Čeština
-

univerzália a
specifika 3. Sborník konference ve Šlapanicích u Brna, 22.
-
24.11.2000 (ed. Zdeňka
Hladká, Petr Karlík), 173
-
181.

[330]

E
.
Hajičová
,
M
.
Ceplov
á
,
Deletions and their reconstruction in tectogrammatical
syntactic tagging of very large corpora
,
Proceedings of the 18th International
Conference on Computational Linguistics (COLING)

(2000)
,
Saarbrucken, Germany,
ISBN 1
-
55860
-
717
-
X
, 278
-
284.

[331]

E
.
Hajičová
,
I
.
Kučerová
,
Argument/Valency Structure in PropBank, LCS Database
and Prague Dependency Treebank: A Comparative Pilot Study
,
Proceedings of the
Third International Conference on Language Resources and Evaluation (LREC 2002)

(2002)
,
ELRA
, 846
-
851.

[332]

Hajičov
á Eva
, Sgall Petr Semantico
-
Syntactic Tagging of Very Large Corpora: the
Case of Restoration of Nodes on the Underlying Level 2000 In: LREC (2nd Intern.
Conference), vol.I (eds. M. Gavrilidou, G. Carayannis, S. Markantonatou, S. Piperidis,
G. Stainhaouer),

Athens, Greece, pp. 95
-
98.

[333]

E
.
Hajičová
,
P
.
Sgall
,
Topic
-
focus and salience
,
Proceedings of 39th Annual Meeting
of the Association for Computational linguistics, 10 thconference of the European
Chapter. Proceedings

(2001)
,
Toulouse: CNRS
, 268
-
273.

[334]

Hajičová Eva
, Sgall Petr, Buráňová Eva
Tagging of a very large corpora: Topic
-
Focus Articulation 2000 In: Proceedings of the 18th International Conference on
Computational Linguistics (COLING), Saarbrucken, Germany, ISBN 1
-
55860
-
717
-
X,
139
-
144.

[335]

E
.
Hajičová
,
P
.
Sgall
,
K
.
Veselá
,
Information stru
cture and contrastive topic
,
Formal
approaches to Slavic linguistics. The Amherst Meeting 2002

(2003)
,
Michigan Slavic
Publications
, 219
-
234.

[336]

Hlaváčová, J.

-

Rychlý, P.: Dispersion of Words in a Language Corpus. Proc.TSD
1999, Springer
-
Verlag Berlin Heidel
berg 1999, pp. 321
-
324.

[337]

Hlaváčová, J.
: Morphological Guesser of Czech Words. Proc. TSD 2001. Springer
-
Verlag Berlin Heidelberg 2001, pp. 70
-
75.

[338]

Hlaváčová, J.
: Rarity of Words in a Language and in a Corpus. Proc. LREC 2000,
Athens 2000, pp. 1595
-
1598.

[339]

Holub

Martin

Context Information Mining I., Motivation and Syntactic Issues 2000
In: PBML 73
-
74, 2002, 46
-
62.

[340]

M
.
Holub
,
Use of Dependency Microcontexts in Information Retrieval
, Proceedings
of the 27th Annual Conference on Current Trends in Theory and Practice
of
Informatics (eds.
V. Hla
váč, K. G. Jeffery, J. Wiedermann),

SOFSEM 2000

(2000)
,
Springer Verlag, 347
-
355.

[341]

M
.
Holub
,
P
.
Míka
,
MATES
-

An Experimental Linguistic Database System
,
Proceeding of the IRCS Workshop on Linguistic Databases

(2001)
,
University of
Pennsylvania, Philadelphi
a, USA, 134
-
140
.

[342]

Krbec, Pavel, Podveský, Petr,
Hajič Jan
: Combination of a Hidden Tag Model and a
Traditional N
-
gram Model: A Case Study in Czech Speech Recognition. Eurospeech
2003, ISCA (2003), Geneva, Switzerland, 2289
-
2291.

[343]

G
.
Kruijff
,
I
.
Kruijffová
,
J
.
Hana
,
H
.
Skoumalová
,
S
.
Sharoff
,
E
.
Teich
,
J
.
Bateman
,
L
.
Sokolova
,
T
.
Hartley
,
K
.
Staykova
,
A Multilingual System for Text Generation in
Three Slavic Languages
,
Proceedings of the 18th International Conference on
Computational Linguistics (COLING)

(200
0)
,
Saarbrucken, Germany, ISBN 1
-
55860
-
717
-
X
, 474
-
480.

[344]

Kuboň Vladislav

A Method for Analyzing Clause Complexity 2001. In: PBML 75,
UK Praha, pp. 5
-
28

[345]

V
.
Kuboň
,
Multilingual Aspects of Monolingual Corpora
,
In the proceedings of
Sprachtechnlogie fuer die Multilinguale Kommunikation, GLDV
-
Fruejahrstagung
2003

(20
03)
,
Gardez
-
Verlag, 283
-
298
.

[346]

V
.
Kuboň
,
T
.
Holan
,
K
.
Oliva
,
M
.
Plátek
,
Word
-
Order Relaxations & Restrictions
within a Dependency Grammar
,
Proceedings of International Workshop on Parsing
Technologies

(2001)
,
Tsinghua University Press, ISBN7
-
302
-
04925
-
4, 237
-
240
.

[347]

Kuboň Vladislav
, Plátek Martin A Method of Accurate Robust Parsing for Czech
2001 In: TSD2001 Proceedings (eds. V. Matoušek, P. Mautner, R. Mouček, K.
Taušer), LNAI 2166, Springer
-
Verlag Berlin Heidelberg New York, ISBN 3
-
540
-
42557
-
8, pp. 92
-
69

[348]

Lopat
ková Markéta
,
Řezníčková Veronika
,
Žabokrtský Zdeněk

Valency Lexicon
for Czech: from Verbs to Nouns 2002 In: Text, Speech and Dialogue. 5th International
Conference, TSD 2002, Springer, 147
-
150.

[349]

Panevová Jarmila,
Hajičová Eva
, Sgall Petr Coreference in Ann
otating a Large
Corpus 2000 In: LREC (2nd Intern. Conference), vol.I (eds. M. Gavrilidou, G.
Carayannis, S. Markantonatou, S. Piperidis, G. Stainhaouer), Athens, Greece, 497
-
500.

[350]

J
.
Panevová
,
J
.
Klímová
,
Deminutivní substantiva v Českém národním korpusu a
možnosti jejich automatického zpracování
,
Člověk a jeho jazyk; 1. Jazyk jako
fenomén kultury (na počesť profesora Jána Horeckého) (ed. Kl. Buzássyová)

(2000)
,
Veda, vydavateľstvo Slovenskej akadémi vied, Bratislava, ISBN 80
-
224
-
0641
-
4
, 296
-
306.

[351]

Panevová Ja
rmila,
Řezníčková Veronika
,
Urešová Zdeňka
: The Theory of Control
Applied to the Prague Dependency Treebank (PDT) 2002 In: Proceedings of the 6th
International Workshop on Tree Adjoining Grammars and Related Frameworks
(TAG+6), Universita di Venezia, 175
-
1
80.

[352]

Panevová Jarmila,

Straňáková
-
Lopatková Markéta

Some Types of Syntactic
Ambiguity; How to Treat Them in an Automatic Procedure 1999 In: TSD'99,
Proceedings (eds. V. Matoušek, P. Mautner, J. Ocelíková, P. Sojka), Lecture Notes in
Artificial Intelligence
vol.1692, Springer, 125
-
132.

[353]

M
.
Plátek
,
M
.
Lopatková
,
K
.
Oliva
,
Restarting Automata: Motivations and
Applications
,
Proceedings of the workshop "Petrinetze"

(2003)
,
Technische
Universitaet Muenchen
, 90
-
96.

[354]

Řezníčková Veronika
,
Urešová Zdeňka
: K syntaktické
anotaci textu z Českého
národního korpusu: od analytické k tektogramatické rovině 2002 In: Aktuálne otázky
slovenskej syntaxe, 46
-
55.

[355]

Savický, P.
-

Hlaváčová, J.
: Measures of Word Commonness. Journal of Quantitative
Linguistics, Swets & Zeitlinger 2002, Vo
l. 9, No. 3, pp. 215
-
231

[356]

P
.
Sgall
,
Z
.
Žabokrtský
,
S
.
Džeroski
,
A Machine Learning Approach to Automatic
Functor Assignment in the Prague Dependency Treebank
,
Proceedings of the Third
International Conference on Language Resources and Evaluation (LREC 2002)

(2002)
,
ELRA
, 1513
-
1520.

[357]

Straňáková
-
Lopatková Markéta

Ambiguity of Prepositional Groups: Classification,
Criteria and Method for Automatic Processing. 2001 In: On Prepositions (eds. L.
Šaric, D. F. Reindl), Studia Slavica Oldenburgensia 8, Bibliotheks
-

un
d
Informationssystem, Oldenburg, pp.263
-
282

[358]

Straňáková
-
Lopatková Markéta

Některé typy syntaktické homonymie (z hlediska
možnosti automatického zpracování) 2001 In: Čeština
-

univerzália a specifika 3,
Sborník konference ve Šlapanicích u Brna, 22.
-
24.11.200
0 (eds. Z. Hladká, P. Karlík),
MU Brno, ISBN 80
-
210
-
2532
-
8, pp. 183
-
195

[359]

Straňáková
-
Lopatková Markéta
, Kopeček Ivan, Pala Karel Ambiguity Problems in
Human
-
Computer Interaction 2001 In: Proceedings of the conference UAHCI, vol.3
(ed. C. Stephanidis), LEAmah
wah, New Jersey, ISBN 0
-
8058
-
3609
-
8, pp.486
-
490

[360]

M
.
Straňáková
-
Lopatková
,
H
.
Skoumalová
,
Z
.
Žabokrtský
,
Enhancing the
Valency Dictionary of Czech Verbs: Tectogrammatical Annotation
,
TSD2001
Proceedings (eds. V. Matoušek, P. Mautner, R. Mouček, K. Taušer), L
NAI 2166

(2001)
,
Springer
-
Verlag Berlin Heidelberg New York, ISBN 3
-
540
-
42557
-
8, 142
-
149
.

[361]

M
.
Straňáková
-
Lopatková
,
Z
.
Žabokrtský
,
Valency Dictionary of Czech Verbs:
Complex Tectogrammatical Annotation
,
Proceedings of the Third International
Conference on L
anguage Resources and Evaluation (LREC 2002)

(2002)
,
ELRA
, 949
-
956.

[362]

Vidová
-
Hladká Barbora

The Context (not only) for Humans 2000 In: LREC (2nd
Intern. Conference), vol.II (eds. M. Gavrilidou, G. Carayannis, S. Markantonatou, S.
Piperidis, G. Stainhaouer),
Athens, Greece, 1113
-
1116.

[363]

Vidová
-
Hladká Barbora
, Panevová Jarmila, Ribarov Kiril,
Kuboň Vladislav
,
Zeman Daniel, Čmejrek Martin, Cuřín Jan, Peterek Nino Počítačová lingvistika ve
vztahu k informatice 2000 In: Pokroky matematiky, fyziky a astronomie, roč. 45, č.3,
207
-
218.

[364]

Žabokrtský Zdeněk

Automatic Functor Assignment in the Prague Depe
ndency
Treebank 2000 In: TSD2000, Proceedings (eds. P. Sojka, I. Kopeček, K. Pala),
Lecture Notes in Artificial Intelligence vol.1902, Springer, ISBN 3
-
540
-
41042
-
2, 45
-
50.

[365]

Žabokrtský Zdeněk
, De Cock M., Kerre E. Modelling Linguistics Hedges by L
-
Fuzzy Modi
fiers 2001 In: Proceedings of CIMCA 2001, 63
-
68.

[366]

Žabokrtský Zdeněk
, Smrž Otakar Arabic Syntactic Trees: from Constituency to
Dependency 2003 In: EACL 2003 Conference Companion, Association for
Computational Linguistics, Budapest, Hungary,
183
-
186.

Distribu
ované a informační systémy

[367]

Adámek, J
.
: Static Analysis of Component Systems Using Behavior Protocols. In:
OOPSLA 2003 Companion, Anaheim, CA, USA , ACM, Oct 2003, pp. 116
-
117.

[368]

Adámek, J., Plášil, F
.
: Behavior Protocols Capturing Errors and Updates, In:
Pro
ceedings of International Workshop on Unanticipated Software Evolution (USE
2003), ETAPS, published by University of Warsaw, Poland, Apr 2003, pp. 17
-
25.

[369]

Antolík, J.,
Mrázová, I
.
: Organizing Large Image Documents with Self
-
Organizing
Feature Maps. In: Proc
. of Information Technologies


Application and Theory (ITAT
2002), Prírodovedecká fakulta UPJŠ, Košice, Slovakia, 2002, pp. 45
-
58.

[370]

Bálek, D
.,
Plášil, F
.
: Software Connectors and Their Role in Component Deployment.
In: Proceedings of DAIS‘01, Krakow, Kluwe
r, 2001, pp. 69
-
84.

[371]

Beran, M
.
: Pipelined Decomposable BSP Computers. In: Theoretical Informatics and
Applications 36, EDP Sciences, 2002, pp. 43
-
65.

[372]

Beran
, M
.
,
Mrázová, I
.
: Elastic Self
-
Organizing Feature Maps. In: Proc. of
Information Technologies


Appli
cations and Theory Conference (ITAT 2002),
Prírodovedecká

fakulta

UPJŠ,
Košice
, Slovakia, 2002, pp. 67
-
76.

[373]

Beran, M
.
: Pipelined Decomposable BSP Computers (extended abstract). In: Proc. of
SOFSEM 2001, LNCS 2234, Springer
-
Verlag, 2001, pp. 171
-
180.

[374]

Beran,
M
.
: Decomposable Bulk Synchronous Parallel Computers. In: Proc. of
SOFSEM‘99, LNCS 1725, Springer
-
Verlag, 1999, pp. 349
-
359.

[375]

Blair, G., Blair, L., Issarny, V.,
Tůma, P
.
, Zarras, A.: The Role of Software
Architecture in Constraining Adaptation in Component
-
based Middleware Platforms.
In: Proceedings of Middleware 2000, IFIP/ACM International Conference on
Distributed Systems Platforms and Open Distributed Processing, Hudson River
Valley, USA. Springer Verlag, LNCS 1795, Apr 2000, pp. 194
-
184.

[376]

Buble, A., Bule
j, L
.,
Tůma, P
.
: CORBA Benchmarking: A Course With Hidden
Obstacles. In: Proceedings of the IPDPS Workshop on Performance Modeling,
Evaluation and Optimization of Parallel and Distributed Systems (PMEOPDS 2003),
Nice, France, IEEE CS Press, Apr. 2003, abstract pp
. 279, CDROM
data/w18_pmeo_11.pdf,
6 pages.

[377]

Bureš, T
.,
Plášil, F
.
: Scalable Element
-
Based Connectors. In: Proceedings of SERA
2003, San Francisco, USA, The International Association for Computer & Information
Science (ACIS), Jun 2003, pp. 198
-
204.

[378]

Dvorský,

J.,
Pokorný, J
.
, Snášel, V.: Word
-
based Compression Methods for Large
Text Documents. In: Proc. of the Data Compression Conference (DCC‘99), Snowbird,
Utah, USA, IEEE Computer Society, March 1999, pp. 134
-
135.

[379]

Dvorský, J.,
Pokorný, J
.
, Snášel, V.: Compres
sion Methods for Large Multilingual
Text Documents. In: Proc. of the 1999 International Symposium on Database, Web
and Cooperative Systems, Vol. 1, The International Institute for Advanced Studies in
Systems Research and Cybernetics Baden
-
Baden, August, 19
99, pp.158
-
163.

[380]

Dvorský, J.,
Pokorný, J
.
, Snášel, V.: Word
-
based Compression Methods and Indexing
for Text Retrieval Systems. Proc. of the 3rd East European Conf. on Advances in
Databases and Information Systems (ADBIS‘99), Springer Verlag, Berlin
-
Heidelbe
rg,
1999, pp.61
-
74.

[381]

Hloušek, P
.,
Pokorný, J
.
: Refining OEM to Improve Features of Query Languages for
Semistructured Data. In: Information Systems Development: Advances in
Methodologies, Components, and Management, Kluwer Press, 2003, pp. 293
-
304.

[382]

Hnětynka
, P
.
,
Tůma, P
.
: Fighting Class Name Clashes in Java Component Systems.
In: Proceedings of JMLC 2003, Klagenfurt, Austria, Springer
-
Verlag, LNCS 2789,
Aug 2003, pp. 106
-
109.

[383]

Holan, T.,
Kuboň, V., Plátek, M.,
Oliva, K.
: A Theoretical Basis of an Architecture

of a Shell of a Reasonably Robust Syntactic Analyzer, In: Proc. of the Text, Speech
and Dialogue Conference (TSD’2003), LNCS 2807, Springer
-
Verlag, 2003, pp. 58
-
65.

[384]

Chlada, M.,
Mrázová, I
.
, Převorovský, Z.: Acoustic Emission and Feature Selection
based on

Sensitivity Analysis. In: Proc. of the NOSTRADAMUS‘2000 International
Prediction Conference, Zlín,Univerzita Tomáše Bati, 2001, pp. 527
-
534.

[385]

Jan
čar, P.,
Mráz, F., Plátek, M
.
, Vogel, J.: On Monotonic Automata with a Restart
Operation. In: Journal of Automa
ta, Languages and Combinatorics, Vol. 4, No. 4,
1999
, pp.
287
-
311.

[386]

Kalibera, T
.,
Tůma, P
.
: Distributed Component System Based On Architecture
Description: The SOFA Experience. In: Proceedings of DOA 2002, Irvine, CA, USA,
Springer
-
Verlag, LNCS 2519, Oct 20
02, pp. 981
-
994.

[387]

Král, J
.
,
Žemlička, M
.: Software Confederations and Alliances. In: Proc. of
CAiSE‘03 Forum: Information Systems for a Connected Society. University of
Maribor Press, Maribor, Slovenia, pp. 229
-
232.

[388]

Král, J
.
,
Žemlička, M
.: Mathematical Sta
tistics in SW Engineering Education In: Proc.
of Information Technology and Organizations: Trends, Issues, Challenges, and
Solutions. Idea Group Publishing, Hershey, USA, pp. 889
-
890.

[389]

Král, J
.
,
Žemlička, M
.: Software Confederations and Manufacturing. In: P
roc. of 5th
International Conference on Enterprise Information Systems (ICEIS 2003), Vol. 3,
EST Setúbal, Setúbal, 2003, pp. 650
-
653.

[390]

Král, J
.
,
Žemlička, M
.: Software Confederations
-

An Architecture for Global Systems
and Global Management. In: Managing G
lobally with Information Technology, Idea
Group Publishing, 2003, pp. 57
-
81.

[391]

Král, J
.
,
Žemlička, M
.: Semi
-
top
-
down Syntax Analysis. In: Grammars and Automata
for String Processing: From Mathematics and Computer Science to Biology, and
Back. Taylor and Fran
cis, London, pp. 77
-
89.

[392]

Král, J
.
,
Žemlička, M
.: Necessity, Challenges, and Promisses of Peer
-
to
-
peer
Architecture of Information Systems. In: New Perspectives on Information Systems
Development: Theory, Methods and Practice, Kluwer Academic, New York, 2002
, pp.
125
-
134.

[393]

Král, J
.
,
Žemlička, M
.: Global Management and Software Confederations. In: Issues
& Trends of Information Technology Management in Contemporary Organizations.
Idea Group Publishing, London, 2002, pp. 1021
-
1023.

[394]

Král, J
.
,
Žemlička, M
.: Petri

Nets Like Models of Software Confederations. In: Proc.
of 5th International Conference ISM‘02
-

Information Systems Modelling. MARQ,
Ostrava 2002. pp. 251
-
258.

[395]

Král, J
.
,
Žemlička, M
.: Systemic Issues of Software Confederations. In: Cybernetics
and Systems

2002, Vol. 1, Austrian Society for Cybernetic Studies, Vienna, 2002. pp.
141
-
146.

[396]

Král, J
.
,
Žemlička, M
.: Software Confederations and the Maintenance of Global
Software Systems. In: Software Maintenance and Reengineering. Budapest, 2002, pp.
61
-
66.

[397]

Král,
J
.
,
Žemlička, M
.: Component Types in Software Confederations. In: Applied
Informatics. ACTA Press, Anaheim, 2002, pp. 125
-
130.

[398]

Král, J
.
,
Žemlička, M
.: Electronic Government and Software Confederations. In: Proc.
of 12th International Workshop on Database a
nd Experts System Application. IEEE
Computer Society, Los Alamitos, CA, USA, 2001, pp. 383
-
387.

[399]

Král, J
.
,
Žemlička, M
.: Education of Information Experts: Do We Understand our
Ultimative Needs? In: Proc. of Conference Systems Integration 2000, Prague
Univer
sity of Economics, Prague, 2001, pp. 545
-
551.

[400]

Král, J
.
,
Žemlička, M
.: Autonomous Components. In: Proc. of SOFSEM‘2000:
Theory and Practice of Informatics, Milovy, Springer Verlag, 2000, pp. 375
-
383.

[401]

Král, J
.
, Töpfer, P.: Education of Software Experts for a

Changing World. In: Proc. of
2nd Global Congress on Engineering Education. Wismar, Germany, 2000, pp. 267
-
271.

[402]

Král, J
.
,
Žemlička, M
.: System Integration with Autonomous Components. In: Proc.
of Conference on Systems Integration, Prague University of Econ
omics, Prague, 2000,
pp. 499
-
506.

[403]

Král, J
.
: Middleware Orientation
-

Inverse Software Development Strategy. In:
Proceedings of the International Conference on Information Systems Development
(ISD‘99), Boise, Idaho, Kluwer Academic, 1999.

[404]

Krátký, M.,
Pokorn
ý, J
.
, Snášel, V.: Indexing XML data with UB
-
trees. In: Proc. of
the 6th East European Conf. on Advances in Databases and Information Systems
(ADBIS 2002), Vol. 2: Research Communications, Bratislava, 2002, pp.155
-
164.

[405]

Krátký, M., Skopal, T.,
Pokorný, J
.
,
Snášel, V.: The Geometric Framework for Exact
and Similarity Querying XML data. In: Proc. of the 1st EurAsian Conf. on
Information and Communication Technology, Shiraz, Iran, 2002, Springer Verlag,
LNCS 2510, pp.35
-
46.

[406]

Mencl, V
.
: Autonomous Points in Compo
nent Composition. In: OOPSLA 2001
Companion, Tampa, FL, USA, ACM, Oct 2001, pp. 83
-
84.

[407]

Moravec, P.,
Pokorný, J
.
, Snášel, V: Vector Query With Signature Filtering. In: Proc.
of 6th Int. Conf. Business Information Systems, Colorado Springs, USA, pp. 1
-
6.

[408]

Mrá
z, F
.
: Lookahead hierarchies of restarting automata. In: Journal of Automata,
Languages and Combinatorics, Vol. 6, No. 4, 2001, pp. 493
-
506.

[409]

Mráz, F., Plátek, M
.
,
Procházka, M
.
:
On Special Forms of Restarting Automata. In:
Words, sequences, grammars, lang
uages: where biology, computer science, linguistics
and mathematics meet, Kluwer, Dordrecht, 2000, pp. 149
-
160.

[410]

Mráz, F., Plátek, M.,
Procházka, M.
:
Restarting Automata, Deleting, and Marcus
grammars. In: Recent Topics in Mathematical and Computational Lin
guistics, The
Publishing House of the Romanian Academy, Bucharest, 2000, pp. 218
-
233.

[411]

Mráz, F., Plátek, M
.
,
Procházka, M
.: On Special Forms of Restarting Automata. In:
Grammars, Vol. 2, No. 3, 1999, pp. 223
-
233.

[412]

Mrázová, I
.
,
Tesková, J
.
: Hierarchical Assoc
iative Memories or Storing Spatial
Patterns. In: Proc. of Information Technologies


Application and Theory (ITAT
2002), Prírodovedecká fakulta UPJŠ, Košice, Slovakia, 2002, pp. 143
-
154.

[413]

Mrázová, I
.
: Generalized Relief Error Networks and Patterns with Lowe
r Errors. In:
International Journal of Smart Engineering System Design, Vol. 4, No. 3, 2002, pp.
163
-
176.

[414]

Mrázová, I
.
: On Searching for Patterns with Lower Errors. In: Proc. of Neural
Networks and Applications, Puerto de la Cruz, Spain. World Scientific an
d
Engineering Society Press, 2001, pp. 218
-
223.

[415]

Mrázová, I
.
: Controlled Learning of GREN
-
Networks. In: Intelligent Engineering
Systems Through Artificial Neural Networks, Vol. 11, Proc. of ANNIE 2001, Saint
Louis, USA, ASME Press Series, New York, 2001, pp
. 21
-
26.

[416]

Mrázová, I
.
: Generalized Relief Error Networks, In: Smart Engineering System
Design: Neural Networks, Fuzzy Logic, Evolutionary Programming, Data Mining and
Complex Systems, Proc. of ANNIE 2000, ASME Press Series, 2000, pp. 21
-
26.

[417]

Mrázová, I., Tes
ková, J
.
: Path Prediction in Geographic Maps. In: Proc. of the
NOSTRADAMUS‘2000 International Prediction Conference, Zlín, Univerzita
Tomáše Bati, Oct 2000, pp. 190
-
195.

[418]

Mrázová, I.
, Rydvan, M
.
: Relief Error Networks in Economic Predictions. In: Proc. of
N
OSTRADAMUS
’99
Prediction Conference, Zlín, Univerzita Tomáše Bati, Oct
1999, pp. 135
-
140.

[419]

Plášil, F., Mencl, V.
: Getting “Whole Picture“ Behavior in a Use Case Model. In
:
Proceedings of IDPT 2003, Austin, TX, USA. Awarded with Rudolft Christian Carl
Diesel

Best Paper Award. Society for Design and Process Science, Dec. 2003, abstract
pp. 23, CDROM session
-
4/p
-
4
-
4.pdf, 11 pages.

[420]

Plášil, F., Mencl, V.
:

Getting “Whole Picture“ Behavior in a Use Case Model. In:
Transactions of the SDPS: Journal of Integrated Des
ign and Process Science, Vol. 7,
No. 4, Society for Design and Process Science, Grandview, Texas, Dec 2003, pp. 63
-
79.

[421]

Plášil, F
.
,
Višňovský, S
.: Behavior Protocols for Software Components. In: IEEE
Transactions on Software Engineering, Vol. 28, No. 11, N
ov 2002, pp. 1056
-
1076.

[422]

Plášil, F
.
,
Višňovský, S
., Bešta, M.: Bounding Component Behavior via Protocols. In:
Proceedings of TOOLS USA ‘99, CS IEEE, TOOLS 30, Aug 1999, pp. 387
-
398.

[423]

Plátek, M.
: Two
-
Way Restarting Automata and J
-
Monotonicity. In: Proc. of
SO
FSEM‘2001, LNCS 2234, Springer
-
Verlag, 2001, pp. 316
-
325.

[424]

Pl
átek, M., Mráz, F
.
: Degrees of (non)monotonocity of RRW
-
automata. In: Proc. of
DCAGRS 2001, Magdeburg, Germany, 2001, pp.159
-
166.

[425]

Plátek, M
.
: Weak Cyclic Forms of RW
-
automata. In: Proc. of the Dev
elopments in
Language Theory Conference (DLT’1999), Aachen, Germany, World Scientific, 1999,
pp. 92
-
99.

[426]

Plátek,
M.
: Strict Monotonicity and Restarting Automata, In: The Prague Bulletin of
Mathematical Linguistics 72, Charles University Prague, 1999, pp. 1
1
-
22.

[427]

Pokorný, J
.
: Approximate Treatment of XML Collections. In: Proc. of 6th Int. Conf.
Business Information Systems, Colorado Springs, USA, pp. 13
-
22.

[428]

Pokorný, J
.
: XML Querying with Functions. In: Proc. of the IASTED Int. Conf.
Information Systems and Da
tabases, Acta Press, Calgary, 2002, pp. 204
-
209.

[429]

Pokorný, J
.
:
XML in the Stars: A New Approach to Data Warehouses. In: New
Perspectives on Information Systems Development: Theory, Methods and Practice,
Kluwer Academic, New York, USA, 2002, pp. 489
-
506.

[430]

Pok
orný, J
.
: XML
-
lambda: an Extendible Framework for Manipulating XML data.
In: Proc. of BIS 2002 (Business Information Systems), W. Abramowicz (Ed.), Poznan,
Poland, 2002, pp. 160
-
168.

[431]

Pokorný, J
.
: XML Data Warehouse: Modelling and Querying. In: Databases an
d
Information systems. Proc. of the Fifth Int. Baltic Conference, BalticDB&IS 2002,
Tallin, June 3
-
6, 2002, pp. 267
-
280.

[432]

Pokorný, J
.
: Integration and Interoperability of Data Sources: Forward into the New
Century. In: Proc. of BITWorld 2001, American Unive
rsity of Cairo, Cairo, Egypt,
2001, pp. 1
-
17.

[433]

Pokorný, J
.
: XML: Initial Step to Data Interoperability. Proc. of Int. Conf. on
Systems Integration 2001, Prague, 2001, pp. 249
-
264.

[434]

Pokorný, J
.
, Vojtas, P.: A Data Model for Flexible Querying. In: Proc. of th
e 5th East
European Conf. on Advances in Databases and Information Systems (ADBIS 2001),
Springer Verlag, Berlin Heidelberg, 2001, pp.280
-
293.

[435]

Pokorný, J
.
: XML Functionally. In: Proceedings of IDEAS2000, IEEE Comp.
Society, 2000. pp. 266
-
274.

[436]

Pokorný, J
.
,
Sokolowský, P.: A Conceptual Modelling Perspective for Data
Warehouses. In: Electronic Business Engineering, 4. Internationale
Wirtschaftwsinformatik 1999, Heidelberg Physica
-
Verlag, 1999, pp.666
-
684.

[437]

Pokorný, J
.
: To the Stars through Dimensions and Facts.

Proc. of the 3rd
International Conference on Business Information Systems (BIS99), Poznan, Poland,
Springer Verlag, London, 1999, pp.135
-
147.

[438]

Procházka, M
.,
Plášil, F
.
: Transactions in Software Components: Container
-
Interposed Transactions. In: Internatio
nal Journal for Computer and Information
Science, Vol. 3, No. 2, Mar 2002.

[439]

Procházka, M
.,
Plášil, F
.
: Container
-
Interposed Transactions. In: Proceedings of the
Component
-
Based Software Engineering special session of the SNPD 2001
Conference, Nagoya, Japan,

Aug 2001, pp. 799
-
808.

[440]

Skopal T.,
Pokorný, J
.
, Krátký, M., Snášel, V.: Revisiting M
-
tree Building Principles.
In: Proc. of the 7th East European Conf. on Advances in Databases and Information
Systems (ADBIS 2003), Springer
-
Verlag LNCS 2798, 2003, pp. 148
-
162.

[441]

Tůma, P
.
,
Buble, A
.: Overview of the CORBA Performance. In: Proceedings of the
2002 EurOpen.CZ Conference, Znojmo, Czech Republic, Sep 2002.

[442]

Tůma, P
.
,
Buble, A
.: Open CORBA Benchmarking. In: Proceedings of the 2001
International Symposium on Performan
ce Evaluation of Computer and
Telecommunication Systems (SPECTS 2001), Orlando, FL, USA, Society for
Modeling and Simulation, Jul 2001, pp. 351
-
358.

[443]

Tůma, P
.
, Issarny, V., Zarras, A.: Using Meta
-
Level Architectural Description
Towards the Systematic Synthe
sis of Middleware. In: Proceedings of the
Reflection‘99 conference, St. Malo, France, LNCS 1616, Jul 1999, pp. 144
-
146.

[444]

Wiedermann, J.,
Beran, M
.
: The Cogitoid: Towards a Computational Model of the
Mind. ERCIM News 53, April 2003, pp. 19
-
20.

[445]

Žemlička, M
.,
Král, J
.
: Semitopdown Parsing in Information Systems, In: Proc. of
SCI/ISAS 2000 Conference, Orlando, Florida, USA, 2000, pp. 291
-
297.

[446]

Žemlička, M
.,
Král, J
.
: Run
-
Time Extensible Deterministic Top
-
Down Parsing. In:
Grammars, Vol. 2, No.3, Kluwer Academic,

1999, pp. 283
-
293.

[447]

Žemlička, M
.,
Král, J
.
: Run
-
Time Extensible (Semi
-
)Top
-
Down Parsing. In: Proc. of
the Workshop on Text, Speech and Dialogue, LNAI 1692, Springer, 1999, pp. 121
-
126.