<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="ru">
		<id>https://discopal.ispras.ru/index.php?action=history&amp;feed=atom&amp;title=En.index.htm</id>
		<title>En.index.htm - История изменений</title>
		<link rel="self" type="application/atom+xml" href="https://discopal.ispras.ru/index.php?action=history&amp;feed=atom&amp;title=En.index.htm"/>
		<link rel="alternate" type="text/html" href="https://discopal.ispras.ru/index.php?title=En.index.htm&amp;action=history"/>
		<updated>2026-04-19T05:05:38Z</updated>
		<subtitle>История изменений этой страницы в вики</subtitle>
		<generator>MediaWiki 1.26.4</generator>

	<entry>
		<id>https://discopal.ispras.ru/index.php?title=En.index.htm&amp;diff=600&amp;oldid=prev</id>
		<title>StasFomin: Новая страница: «Welcome to homepage of DISCOPAL — the group of Discrete Optimization Algorithms at Department of Mathematical Methods and Algorithms Institute For System Programmi...»</title>
		<link rel="alternate" type="text/html" href="https://discopal.ispras.ru/index.php?title=En.index.htm&amp;diff=600&amp;oldid=prev"/>
				<updated>2010-11-25T19:21:01Z</updated>
		
		<summary type="html">&lt;p&gt;Новая страница: «Welcome to homepage of DISCOPAL — the group of Discrete Optimization Algorithms at Department of Mathematical Methods and Algorithms Institute For System Programmi...»&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Новая страница&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Welcome to homepage of DISCOPAL — the group of Discrete Optimization Algorithms at Department of Mathematical Methods and Algorithms Institute For System Programming Russian Academy of Sciences. (Official page of the Department is [http://www.ispras.ru/%7Emart/ here]. Official page of the ISPRAS is [http://www.ispras.ru/ here]).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
The goal of this page is to provide the information for some of the groups projects.&lt;br /&gt;
&lt;br /&gt;
== Main areas of our research ==&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
=== Combinatorics ===&lt;br /&gt;
&lt;br /&gt;
* packing and covering problems&lt;br /&gt;
* explicit constructions&lt;br /&gt;
* codes, expanders and Steiner systems&lt;br /&gt;
&lt;br /&gt;
Results were [[en.nnkuzbib.htm|published]] in: European J. Combinatorics, Combinatorics, Probability and Computing, Lecture Notes in CS, J. Combin. Designs, Information Process. Letters&lt;br /&gt;
&lt;br /&gt;
=== Graphs, Hypergraphs and Partially ordered sets ===&lt;br /&gt;
&lt;br /&gt;
* extremal problems&lt;br /&gt;
&lt;br /&gt;
Results were [[en.nnkuzbib.htm|published]] in: Combinatorica, J. Comb. Theory, Order, Discrete Math.&lt;br /&gt;
* p-cycle optimization problem: design of fiber optic communication networks with fast restoration joint project with Nortel Networks — 2000&lt;br /&gt;
&lt;br /&gt;
Approximation algorithms in linear integer programming (IP)&lt;br /&gt;
&lt;br /&gt;
* randomized rounding technique&lt;br /&gt;
* derandomization&lt;br /&gt;
* fast heuristic algorithms for specific IPs&lt;br /&gt;
* fast approximation LP algorithms&lt;br /&gt;
&lt;br /&gt;
Results were [[en.nnkuzbib.htm|published]] in: Discrete Math. Applications, Discrete Analysis and Operations Rsearch, Math. Methods in Operations Research&lt;br /&gt;
&lt;br /&gt;
=== Programs obfuscation ===&lt;br /&gt;
&lt;br /&gt;
complexity analysis of program transformations (reverse engineering). Joint project with [http://www.cloakware.com/ Cloakware Corp].&lt;/div&gt;</summary>
		<author><name>StasFomin</name></author>	</entry>

	</feed>