CTW - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 515

2015

An alternative proof for the constructive Asymmetric Lovász Local LemmaIoannis Giotis 0001, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos. colognetwente 2015: 89-92

MC4, Copeland and restart probabilitiesDaniel Freund 0001, David P. Williamson. colognetwente 2015: 5-8

How to Hunt an Invisible Rabbit on a GraphTatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk. colognetwente 2015: 169-172

Probabilistic constrained dominating treesPablo Adasme, Rafael Andrade, Abdel Lisser. colognetwente 2015: 59-62

Approaches for optimizing cross-sell and up-sell opportunities in campaignsMustafa Agaoglu, Ekrem Duman, A. Hande Erol Binguler. colognetwente 2015: 295-298

Performance Comparison of Metaheuristics for the Obstacle Neutralization ProblemRamazan Algin, Ali Fuat Alkaya, Vural Aksakalli. colognetwente 2015: 24-27

On the non-unit count of interval graphsAlexander Apke, Rainer Schrader. colognetwente 2015: 67-68

Locating-dominating sets in some families of split graphsGabriela R. Argiroffo, Silvia M. Bianchi, Annegret Wagler. colognetwente 2015: 32-35

Relaxed Locally Identifying Coloring of GraphsMéziane Aïder, Sylvain Gravier, Souad Slimani. colognetwente 2015: 85-88

Neighbor Rupture Degree of a Graph with Maximum ConnectivityGoksen Bacak-Turan, Ferhan Nihan Altundag. colognetwente 2015: 69-72

Local metric dimension of subgraph-amalgamation of graphsGabriel A. Barragán-Ramírez, Rinovia Simanjuntak, Saladin Uttunggadewa, Suhadi Wido Saputro. colognetwente 2015: 285-288

Graphs with certain locating-chromatic numberEdy Tri Baskoro. colognetwente 2015: 258-260

A Snail Heuristic for the Euclidean Traveling Salesman ProblemMonia Bellalouna, Walid Khaznaji, Mohamed Abdellahi Amar. colognetwente 2015: 281-284

The Graphs of Structured ProgrammingLucila M. S. Bento, Davidson R. Boccardo, Raphael Machado, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter. colognetwente 2015: 105-108

Heuristic Solutions to a Mailroom Inserting Machine Planning ProblemAndrea Bettinelli, Sandro Bosio, Valentina Cacchiani. colognetwente 2015: 77-80

Super Connectivity of Generalized Petersen GraphsGülnaz Boruzanli, John Baptist Gauci. colognetwente 2015: 246-249

Broadcasts in Complementary PrismsIsma Bouchemakh, Ibrahim Boufelgha, Meriem Moulay. colognetwente 2015: 292-294

Forwarding Indices of Some Subdivision GraphsMohamed Amine Boutiche. colognetwente 2015: 52-54

Computing Bounds for Eternal DominationAndrei Braga, Cid C. de Souza, Orlando Lee. colognetwente 2015: 177-180

Fleet management of autonomous vehicles: VIPAFLEETSahar Bsaybes, Alain Quilliot, Annegret Wagler. colognetwente 2015: 173-176

Lower Bounds for Cover-Free FamiliesNader H. Bshouty, Ali Z. Abdi. colognetwente 2015: 48-51

An Extension of Dirac's Theorem on HamiltonicityYasemin Büyükçolak, Didem Gözüpek, Sibel Özkan. colognetwente 2015: 149-152

Dynamically Operating on Threshold Graphs and Related Classes (Extended Abstract)Tiziana Calamoneri, Angelo Monti, Rossella Petreschi. colognetwente 2015: 20-23

Convex recoloring: inapproximability and a polyhedral studyManoel B. Campêlo, Alexandre S. Freire, Phablo F. S. Moura, Yoshiko Wakabayashi. colognetwente 2015: 117-120

Facet-defining inequalities for the representatives k-fold coloring polytopeManoel B. Campêlo, Phablo F. S. Moura, Marcio C. Santos. colognetwente 2015: 73-76

Mathematical programming algorithms for spatial cloakingAlberto Ceselli, Maria Luisa Damiani, Giovanni Righini, Diego Valorsi. colognetwente 2015: 217-220

A Fixed Parameter Algorithm for Plane Subgraph CompletionDimitris Chatzidimitriou, Archontia C. Giannopoulou, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros. colognetwente 2015: 97-100

Recognition of certain square geometric graphsHuda Chuangpishit, Jeannette C. M. Janssen. colognetwente 2015: 265-268

Solving Vertex Coloring Problems as Maximum Weighted Stable Set ProblemsDenis Cornaz, Fabio Furini, Enrico Malaguti. colognetwente 2015: 36-39

Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex AlgorithmKamiel Cornelissen, Bodo Manthey. colognetwente 2015: 157-160

On the forbidden induced subgraph probe problemFernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein. colognetwente 2015: 231-234

Sorting Separable Permutations by Restricted Multi-break RearrangementsLuís Felipe I. Cunha, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo. colognetwente 2015: 145-148

