default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Notes in Discrete Mathematics, Volume 25
Volume 25, August 2006
- Faisal N. Abu-Khzam, Henning Fernau
:
Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs. 1-6 - Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) algorithm for online topological ordering. 7-12 - Stephan Dominique Andres:
Game-perfect Graphs with Clique Number 2. 13-16 - Andrei Asinowski:
Suballowable sequences of permutations. 17-18 - Harout K. Aydinian:
An extremal problem on graphs. 19 - Janina A. Brenner, Sándor P. Fekete, Jan van der Veen:
Simultaneous Scheduling, Binding and Routing for Coarse-Grain Reconfigurable Architectures. 21-22 - H. Bricard:
An adaptation of Eppstein's algorithm dealing with the k shortest - loopless and having at most p arcs - paths problem. 23-26 - John van den Broek, Cor A. J. Hurkens, Gerhard J. Woeginger:
Timetabling problems at the TU Eindhoven. 27-28 - Tobias Brüggemann, Johann L. Hurink, Tjark Vredeveld, Gerhard J. Woeginger:
Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines. 29-33 - Maria L. A. G. Cremers, Willem K. Klein Haneveld, Maarten H. van der Vlerk:
A Two-stage Model for a Day-ahead Paratransit Planning Problem. 35 - Roman Dementiev:
Processing Huge Graphs with Stxxl. 37-38 - Benjamin Doerr, Christian Klein:
Controlled Randomized Rounding. 39-40 - Flavia Bonomo, Guillermo Durán, Javier Marenco:
Exploring the complexity boundary between coloring and list-coloring. 41-47 - Birgit Engels, Tom Kamphans:
Randolphs Robot Game is NP-hard! 49-53 - Jinfeng Feng:
Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs. 55 - Henning Fernau:
Speeding up Exact Algorithms With High Probability. 57-59 - Benjamin Doerr, Tobias Friedrich:
Quasirandomness in Graphs. 61-64 - Uwe Gotzes:
Optimal Investments in Distributed Generation Units under Uncertainty. 65 - Sven Grothklags, Ulf Lorenz:
Stochastic Airline Fleet Assignment is PSPACE-complete. 67-68 - Thomas Heinze:
An Algorithm for Multistage Stochastic Integer Programs. 69 - Guido Helde, Oliver Vieten:
Hamilton cycles in maximal planar graphs. 71 - Mini Goyal, Shahadat Hossain:
Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms. 73-80 - Gyula Y. Katona:
Hamiltonian Chains in Hypergraphs. 81-87 - Sebastian Kuhn:
Risk Neutral and Risk Averse Models for Power Optimization under Uncertainty in Electricity Networks with Dispersed Generation. 89 - Joachim Gehweiler, Christiane Lammersen, Christian Sohler:
A Distributed Algorithm for the Facility Location Problem. 91 - Dmitrii Lozovanu, Maria Fonoberova:
Optimal Dynamic Multicommodity Flows in Networks. 93-100 - Giulia Galbiati, Francesco Maffioli:
Approximating Max Cut with Limited Unbalance. 101-104 - Frederike Neise:
Optimization of Dispersed Generation Systems including Risk Aversion. 105-106 - Winfried Hochstättler, Robert Nickel, Britta Peis:
Two disjoint negative cycles in a signed graph. 107-111 - Jacob Jan Paulus, Johann L. Hurink:
Adjacent-Resource Scheduling: Why spatial resources are so hard to incorporate. 113-116 - Arnaud Pêcher, Annegret Wagler:
Generalized clique family inequalities for claw-free graphs. 117-121 - Dmitrii Lozovanu, Stefan Pickl:
Nash Equilibria Conditions for Cyclic Games with p Players. 123-129 - Raffaele Cerulli, Paolo Dell'Olmo, Monica Gentili, Andrea Raiconi:
Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem. 131-138 - Alberto Bosio, Giovanni Righini:
A dynamic programming algorithm for the single-machine scheduling problem with deteriorating processing times. 139-142 - Stefan Ruzika:
An Exact Algorithm for Solving Weight-Constrained Combinatorial Optimization Problems. 143-144 - Sleman Saliba, Sven Oliver Krumke, Stephan Westphal:
Online-Optimization of Large-Scale Vehicle Dispatching Problems. 145-146 - Ingo Schiermeyer:
Upper bounds for the chromatic number of a graph. 147-148 - Ulrich Faigle, Alexander Schönhuth:
Quantum Predictor Models. 149-155 - Juan Alberto Rodríguez-Velázquez, José María Sigarreta:
Global offensive alliances in graphs. 157-164 - Kenya Sugihara, Hiro Ito:
Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three. 165-171 - A. N. Trahtman:
Notable trends concerning the synchronization of graphs and automata. 173-175 - Arie M. C. A. Koster, Annegret Wagler:
On determining the imperfection ratio. 177-181 - Bernhard Fuchs, Walter Kern, Xinhui Wang:
The number of tree stars is O*(1.357k). 183-185 - Stephan Westphal, Sven Oliver Krumke, Rob van Stee:
Competitive Algorithms for Cottage Rental. 187-188
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-04-23 21:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
