2005 RUTCOR Research Reports

ABSTRACTS
1-2005 Optimality Constraints For the Cone of Positive Polynomials , Farid Alizadeh, Nilay Noyan, Gabor Rudolf
2-2005 Between 2- and 3-colorability , Vadim V. Lozin
3-2005 Simple And Direct Proof of Maclane's Graph Planarity Criterion , Alexander K. Kelmans
4-2005 On The Cycle Space of a 3--Connected Graph , Alexander K. Kelmans
5-2005 Composition of Post Classes and Normal Forms of Boolean Functions , Miguel Couceiro, Stephan Foldes and Erkko Lehtonen
6-2005 On the misere version of game Euclid and miserable games , Vladimir Gurvich
7-2005 Cyclically Orientable Graphs , Vladimir Gurvich
8-2005 Even-hole-free and Balanced Circulants , Diogo Andrade, Endre Boros and Vladimir Gurvich
9-2005 Local Search Heuristics for Unconstrained Quadratic Binary Optimization , Endre Boros, Peter L. Hammer and Gabriel Tavares
10-2005 Logical Analysis of Data: From Combinatorial Optimization to Medical Applications , Peter L. Hammer and Tiberius Bonates
11-2005 Fairness Considerations in Multi-Server and Multi-Queue Systems , David Raz, Benjamin Avi-Itzhak and Hanoch Levy
12-2005 Clustering Data with Measurement Errors , Mahesh Kumar and Nitin R. Patel
13-2005 Graphs of low chordality , L.S. Chandran, V.V. Lozin and C.R. Subramanian
14-2005 Linear Programming Approach for Optimal Protein Encoding , E. Boros and L. Everett
15-2005 Minimal Universal Bipartite Graphs , Vadim V. Lozin and Gabor Rudolf
16-2005 Optimal Information Monitoring under a Politeness Constraint , Jonathan Eckstein, Avigdor Gal and Sarit Reiner
17-2005 Approximations for and Convexity of Probabilistically Constrained Problems with Random Right-hand Sides , M.A. Lejeune and A. Prekopa
18-2005 Generating All Vertices of a Polyhedron Is Hard , Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni and Vladimir Gurvich
19-2005 Enumerating Cut Conjunctions in Graphs and Related Problems , Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni, Vladimir Gurvich and Kazuhisa Makino
20-2005 A polynomial algorithm for partitioning a tree into single-center subtrees to minimize flat service costs , N. Apollonio, I. Lari, J.Puerto, F. Ricca and B.Simeone
21-2005 On $\Lambda$--Packing in 2--connected Graphs, Alexander K. Kelmans.
22-2005 War and Peace in Veto Voting, (Revision of RRR 13-2004) Vladimir Gurvich
23-2005 On $\Lambda$--Packing in 3--connected Graphs, Alexander K. Kelmans
24-2005 Service Time Variability and Job Scheduling Fairness, Eli Brosh, Hanoch Levy and Benjamin Avi-Itzhak
25-2005 Quantifying Fairness in Queueing Systems: Principles, Approaches and Applicability (Revision of RRR 26-2004), Benjamin Avi-Itzhak, Hanoch Levy and David Raz
26-2005 On a perfect problem, Igor E. Zverovich
27-2005 Monge Property and Bounding Multivariate Probability Distribution Functions with Given Marginals and Covariances, Xiaoling Hou and Andras Prekopa
28-2005 Scale-invariant Clustering with Minimum Volume Ellipsoids, Mahesh Kumar and James B. Orlin
29-2005 Solution of Probabilistic Constrained Stochastic Programming Problems with Poisson, Binomial and Geometric Random Variables, Tongyin Liu and Andras Prekopa
30-2005 A polynomial algorithm to find an independent set of maximum weight in a fork-free graph, Vadim V. Lozin and Martin Milanic
31-2005 Extending Dijkstra's Algorithm to Maximize the Shortest Path by Node-wise Limited Arc Interdiction, Leonid Khachiyan, Vladimir Gurvich and Jihui Zhao
32-2005 Decomposing CVaR minimization in two-stage stochastic models, Csaba I. Fábián
33-2005 Strategic Equilibrium Vs. Global Optimum for a Pair of Competing Servers, Benjamin Avi-Itzhak, Boaz Golany and Uriel G. Rothblum
34-2005 LP-Polytopes for Mean Payoff Games, Ola Svensson and Sergei Vorobyov
35-2005 Locality of Reference and the Use of Sojourn Time Variance for Measuring Queue Unfairness, David Raz, Benjamin Avi-Itzhak and Hanoch Levy
36-2005 Class treatment in Queueing Systems: Discrimination and Fairness Aspects, David Raz, Benjamin Avi-Itzhak and Hanoch Levy
37-2005 An algorithm for the acyclic hypergraph sandwich problem, Vladimir Gurvich, Nysret Musliu, Vladimir Oudalov and Marko Samer
38-2005 On Finding Augmenting Graphs, Vadim V. Lozin and Martin Milanic
39-2005 Using a similarity measure for credible classification, M. Anthony, P. L. Hammer, E. Subasi and M. Subasi
40-2005 Combining Forecasts Using Clustering, Mahesh Kumar
41-2005 Discrete Moment Problem with the Given Shape of the Distribution, Ersoy Subasi, Mine Subasi and Andras Prekopa
42-2005 Inapproximability Bounds for Shortest-Path Network Interdiction Problems, Endre Boros, Konrad Borys, Khaled Elbassioni, Vladimir Gurvich and Gabor Rudolf
43-2005 The Optimization of the Move of Robot Arm by Benders Decomposition, Zsolt Robotka and Bela Vizvari