On the Minimum and Maximum Selective Graph Coloring ProblemsMarc Demange, Tinaz Ekim, Bernard Ries. colognetwente 2015: 189-192

Modelling Rank Constraints in Mathematical ProgrammingGustavo Dias, Leo Liberti, Nelson Maculan. colognetwente 2015: 193-196

Equimatchable Graphs are C_2k+1-free for k ≥ 4Cemil Dibek, Tinaz Ekim, Didem Gözüpek, Mordechai Shalom. colognetwente 2015: 125-128

Polynomial time algorithm for the k-in-a-tree problem on chordal graphsVinícius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter. colognetwente 2015: 242-245

The P3-Convexity in the Complementary Prism of a GraphMárcio Antônio Duarte, Lucia Draque Penso, Dieter Rautenbach, Uéverton S. Souza. colognetwente 2015: 225-228

13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, Istanbul, Turkey, May 26-28, 2015Ekrem Duman, Ali Fuat Alkaya, editors, 2015.

Timber Game with CaterpillarsAna Luísa Furtado, Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier. colognetwente 2015: 93-96

Star Bi-Coloring of Bipartite Graphs using Column GenerationDaya Ram Gaur, Shahadat Hossain, Rishi Ranjan Singh. colognetwente 2015: 250-253

Submodular Function Maximization on the Bounded Integer LatticeCorinna Gottschalk, Britta Peis. colognetwente 2015: 16-19

Optimal pebbling of gridsErvin Györi, Gyula Y. Katona, László F. Papp. colognetwente 2015: 213-216

Edge Coloring with Minimum Reload/Changeover CostsDidem Gözüpek, Mordechai Shalom. colognetwente 2015: 205-208

Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth GraphsDidem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks. colognetwente 2015: 201-204

A branch and price algorithm for the capacitated ring tree problemAlessandro Hill, Edna Ayako Hoshino. colognetwente 2015: 273-276

Symmetry Handling via Symmetry Breaking PolytopesChristopher Hojny, Marc E. Pfetsch. colognetwente 2015: 63-66

A Generic Framework for Approximation Analysis for Algorithms for Star BicoloringDavid Juedes, Jeffrey Jones. colognetwente 2015: 185-188

A Branch-and-Price Algorithm for Optimal Decoding in LDPC-Based CommunicationsBanu Kabakulak, Z. Caner Taskin, Ali Emre Pusane. colognetwente 2015: 141-144

Linear and cyclic distance-three labellings of treesDeborah King, Yang Li, Sanming Zhou. colognetwente 2015: 133-136

A New TDVRP (Time Dependent Vehicle Routing Problem) Model and its Solution by Genetic AlgorithmM. Selcuk Korkmaz, Serol Bulkan, Ekrem Duman. colognetwente 2015: 229-230

On the intersection graphs of subspaces of a vector spaceMarcin Krzywkowski, Nader Jafari Rad, Sayyed Heidar Jafari. colognetwente 2015: 289-291

On the Smoothed Approximation Ratio of the 2-Opt Heuristic for the TSPMarvin Künnemann, Bodo Manthey. colognetwente 2015: 1-4

Determining Nash Equilibria for Dynamic Positional Games on NetworksDmitrii Lozovanu, Stefan Pickl. colognetwente 2015: 153-156

A Java Implementation of the Branch and Bound Algorithm : the Probabilistic Traveling Salesman ProblemSoumaya Sassi Mahfoudh, Walid Khaznaji, Monia Bellalouna. colognetwente 2015: 277-280

Distinguishing Number and Circulant GraphsKahina Meslem, Sylvain Gravier, Souad Slimani. colognetwente 2015: 9-11

On Hamiltonian Cycles in Kneser GraphsFelipe De Campos Mesquita, Letícia Rodrigues Bueno, Rodrigo de Alencar Hausen, Uéverton dos Santos Souza. colognetwente 2015: 121-124

The Offline Carpool ProblemSaad Mneimneh, Saman Farhat. colognetwente 2015: 221-224

Competitive Analysis of the Storage Management ProblemEsther Mohr. colognetwente 2015: 161-164

Recursive cube of ringsHamid Mokhtar, Sanming Zhou. colognetwente 2015: 137-140

Price of Fairness for Multiagent Subset Sum ProblemsGaia Nicosia, Andrea Pacifici, Ulrich Pferschy. colognetwente 2015: 55-58

The Hamilton-Waterloo Problem with C4 and Cm FactorsUgur Odabasi, Sibel Özkan. colognetwente 2015: 239-241

Balanced matchings, unbalanced ones and related problemsKatarzyna E. Paluch. colognetwente 2015: 269-272

On the decomposition of quaternary signed-graphic matroidsKonstantinos Papalamprou, Leonidas S. Pitsoulis, Eleni-Maria Vretta. colognetwente 2015: 181-184

Modeling Poset Convex SubsetsMaurice Queyranne, Laurence Wolsey. colognetwente 2015: 165-168

An Assignment Problem with Compactness Requirements: Models and AlgorithmsAlain Quilliot. colognetwente 2015: 40-43

Coloring Interval Graphs while Minimizing End-Point NumberAlain Quilliot. colognetwente 2015: 44-47

