Eugeen в acrobat 9 сделал так
advanced - document processing - edit all java script
скопировал текст из окна - щелчок в окне кода, ctrl+a, ctrl+c
[more]
//-------------------------------------------------------------
//-----------------Do not edit the XML tags--------------------
//-------------------------------------------------------------
//<Bookmark>
//<ACRO_source>Front Matter:Action1</ACRO_source>
//<ACRO_script>
/*********** belongs to: Bookmark:Front Matter:Action1 ***********/
this.pageNum=0
//</ACRO_script>
//</Bookmark>
//<Bookmark>
//<ACRO_source>Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design:Action1</ACRO_source>
//<ACRO_script>
/*********** belongs to: Bookmark:Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design:Action1 ***********/
this.pageNum=9
//</ACRO_script>
//</Bookmark>
//<Bookmark>
//<ACRO_source>Cleaning Random d -Regular Graphs with Brushes Using a Degree-Greedy Algorithm:Action1</ACRO_source>
//<ACRO_script>
/*********** belongs to: Bookmark:Cleaning Random d -Regular Graphs with Brushes Using a Degree-Greedy Algorithm:Action1 ***********/
this.pageNum=19
//</ACRO_script>
//</Bookmark>
//<Bookmark>
//<ACRO_source>Nonadaptive Selfish Routing with Online Demands:Action1</ACRO_source>
//<ACRO_script>
/*********** belongs to: Bookmark:Nonadaptive Selfish Routing with Online Demands:Action1 ***********/
this.pageNum=33
//</ACRO_script>
//</Bookmark>
//<Bookmark>
//<ACRO_source>Vertex Pursuit Games in Stochastic Network Models:Action1</ACRO_source>
//<ACRO_script>
/*********** belongs to: Bookmark:Vertex Pursuit Games in Stochastic Network Models:Action1 ***********/
this.pageNum=52
//</ACRO_script>
//</Bookmark>
//<Bookmark>
//<ACRO_source>Preemptive Scheduling on Selfish Machines:Action1</ACRO_source>
//<ACRO_script>
/*********** belongs to: Bookmark:Preemptive Scheduling on Selfish Machines:Action1 ***********/
this.pageNum=63
//</ACRO_script>
//</Bookmark>
//<Bookmark>
//<ACRO_source>Selfish Routing and Path Coloring in All-Optical Networks:Action1</ACRO_source>
//<ACRO_script>
/*********** belongs to: Bookmark:Selfish Routing and Path Coloring in All-Optical Networks:Action1 ***********/
this.pageNum=77
//</ACRO_script>
//</Bookmark>
//<Bookmark>
//<ACRO_source>A Worst-Case Time Upper Bound for Counting the Number of Independent Sets:Action1</ACRO_source>
//<ACRO_script>
/*********** belongs to: Bookmark:A Worst-Case Time Upper Bound for Counting the Number of Independent Sets:Action1 ***********/
this.pageNum=91
//</ACRO_script>
//</Bookmark>
//<Bookmark>
//<ACRO_source>Improving the Efficiency of Helsgauns Lin-Kernighan Heuristic for the Symmetric TSP:Action1</ACRO_source>
//<ACRO_script>
/*********** belongs to: Bookmark:Improving the Efficiency of Helsgauns Lin-Kernighan Heuristic for the Symmetric TSP:Action1 ***********/
this.pageNum=105
//</ACRO_script>
//</Bookmark>
//<Bookmark>
//<ACRO_source>Combinatorial Algorithms for Listing Paths in Minimal Change Order:Action1</ACRO_source>
//<ACRO_script>
/*********** belongs to: Bookmark:Combinatorial Algorithms for Listing Paths in Minimal Change Order:Action1 ***********/
this.pageNum=118
//</ACRO_script>
//</Bookmark>
//<Bookmark>
//<ACRO_source>Improving Topological Routing in N2R Networks:Action1</ACRO_source>
//<ACRO_script>
/*********** belongs to: Bookmark:Improving Topological Routing in N2R Networks:Action1 ***********/
this.pageNum=137
//</ACRO_script>
//</Bookmark>
//<Bookmark>
//<ACRO_source>Back Matter:Action1</ACRO_source>
//<ACRO_script>
/*********** belongs to: Bookmark:Back Matter:Action1 ***********/
this.pageNum=155
//</ACRO_script>
//</Bookmark>
[/more]
потом в панели bookmarks щелчок ЛКМ по любой закладке,
ctrl+a, del, ctrl+s, ctrl+w
в ms word "поиск и замена" ctrl+h (с подстановочными символами)
удалил все тэги, получил
[more]
Front Matter 1
Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design 10
Cleaning Random d -Regular Graphs with Brushes Using a Degree-Greedy Algorithm 20
Nonadaptive Selfish Routing with Online Demands 34
Vertex Pursuit Games in Stochastic Network Models 53
Preemptive Scheduling on Selfish Machines 64
Selfish Routing and Path Coloring in All-Optical Networks 78
A Worst-Case Time Upper Bound for Counting the Number of Independent Sets 92
Improving the Efficiency of Helsgauns Lin-Kernighan Heuristic for the Symmetric TSP 106
Combinatorial Algorithms for Listing Paths in Minimal Change Order 119
Improving Topological Routing in N2R Networks 138
Back Matter 156
[/more]
первую строку с нулевой страницей подправил вручную
вставил в букмаркер и в файл внедрил.
все.
с учетом имеющихся проблем попробуйте Acrobat Pro 9 (с обновлениями до 9.4.7)
вот
ваш файл потратил 5 минут. владение заменой (с подстановочными символами) в ворд или подобном редакторе необходимое условие.
возраст не помеха.
свойства закладок можно посмотреть прямо в Акробате - ПКМ по закладке и Properties