The locating chromatic number of (n-3)-regular graphsSuhadi Wido Saputro. colognetwente 2015: 109-112

Heuristic algorithms for obtaining Polynomial Threshold Functions with low densitiesCan Eren Sezener, Erhan Öztop. colognetwente 2015: 81-84

c^2-join of graphsM. A. Shalu, S. Devi Yamini. colognetwente 2015: 235-238

Bi-matrix Game with Random PayoffsVikas Vikram Singh, Oualid Jouini, Abdel Lisser. colognetwente 2015: 113-116

Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4Uéverton S. Souza, Letícia Rodrigues Bueno, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti. colognetwente 2015: 197-200

Minimum Cost Noncrossing Flow Problem on a Layered NetworkYavuz Bogaç Türkogullari, I. Kuban Altinel, Z. Caner Taskin, Zeynep Suvak, Necati Aras. colognetwente 2015: 129-132

Stochastic bilevel network design problemsChuan Xu, Alexei A. Gaivoronski, Abdel Lisser. colognetwente 2015: 261-264

Algorithmic Aspects of the Positive Semidefinite Zero ForcingBoting Yang. colognetwente 2015: 209-212

Stability of probablisitic two-stage permutation flowshop problemBouyahia Zied, Bellalouna Monia, Ghedira Khaled. colognetwente 2015: 101-104

Solving the Integrated Shipment Routing Problem of a LTL CarrierOkan Örsan Özener. colognetwente 2015: 28-31

Developing an Exact Method for the Obstacle Neutralization ProblemDindar Öz, Ali Fuat Alkaya, Vural Aksakalli. colognetwente 2015: 254-257

Double Auction with Limited Cover Money ModelAli Haydar Özer. colognetwente 2015: 12-15

2013

Connected dominating set in graphs without long paths and cyclesEglantine Camby, Oliver Schaudt. colognetwente 2013: 39-42

Testing uniformity of stationary distributionSourav Chakraborty, Akshay Kamath, Rameshwar Pratap. colognetwente 2013: 47-50

Balanced Abelian group valued functions on directed graphs: Extended abstractYonah Cherniavsky, Avraham Goldstein, Vadim E. Levit. colognetwente 2013: 51-54

A tight bound on the number of minimal dominating sets in split graphJean-François Couturier, Mathieu Liedloff. colognetwente 2013: 67-70

Linear time and almost linear time cases for minimal elimination orderingsElias Dahlhaus. colognetwente 2013: 75-78

Graph products for faster separation of 1-wheel inequalitiesSven de Vries. colognetwente 2013: 219-222

Routing ATM loading vehiclesEkrem Duman, Ahmet Altun. colognetwente 2013: 85-88

Observation and evolution of finite-dimensional Markov systemsUlrich Faigle, Alexander Schönhuth. colognetwente 2013: 93-97

Fooling-sets and rank in nonzero characteristicMirjam Friesen, Dirk Oliver Theis. colognetwente 2013: 107-111

Coloring of paths into forestsGiulia Galbiati, Stefano Gualandi. colognetwente 2013: 113-116

A linear kernel for planar red-blue dominating setValentin Garnero, Ignasi Sau, Dimitrios M. Thilikos. colognetwente 2013: 117-120

Two-dimensional optimal mechanism design for a single machine scheduling problemRuben Hoeksma, Marc Uetz. colognetwente 2013: 125-127

Application of the descent with mutations (DWM) metaheuristic to the computation of a median equivalence relationOlivier Hudry. colognetwente 2013: 129-132

Relaxation of 3-partition instancesSebastiaan J. C. Joosten, Hans Zantema. colognetwente 2013: 133-136

Semi blowup and blowup snarks and Berge-Fulkerson ConjectureK. Karam, D. Sasaki. colognetwente 2013: 137-140

An extension of the Collatz functionRoland Kaschek, Alexander Krumpholz. colognetwente 2013: 141-144

Constructing strategies in subclasses of McNaughton gamesImran Khaliq, Gulshad Imran. colognetwente 2013: 145-149

Toward a precise integrality gap for triangle-free 2-matchingsPhilipp Klodt, Anke van Zuylen. colognetwente 2013: 151-154

Manufacturing process flexibility with robust optimization using AIMMSOvidiu Listes. colognetwente 2013: 163

Hazmat transportation problem: instance size reduction through centrality erosionFabio Roda. colognetwente 2013: 201-204

The double projection method for some domination related parameters in Cartesian product graphsIsmael González Yero, Amaurys Rondón Aguilar. colognetwente 2013: 121-124

Exact and heuristic algorithms for the green vehicle routing problemÁngel Felipe Ortega, M. Teresa Ortuño Sánchez, Gregorio Tirado Domínguez, Giovanni Righini. colognetwente 2013: 103-106

Links

Filter by Year
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1

CTW (colognetwente)

Viewing Publication 1 - 100 from 515

2015

2013

Links

Filter by YearOR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top terms [+]OR AND NOT 1

CTW (colognetwente)

Viewing Publication 1 - 100 from 515

2015

2013

Filter by Year
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1